{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BT23KM5VZD4MR5DKWXYBLP7WFH","short_pith_number":"pith:BT23KM5V","schema_version":"1.0","canonical_sha256":"0cf5b533b5c8f8c8f46ab5f015bff629e39eeeae8200822c13c6d51e656c5b73","source":{"kind":"arxiv","id":"1108.2887","version":1},"attestation_state":"computed","paper":{"title":"Unconditionally-secure and reusable public-key authentication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lawrence M. Ioannou, Michele Mosca","submitted_at":"2011-08-14T16:22:01Z","abstract_excerpt":"We present a quantum-public-key identification protocol and show that it is secure against a computationally-unbounded adversary. This demonstrates for the first time that unconditionally-secure and reusable public-key authentication is possible in principle with (pure-state) public keys."},"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":"1108.2887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-08-14T16:22:01Z","cross_cats_sorted":[],"title_canon_sha256":"557232926b59702707f94fe7c22a94d09c3683665adfa74e555fb068a25a5699","abstract_canon_sha256":"f65f30106e3371579627d48470d4b813b13aba6f7b020d03a157bf82a2994446"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:28.999962Z","signature_b64":"L4INY/beJUdNG/JckW7Hai0XdfPh8+vzhW7ZFjozroLFIV0TdoF1bXkj6esSsJFdBb1nqmUQ/C0wAeEcDX9JCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cf5b533b5c8f8c8f46ab5f015bff629e39eeeae8200822c13c6d51e656c5b73","last_reissued_at":"2026-05-18T04:15:28.999568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:28.999568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unconditionally-secure and reusable public-key authentication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lawrence M. Ioannou, Michele Mosca","submitted_at":"2011-08-14T16:22:01Z","abstract_excerpt":"We present a quantum-public-key identification protocol and show that it is secure against a computationally-unbounded adversary. This demonstrates for the first time that unconditionally-secure and reusable public-key authentication is possible in principle with (pure-state) public keys."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2887","kind":"arxiv","version":1},"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":"1108.2887","created_at":"2026-05-18T04:15:28.999623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2887v1","created_at":"2026-05-18T04:15:28.999623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2887","created_at":"2026-05-18T04:15:28.999623+00:00"},{"alias_kind":"pith_short_12","alias_value":"BT23KM5VZD4M","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BT23KM5VZD4MR5DK","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BT23KM5V","created_at":"2026-05-18T12:26:24.575870+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/BT23KM5VZD4MR5DKWXYBLP7WFH","json":"https://pith.science/pith/BT23KM5VZD4MR5DKWXYBLP7WFH.json","graph_json":"https://pith.science/api/pith-number/BT23KM5VZD4MR5DKWXYBLP7WFH/graph.json","events_json":"https://pith.science/api/pith-number/BT23KM5VZD4MR5DKWXYBLP7WFH/events.json","paper":"https://pith.science/paper/BT23KM5V"},"agent_actions":{"view_html":"https://pith.science/pith/BT23KM5VZD4MR5DKWXYBLP7WFH","download_json":"https://pith.science/pith/BT23KM5VZD4MR5DKWXYBLP7WFH.json","view_paper":"https://pith.science/paper/BT23KM5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2887&json=true","fetch_graph":"https://pith.science/api/pith-number/BT23KM5VZD4MR5DKWXYBLP7WFH/graph.json","fetch_events":"https://pith.science/api/pith-number/BT23KM5VZD4MR5DKWXYBLP7WFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BT23KM5VZD4MR5DKWXYBLP7WFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BT23KM5VZD4MR5DKWXYBLP7WFH/action/storage_attestation","attest_author":"https://pith.science/pith/BT23KM5VZD4MR5DKWXYBLP7WFH/action/author_attestation","sign_citation":"https://pith.science/pith/BT23KM5VZD4MR5DKWXYBLP7WFH/action/citation_signature","submit_replication":"https://pith.science/pith/BT23KM5VZD4MR5DKWXYBLP7WFH/action/replication_record"}},"created_at":"2026-05-18T04:15:28.999623+00:00","updated_at":"2026-05-18T04:15:28.999623+00:00"}