{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WBC7HWPVALA3G4B42E3ZI7WREG","short_pith_number":"pith:WBC7HWPV","canonical_record":{"source":{"id":"1705.02296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-05-05T16:45:38Z","cross_cats_sorted":[],"title_canon_sha256":"e9e524755a433408ab496737877cdabe6f03413c4d8d72dcf9787c835a40588e","abstract_canon_sha256":"8e7b2bc0b7f08c3970f6fdde56c961cec88630805b02d4b740f5624c871f6cca"},"schema_version":"1.0"},"canonical_sha256":"b045f3d9f502c1b3703cd137947ed121a46c553e445547d821c2672c2532e275","source":{"kind":"arxiv","id":"1705.02296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02296","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02296v1","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02296","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"pith_short_12","alias_value":"WBC7HWPVALA3","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WBC7HWPVALA3G4B4","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WBC7HWPV","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WBC7HWPVALA3G4B42E3ZI7WREG","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-05-05T16:45:38Z","cross_cats_sorted":[],"title_canon_sha256":"e9e524755a433408ab496737877cdabe6f03413c4d8d72dcf9787c835a40588e","abstract_canon_sha256":"8e7b2bc0b7f08c3970f6fdde56c961cec88630805b02d4b740f5624c871f6cca"},"schema_version":"1.0"},"canonical_sha256":"b045f3d9f502c1b3703cd137947ed121a46c553e445547d821c2672c2532e275","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:58.649332Z","signature_b64":"ZlU9tUm/mksjlV0TXiVMM66EyrYQ0wRJNpF4UkcdoikuOiAwHRwoTgO7kuuvXQDPsU9pBLm5Cb3UqxrGoxUdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b045f3d9f502c1b3703cd137947ed121a46c553e445547d821c2672c2532e275","last_reissued_at":"2026-05-18T00:44:58.648866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:58.648866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02296","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:44:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"489mPR+IrfPqy9Z1wPtWzBzyRzrqaGj8o1eMtakk7DbGcAsYw5T9ZSw/0tWth8seIBRiqqjPw9ST7CWxa0Z4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:37:32.921958Z"},"content_sha256":"a52228a9448426db47a89f68300ea739b15f325116f394df0e7c177316a0c34b","schema_version":"1.0","event_id":"sha256:a52228a9448426db47a89f68300ea739b15f325116f394df0e7c177316a0c34b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WBC7HWPVALA3G4B42E3ZI7WREG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Formal Computational Unlinkability Proofs of RFID Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Adrien Koutsos, Hubert Comon","submitted_at":"2017-05-05T16:45:38Z","abstract_excerpt":"We set up a framework for the formal proofs of RFID protocols in the computational model. We rely on the so-called computationally complete symbolic attacker model. Our contributions are: i) To design (and prove sound) axioms reflecting the properties of hash functions (Collision-Resistance, PRF); ii) To formalize computational unlinkability in the model; iii) To illustrate the method, providing the first formal proofs of unlinkability of RFID protocols, in the computational model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02296","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:44:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPUXlBRArHPU4HQBu5HXiuqduo2y2kkIptuOobCD0X/FM6Ns2sQY6ggOHB0RvuingMajhHr6dDHDPdjw3SyZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:37:32.922295Z"},"content_sha256":"8dadf10427b1657ca366c59ebcc5c2d02504d3fc5aa8e2e0ac47f9aea0c55bff","schema_version":"1.0","event_id":"sha256:8dadf10427b1657ca366c59ebcc5c2d02504d3fc5aa8e2e0ac47f9aea0c55bff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBC7HWPVALA3G4B42E3ZI7WREG/bundle.json","state_url":"https://pith.science/pith/WBC7HWPVALA3G4B42E3ZI7WREG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBC7HWPVALA3G4B42E3ZI7WREG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T14:37:32Z","links":{"resolver":"https://pith.science/pith/WBC7HWPVALA3G4B42E3ZI7WREG","bundle":"https://pith.science/pith/WBC7HWPVALA3G4B42E3ZI7WREG/bundle.json","state":"https://pith.science/pith/WBC7HWPVALA3G4B42E3ZI7WREG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBC7HWPVALA3G4B42E3ZI7WREG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WBC7HWPVALA3G4B42E3ZI7WREG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8e7b2bc0b7f08c3970f6fdde56c961cec88630805b02d4b740f5624c871f6cca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-05-05T16:45:38Z","title_canon_sha256":"e9e524755a433408ab496737877cdabe6f03413c4d8d72dcf9787c835a40588e"},"schema_version":"1.0","source":{"id":"1705.02296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02296","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02296v1","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02296","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"pith_short_12","alias_value":"WBC7HWPVALA3","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WBC7HWPVALA3G4B4","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WBC7HWPV","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:8dadf10427b1657ca366c59ebcc5c2d02504d3fc5aa8e2e0ac47f9aea0c55bff","target":"graph","created_at":"2026-05-18T00:44:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We set up a framework for the formal proofs of RFID protocols in the computational model. We rely on the so-called computationally complete symbolic attacker model. Our contributions are: i) To design (and prove sound) axioms reflecting the properties of hash functions (Collision-Resistance, PRF); ii) To formalize computational unlinkability in the model; iii) To illustrate the method, providing the first formal proofs of unlinkability of RFID protocols, in the computational model.","authors_text":"Adrien Koutsos, Hubert Comon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-05-05T16:45:38Z","title":"Formal Computational Unlinkability Proofs of RFID Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02296","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a52228a9448426db47a89f68300ea739b15f325116f394df0e7c177316a0c34b","target":"record","created_at":"2026-05-18T00:44:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8e7b2bc0b7f08c3970f6fdde56c961cec88630805b02d4b740f5624c871f6cca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-05-05T16:45:38Z","title_canon_sha256":"e9e524755a433408ab496737877cdabe6f03413c4d8d72dcf9787c835a40588e"},"schema_version":"1.0","source":{"id":"1705.02296","kind":"arxiv","version":1}},"canonical_sha256":"b045f3d9f502c1b3703cd137947ed121a46c553e445547d821c2672c2532e275","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b045f3d9f502c1b3703cd137947ed121a46c553e445547d821c2672c2532e275","first_computed_at":"2026-05-18T00:44:58.648866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:58.648866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZlU9tUm/mksjlV0TXiVMM66EyrYQ0wRJNpF4UkcdoikuOiAwHRwoTgO7kuuvXQDPsU9pBLm5Cb3UqxrGoxUdDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:58.649332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a52228a9448426db47a89f68300ea739b15f325116f394df0e7c177316a0c34b","sha256:8dadf10427b1657ca366c59ebcc5c2d02504d3fc5aa8e2e0ac47f9aea0c55bff"],"state_sha256":"f84638fce9b922256d16667e028a3c15776b51a2838fd1f88443596b65d5ec1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MSZM18R/MT4q9H66/9LdUD6FFjVA+ur/YXMyHyoRL4CYLAYcR+qdM2PfC3BFQndH56YXHVGeOJkifngUHg4VCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T14:37:32.924165Z","bundle_sha256":"20cd4c7642e11016d9765a04abc997e7a48e2e5b3e1c9d95ff9010e3ea82d594"}}