{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IFC3MKCO2PIAIYAATVGAVQEFRZ","short_pith_number":"pith:IFC3MKCO","schema_version":"1.0","canonical_sha256":"4145b6284ed3d00460009d4c0ac0858e564f5e299f8d3c02c1b6a357dff42375","source":{"kind":"arxiv","id":"2311.01600","version":3},"attestation_state":"computed","paper":{"title":"Security Proof for Variable-Length Quantum Key Distribution","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Devashish Tupkary, Ernest Y.-Z. Tan, Norbert L\\\"utkenhaus","submitted_at":"2023-11-02T21:14:23Z","abstract_excerpt":"We present a security proof for variable-length QKD in the Renner framework against IID collective attacks. Our proof can be lifted to coherent attacks using the postselection technique. Our first main result is a theorem to convert a series of security proofs for fixed-length protocols satisfying certain conditions to a security proof for a variable-length protocol. This conversion requires no new calculations, does not require any changes to the final key lengths or the amount of error-correction information, and at most doubles the security parameter. Our second main result is the descripti"},"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":"2311.01600","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-02T21:14:23Z","cross_cats_sorted":[],"title_canon_sha256":"f062093b8e8deaa445ff4641fcb158ae5b823661eba40861a20df5ff81244ddb","abstract_canon_sha256":"312228d4510e1bb5f15e14e382b29e4e5e6edb0a10150b9e6780d0f8255ef6cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:01.595368Z","signature_b64":"sZulVCymPxQorYm5+hkLcdra6MVXKPsTV63OKxRHNVTn6AyO1OFz8XlcuVKDdVOQ27Vfa6n3oHxB2MIAAJDgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4145b6284ed3d00460009d4c0ac0858e564f5e299f8d3c02c1b6a357dff42375","last_reissued_at":"2026-07-05T08:18:01.594906Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:01.594906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Security Proof for Variable-Length Quantum Key Distribution","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Devashish Tupkary, Ernest Y.-Z. Tan, Norbert L\\\"utkenhaus","submitted_at":"2023-11-02T21:14:23Z","abstract_excerpt":"We present a security proof for variable-length QKD in the Renner framework against IID collective attacks. Our proof can be lifted to coherent attacks using the postselection technique. Our first main result is a theorem to convert a series of security proofs for fixed-length protocols satisfying certain conditions to a security proof for a variable-length protocol. This conversion requires no new calculations, does not require any changes to the final key lengths or the amount of error-correction information, and at most doubles the security parameter. Our second main result is the descripti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.01600","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.01600/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.01600","created_at":"2026-07-05T08:18:01.594962+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.01600v3","created_at":"2026-07-05T08:18:01.594962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.01600","created_at":"2026-07-05T08:18:01.594962+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFC3MKCO2PIA","created_at":"2026-07-05T08:18:01.594962+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFC3MKCO2PIAIYAA","created_at":"2026-07-05T08:18:01.594962+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFC3MKCO","created_at":"2026-07-05T08:18:01.594962+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20346","citing_title":"Effective discrete-modulated continuous variable QKD under general attacks","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2511.10584","citing_title":"Finite-size quantum key distribution rates from R\\'enyi entropies using conic optimization","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IFC3MKCO2PIAIYAATVGAVQEFRZ","json":"https://pith.science/pith/IFC3MKCO2PIAIYAATVGAVQEFRZ.json","graph_json":"https://pith.science/api/pith-number/IFC3MKCO2PIAIYAATVGAVQEFRZ/graph.json","events_json":"https://pith.science/api/pith-number/IFC3MKCO2PIAIYAATVGAVQEFRZ/events.json","paper":"https://pith.science/paper/IFC3MKCO"},"agent_actions":{"view_html":"https://pith.science/pith/IFC3MKCO2PIAIYAATVGAVQEFRZ","download_json":"https://pith.science/pith/IFC3MKCO2PIAIYAATVGAVQEFRZ.json","view_paper":"https://pith.science/paper/IFC3MKCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.01600&json=true","fetch_graph":"https://pith.science/api/pith-number/IFC3MKCO2PIAIYAATVGAVQEFRZ/graph.json","fetch_events":"https://pith.science/api/pith-number/IFC3MKCO2PIAIYAATVGAVQEFRZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFC3MKCO2PIAIYAATVGAVQEFRZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFC3MKCO2PIAIYAATVGAVQEFRZ/action/storage_attestation","attest_author":"https://pith.science/pith/IFC3MKCO2PIAIYAATVGAVQEFRZ/action/author_attestation","sign_citation":"https://pith.science/pith/IFC3MKCO2PIAIYAATVGAVQEFRZ/action/citation_signature","submit_replication":"https://pith.science/pith/IFC3MKCO2PIAIYAATVGAVQEFRZ/action/replication_record"}},"created_at":"2026-07-05T08:18:01.594962+00:00","updated_at":"2026-07-05T08:18:01.594962+00:00"}