{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:TLLX4GGUB2O7I7AD63GGBOLRIU","short_pith_number":"pith:TLLX4GGU","schema_version":"1.0","canonical_sha256":"9ad77e18d40e9df47c03f6cc60b971452aee4d5a0235ab447f6b4fc9d6ba22e4","source":{"kind":"arxiv","id":"0801.3669","version":4},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0801.3669","created_at":"2026-05-17T23:49:53.536427+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.3669v4","created_at":"2026-05-17T23:49:53.536427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.3669","created_at":"2026-05-17T23:49:53.536427+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLLX4GGUB2O7","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLLX4GGUB2O7I7AD","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLLX4GGU","created_at":"2026-05-18T12:25:58.018023+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/TLLX4GGUB2O7I7AD63GGBOLRIU","json":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU.json","graph_json":"https://pith.science/api/pith-number/TLLX4GGUB2O7I7AD63GGBOLRIU/graph.json","events_json":"https://pith.science/api/pith-number/TLLX4GGUB2O7I7AD63GGBOLRIU/events.json","paper":"https://pith.science/paper/TLLX4GGU"},"agent_actions":{"view_html":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU","download_json":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU.json","view_paper":"https://pith.science/paper/TLLX4GGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.3669&json=true","fetch_graph":"https://pith.science/api/pith-number/TLLX4GGUB2O7I7AD63GGBOLRIU/graph.json","fetch_events":"https://pith.science/api/pith-number/TLLX4GGUB2O7I7AD63GGBOLRIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU/action/storage_attestation","attest_author":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU/action/author_attestation","sign_citation":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU/action/citation_signature","submit_replication":"https://pith.science/pith/TLLX4GGUB2O7I7AD63GGBOLRIU/action/replication_record"}},"created_at":"2026-05-17T23:49:53.536427+00:00","updated_at":"2026-05-17T23:49:53.536427+00:00"}