{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:N55SOSGAAWABAJKAUWV74T2US3","short_pith_number":"pith:N55SOSGA","schema_version":"1.0","canonical_sha256":"6f7b2748c00580102540a5abfe4f5496dd650b2a0a48855a85399d25c162f5eb","source":{"kind":"arxiv","id":"quant-ph/0409125","version":2},"attestation_state":"computed","paper":{"title":"Simulatable security for quantum protocols","license":"","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Dominique Unruh","submitted_at":"2004-09-18T19:26:47Z","abstract_excerpt":"The notion of simulatable security (reactive simulatability, universal composability) is a powerful tool for allowing the modular design of cryptographic protocols (composition of protocols) and showing the security of a given protocol embedded in a larger one. Recently, these methods have received much attention in the quantum cryptographic community.\n  We give a short introduction to simulatable security in general and proceed by sketching the many different definitional choices together with their advantages and disadvantages.\n  Based on the reactive simulatability modelling of Backes, Pfit"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/0409125","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-09-18T19:26:47Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"05549ab1b084371d079777e0296fecd03089ce65c193c9618863bcd31a8e0b9a","abstract_canon_sha256":"c7270abddce2b5f8d3d9679a3acc3a3b7cb7cce333f11b2da3bfd3392ea1157e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:46.422445Z","signature_b64":"cDkNESozBi7MNaM+Cm3WBI4Q9L+VFastYMCglwY9h7Y96KF62QbeVL5fSZotiWoErARlBmqcfgpYj/j5QnApCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f7b2748c00580102540a5abfe4f5496dd650b2a0a48855a85399d25c162f5eb","last_reissued_at":"2026-05-18T00:23:46.422045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:46.422045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulatable security for quantum protocols","license":"","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Dominique Unruh","submitted_at":"2004-09-18T19:26:47Z","abstract_excerpt":"The notion of simulatable security (reactive simulatability, universal composability) is a powerful tool for allowing the modular design of cryptographic protocols (composition of protocols) and showing the security of a given protocol embedded in a larger one. Recently, these methods have received much attention in the quantum cryptographic community.\n  We give a short introduction to simulatable security in general and proceed by sketching the many different definitional choices together with their advantages and disadvantages.\n  Based on the reactive simulatability modelling of Backes, Pfit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0409125","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0409125","created_at":"2026-05-18T00:23:46.422109+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0409125v2","created_at":"2026-05-18T00:23:46.422109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0409125","created_at":"2026-05-18T00:23:46.422109+00:00"},{"alias_kind":"pith_short_12","alias_value":"N55SOSGAAWAB","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"N55SOSGAAWABAJKA","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"N55SOSGA","created_at":"2026-05-18T12:25:52.687210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.11243","citing_title":"Side-channel-secure quantum key distribution with correlated sources","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N55SOSGAAWABAJKAUWV74T2US3","json":"https://pith.science/pith/N55SOSGAAWABAJKAUWV74T2US3.json","graph_json":"https://pith.science/api/pith-number/N55SOSGAAWABAJKAUWV74T2US3/graph.json","events_json":"https://pith.science/api/pith-number/N55SOSGAAWABAJKAUWV74T2US3/events.json","paper":"https://pith.science/paper/N55SOSGA"},"agent_actions":{"view_html":"https://pith.science/pith/N55SOSGAAWABAJKAUWV74T2US3","download_json":"https://pith.science/pith/N55SOSGAAWABAJKAUWV74T2US3.json","view_paper":"https://pith.science/paper/N55SOSGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0409125&json=true","fetch_graph":"https://pith.science/api/pith-number/N55SOSGAAWABAJKAUWV74T2US3/graph.json","fetch_events":"https://pith.science/api/pith-number/N55SOSGAAWABAJKAUWV74T2US3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N55SOSGAAWABAJKAUWV74T2US3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N55SOSGAAWABAJKAUWV74T2US3/action/storage_attestation","attest_author":"https://pith.science/pith/N55SOSGAAWABAJKAUWV74T2US3/action/author_attestation","sign_citation":"https://pith.science/pith/N55SOSGAAWABAJKAUWV74T2US3/action/citation_signature","submit_replication":"https://pith.science/pith/N55SOSGAAWABAJKAUWV74T2US3/action/replication_record"}},"created_at":"2026-05-18T00:23:46.422109+00:00","updated_at":"2026-05-18T00:23:46.422109+00:00"}