{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MAZVOXFHVWCZVH7NHWXHEMFXWT","short_pith_number":"pith:MAZVOXFH","schema_version":"1.0","canonical_sha256":"6033575ca7ad859a9fed3dae7230b7b4c2820360dbbaa3edf8fb2b907f4a2423","source":{"kind":"arxiv","id":"2006.04522","version":2},"attestation_state":"computed","paper":{"title":"Client-Server Identification Protocols with Quantum PUF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Elham Kashefi, Mahshid Delavar, Mina Doosti, Niraj Kumar","submitted_at":"2020-06-08T12:35:09Z","abstract_excerpt":"Recently, major progress has been made towards the realisation of quantum internet to enable a broad range of classically intractable applications. These applications such as delegated quantum computation require running a secure identification protocol between a low-resource and a high-resource party to provide secure communication. In this work, we propose two identification protocols based on the emerging hardware secure solutions, the quantum Physical Unclonable Functions (qPUFs). The first protocol allows a low-resource party to prove its identity to a high-resource party and in the secon"},"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":"2006.04522","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-06-08T12:35:09Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"428d6699c6a7748ce00a6d4bcefc8695d1513f3b659dbfd54ca5e94db2f84885","abstract_canon_sha256":"4dfa64417c7b85fc58f51b27cc133d1c1d44d0179abebe02c29aa64576ae41d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:18:59.891124Z","signature_b64":"SHlRu3CO9I0aZny9owJIpCANZ1kNU4aBD7rfKGPnaHkciJcrzJDgszRmbd86WQtuf/bNKEKhvgdlgn0aUEdZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6033575ca7ad859a9fed3dae7230b7b4c2820360dbbaa3edf8fb2b907f4a2423","last_reissued_at":"2026-07-05T03:18:59.890672Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:18:59.890672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Client-Server Identification Protocols with Quantum PUF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Elham Kashefi, Mahshid Delavar, Mina Doosti, Niraj Kumar","submitted_at":"2020-06-08T12:35:09Z","abstract_excerpt":"Recently, major progress has been made towards the realisation of quantum internet to enable a broad range of classically intractable applications. These applications such as delegated quantum computation require running a secure identification protocol between a low-resource and a high-resource party to provide secure communication. In this work, we propose two identification protocols based on the emerging hardware secure solutions, the quantum Physical Unclonable Functions (qPUFs). The first protocol allows a low-resource party to prove its identity to a high-resource party and in the secon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.04522","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.04522/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":"2006.04522","created_at":"2026-07-05T03:18:59.890733+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.04522v2","created_at":"2026-07-05T03:18:59.890733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.04522","created_at":"2026-07-05T03:18:59.890733+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAZVOXFHVWCZ","created_at":"2026-07-05T03:18:59.890733+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAZVOXFHVWCZVH7N","created_at":"2026-07-05T03:18:59.890733+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAZVOXFH","created_at":"2026-07-05T03:18:59.890733+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30636","citing_title":"Authentication in Quantum Networks","ref_index":87,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MAZVOXFHVWCZVH7NHWXHEMFXWT","json":"https://pith.science/pith/MAZVOXFHVWCZVH7NHWXHEMFXWT.json","graph_json":"https://pith.science/api/pith-number/MAZVOXFHVWCZVH7NHWXHEMFXWT/graph.json","events_json":"https://pith.science/api/pith-number/MAZVOXFHVWCZVH7NHWXHEMFXWT/events.json","paper":"https://pith.science/paper/MAZVOXFH"},"agent_actions":{"view_html":"https://pith.science/pith/MAZVOXFHVWCZVH7NHWXHEMFXWT","download_json":"https://pith.science/pith/MAZVOXFHVWCZVH7NHWXHEMFXWT.json","view_paper":"https://pith.science/paper/MAZVOXFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.04522&json=true","fetch_graph":"https://pith.science/api/pith-number/MAZVOXFHVWCZVH7NHWXHEMFXWT/graph.json","fetch_events":"https://pith.science/api/pith-number/MAZVOXFHVWCZVH7NHWXHEMFXWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAZVOXFHVWCZVH7NHWXHEMFXWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAZVOXFHVWCZVH7NHWXHEMFXWT/action/storage_attestation","attest_author":"https://pith.science/pith/MAZVOXFHVWCZVH7NHWXHEMFXWT/action/author_attestation","sign_citation":"https://pith.science/pith/MAZVOXFHVWCZVH7NHWXHEMFXWT/action/citation_signature","submit_replication":"https://pith.science/pith/MAZVOXFHVWCZVH7NHWXHEMFXWT/action/replication_record"}},"created_at":"2026-07-05T03:18:59.890733+00:00","updated_at":"2026-07-05T03:18:59.890733+00:00"}