{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:TLLX4GGUB2O7I7AD63GGBOLRIU","short_pith_number":"pith:TLLX4GGU","canonical_record":{"source":{"id":"0801.3669","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-01-23T21:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"c7f9ce180ef07519c9eb41769c08c73f819d850cc27f2ff1261a5f7f252e0349","abstract_canon_sha256":"7987242f14aa68a45d84f67022a3f91afccea4e92e02689c9acc0b992063be61"},"schema_version":"1.0"},"canonical_sha256":"9ad77e18d40e9df47c03f6cc60b971452aee4d5a0235ab447f6b4fc9d6ba22e4","source":{"kind":"arxiv","id":"0801.3669","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.3669","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"0801.3669v4","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.3669","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"TLLX4GGUB2O7","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"TLLX4GGUB2O7I7AD","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"TLLX4GGU","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:TLLX4GGUB2O7I7AD63GGBOLRIU","target":"record","payload":{"canonical_record":{"source":{"id":"0801.3669","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-01-23T21:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"c7f9ce180ef07519c9eb41769c08c73f819d850cc27f2ff1261a5f7f252e0349","abstract_canon_sha256":"7987242f14aa68a45d84f67022a3f91afccea4e92e02689c9acc0b992063be61"},"schema_version":"1.0"},"canonical_sha256":"9ad77e18d40e9df47c03f6cc60b971452aee4d5a0235ab447f6b4fc9d6ba22e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:53.536755Z","signature_b64":"pzPJmUPfMXPuMQHx8fWCY/CtSXUGegkRjPI9g/vyfDCPOC5Yuv5qRXvju2fTVoGaU1nii3pZGRRsRjdaCF5qCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ad77e18d40e9df47c03f6cc60b971452aee4d5a0235ab447f6b4fc9d6ba22e4","last_reissued_at":"2026-05-17T23:49:53.536355Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:53.536355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0801.3669","source_version":4,"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-17T23:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJdrLLyvbcJssMTxY5v/mhDfXXhU4fHSH2pIDmnsW5HXJaLPAtoV3Amf2QSnhU8EMvE4/8DFz9q09KvdnT4NDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:13:24.943944Z"},"content_sha256":"5531108154e4fc70877fb55883c5fe8f44aa0c3b66bd9b64396f2a152b6942cf","schema_version":"1.0","event_id":"sha256:5531108154e4fc70877fb55883c5fe8f44aa0c3b66bd9b64396f2a152b6942cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:TLLX4GGUB2O7I7AD63GGBOLRIU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Merkle's Key Agreement Protocol is Optimal: An $O(n^2)$ Attack on any Key Agreement from Random Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Boaz Barak, Mohammad Mahmoody","submitted_at":"2008-01-23T21:01:37Z","abstract_excerpt":"We prove that every key agreement protocol in the random oracle model in which the honest users make at most $n$ queries to the oracle can be broken by an adversary who makes $O(n^2)$ queries to the oracle. This improves on the previous $\\widetilde{\\Omega}(n^6)$ query attack given by Impagliazzo and Rudich (STOC '89) and resolves an open question posed by them.\n  Our bound is optimal up to a constant factor since Merkle proposed a key agreement protocol in 1974 that can be easily implemented with $n$ queries to a random oracle and cannot be broken by any adversary who asks $o(n^2)$ queries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.3669","kind":"arxiv","version":4},"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-17T23:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ObDwWouwmwsBpnMi/8OdgkrqFgTMAdpXcoECM9eEnxJbeXDdmsolgh8+hBDUNlMlInM9mGI4c6BIxg/nA5FfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:13:24.944299Z"},"content_sha256":"98bece170f738e991d2170a405fa3a5d0469286097dddceb135a8a6c0e65157f","schema_version":"1.0","event_id":"sha256:98bece170f738e991d2170a405fa3a5d0469286097dddceb135a8a6c0e65157f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU/bundle.json","state_url":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLLX4GGUB2O7I7AD63GGBOLRIU/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-05T08:13:24Z","links":{"resolver":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU","bundle":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU/bundle.json","state":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLLX4GGUB2O7I7AD63GGBOLRIU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:TLLX4GGUB2O7I7AD63GGBOLRIU","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":"7987242f14aa68a45d84f67022a3f91afccea4e92e02689c9acc0b992063be61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-01-23T21:01:37Z","title_canon_sha256":"c7f9ce180ef07519c9eb41769c08c73f819d850cc27f2ff1261a5f7f252e0349"},"schema_version":"1.0","source":{"id":"0801.3669","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.3669","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"0801.3669v4","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.3669","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"TLLX4GGUB2O7","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"TLLX4GGUB2O7I7AD","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"TLLX4GGU","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:98bece170f738e991d2170a405fa3a5d0469286097dddceb135a8a6c0e65157f","target":"graph","created_at":"2026-05-17T23:49:53Z","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 prove that every key agreement protocol in the random oracle model in which the honest users make at most $n$ queries to the oracle can be broken by an adversary who makes $O(n^2)$ queries to the oracle. This improves on the previous $\\widetilde{\\Omega}(n^6)$ query attack given by Impagliazzo and Rudich (STOC '89) and resolves an open question posed by them.\n  Our bound is optimal up to a constant factor since Merkle proposed a key agreement protocol in 1974 that can be easily implemented with $n$ queries to a random oracle and cannot be broken by any adversary who asks $o(n^2)$ queries.","authors_text":"Boaz Barak, Mohammad Mahmoody","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-01-23T21:01:37Z","title":"Merkle's Key Agreement Protocol is Optimal: An $O(n^2)$ Attack on any Key Agreement from Random Oracles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.3669","kind":"arxiv","version":4},"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:5531108154e4fc70877fb55883c5fe8f44aa0c3b66bd9b64396f2a152b6942cf","target":"record","created_at":"2026-05-17T23:49:53Z","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":"7987242f14aa68a45d84f67022a3f91afccea4e92e02689c9acc0b992063be61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-01-23T21:01:37Z","title_canon_sha256":"c7f9ce180ef07519c9eb41769c08c73f819d850cc27f2ff1261a5f7f252e0349"},"schema_version":"1.0","source":{"id":"0801.3669","kind":"arxiv","version":4}},"canonical_sha256":"9ad77e18d40e9df47c03f6cc60b971452aee4d5a0235ab447f6b4fc9d6ba22e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ad77e18d40e9df47c03f6cc60b971452aee4d5a0235ab447f6b4fc9d6ba22e4","first_computed_at":"2026-05-17T23:49:53.536355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:53.536355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pzPJmUPfMXPuMQHx8fWCY/CtSXUGegkRjPI9g/vyfDCPOC5Yuv5qRXvju2fTVoGaU1nii3pZGRRsRjdaCF5qCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:53.536755Z","signed_message":"canonical_sha256_bytes"},"source_id":"0801.3669","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5531108154e4fc70877fb55883c5fe8f44aa0c3b66bd9b64396f2a152b6942cf","sha256:98bece170f738e991d2170a405fa3a5d0469286097dddceb135a8a6c0e65157f"],"state_sha256":"e2413a053d5cab7b2152742136b42fc9fe72c4373eee800b2be3582c0709e4fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DS/pb05L8prhd+D8xy7Rv+H2fRQO3lpez7HVVrj8RMRL5xA8qpOx4nvq5b4OGlIvzaFeC05vDxA/yjc+uIBoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:13:24.946371Z","bundle_sha256":"7188d3b114c8475759357479ae9c037556732d748cbf3db10d8e4200aaf47f37"}}