{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:HDKHO53AAARXENER32PDFQSVLO","short_pith_number":"pith:HDKHO53A","schema_version":"1.0","canonical_sha256":"38d47777600023723491de9e32c2555bbb676d1b500ed4ccffd6eb80ef4a0231","source":{"kind":"arxiv","id":"quant-ph/0509169","version":2},"attestation_state":"computed","paper":{"title":"On the Optimality of Quantum Encryption Schemes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Nagaj, Iordanis Kerenidis","submitted_at":"2005-09-23T12:58:44Z","abstract_excerpt":"It is well known that n bits of entropy are necessary and sufficient to perfectly encrypt n bits (one-time pad). Even if we allow the encryption to be approximate, the amount of entropy needed doesn't asymptotically change. However, this is not the case when we are encrypting quantum bits. For the perfect encryption of n quantum bits, 2n bits of entropy are necessary and sufficient (quantum one-time pad), but for approximate encryption one asymptotically needs only n bits of entropy. In this paper, we provide the optimal trade-off between the approximation measure epsilon and the amount of cla"},"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/0509169","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-23T12:58:44Z","cross_cats_sorted":[],"title_canon_sha256":"19dbc76a00888d40d9c6422ae8e1d463916ade7636eeb1dc454e86329e3e17fd","abstract_canon_sha256":"dc33e648bd28eaaefc352398e6eac13101a5f3ef41c21f1980e0ebd850c5f781"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:57.412119Z","signature_b64":"jO6bMTQO0aH2bpD+TZecen7l8IEocoxWzORlQYk+5YC3596YpxJy0NNCSvg6yN5N7abWi/0sYvgVK/eKhA4bAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38d47777600023723491de9e32c2555bbb676d1b500ed4ccffd6eb80ef4a0231","last_reissued_at":"2026-05-18T01:37:57.411589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:57.411589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Optimality of Quantum Encryption Schemes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Nagaj, Iordanis Kerenidis","submitted_at":"2005-09-23T12:58:44Z","abstract_excerpt":"It is well known that n bits of entropy are necessary and sufficient to perfectly encrypt n bits (one-time pad). Even if we allow the encryption to be approximate, the amount of entropy needed doesn't asymptotically change. However, this is not the case when we are encrypting quantum bits. For the perfect encryption of n quantum bits, 2n bits of entropy are necessary and sufficient (quantum one-time pad), but for approximate encryption one asymptotically needs only n bits of entropy. In this paper, we provide the optimal trade-off between the approximation measure epsilon and the amount of cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0509169","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/0509169","created_at":"2026-05-18T01:37:57.411671+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0509169v2","created_at":"2026-05-18T01:37:57.411671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0509169","created_at":"2026-05-18T01:37:57.411671+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDKHO53AAARX","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDKHO53AAARXENER","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDKHO53A","created_at":"2026-05-18T12:25:53.335082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDKHO53AAARXENER32PDFQSVLO","json":"https://pith.science/pith/HDKHO53AAARXENER32PDFQSVLO.json","graph_json":"https://pith.science/api/pith-number/HDKHO53AAARXENER32PDFQSVLO/graph.json","events_json":"https://pith.science/api/pith-number/HDKHO53AAARXENER32PDFQSVLO/events.json","paper":"https://pith.science/paper/HDKHO53A"},"agent_actions":{"view_html":"https://pith.science/pith/HDKHO53AAARXENER32PDFQSVLO","download_json":"https://pith.science/pith/HDKHO53AAARXENER32PDFQSVLO.json","view_paper":"https://pith.science/paper/HDKHO53A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0509169&json=true","fetch_graph":"https://pith.science/api/pith-number/HDKHO53AAARXENER32PDFQSVLO/graph.json","fetch_events":"https://pith.science/api/pith-number/HDKHO53AAARXENER32PDFQSVLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDKHO53AAARXENER32PDFQSVLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDKHO53AAARXENER32PDFQSVLO/action/storage_attestation","attest_author":"https://pith.science/pith/HDKHO53AAARXENER32PDFQSVLO/action/author_attestation","sign_citation":"https://pith.science/pith/HDKHO53AAARXENER32PDFQSVLO/action/citation_signature","submit_replication":"https://pith.science/pith/HDKHO53AAARXENER32PDFQSVLO/action/replication_record"}},"created_at":"2026-05-18T01:37:57.411671+00:00","updated_at":"2026-05-18T01:37:57.411671+00:00"}