{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:LMQBORI7G33YT4QCPMFQY3RXHZ","short_pith_number":"pith:LMQBORI7","schema_version":"1.0","canonical_sha256":"5b2017451f36f789f2027b0b0c6e373e6857c1e20b43a330eba82a8028cf05e0","source":{"kind":"arxiv","id":"0801.3680","version":3},"attestation_state":"computed","paper":{"title":"Lower Bounds on Signatures from Symmetric Primitives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.CC","authors_text":"Boaz Barak, Mohammad Mahmoody","submitted_at":"2008-01-23T22:16:00Z","abstract_excerpt":"We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most $2^{(1+o(1))q}$, where $q$ is the total number of oracle queries asked by the key generation, signing, and verification algorithms. That is, any such scheme can be broken with probability close to $1$ by a (computationally unbounded) adversary making $2^{(1+o(1))q}$ queries to the oracle. This is tight up to a constant factor in the number of queries, since a simple modification of Lamport's one-time signatures (Lamport '79) achieves $2^{(0.812-o(1))q}$ black-box security usin"},"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.3680","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-01-23T22:16:00Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"6ca570387fdd04eabf9ffcf2b795ea84d0caf32f8fe79db3e70d1b5976750880","abstract_canon_sha256":"8e5fe07315d8a620eba98335f2d7cea3309dd470daa57de80fb7c8ee42765715"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:53.531166Z","signature_b64":"pRXlR6hA3Id2M9jLVNBtfeb/mAJvbj9k5K/DCGL6hYNBJqDkUTn08ogYoXMEQiFwsBsF1sacL1UTMDwWneHFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b2017451f36f789f2027b0b0c6e373e6857c1e20b43a330eba82a8028cf05e0","last_reissued_at":"2026-05-17T23:49:53.530730Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:53.530730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on Signatures from Symmetric Primitives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.CC","authors_text":"Boaz Barak, Mohammad Mahmoody","submitted_at":"2008-01-23T22:16:00Z","abstract_excerpt":"We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most $2^{(1+o(1))q}$, where $q$ is the total number of oracle queries asked by the key generation, signing, and verification algorithms. That is, any such scheme can be broken with probability close to $1$ by a (computationally unbounded) adversary making $2^{(1+o(1))q}$ queries to the oracle. This is tight up to a constant factor in the number of queries, since a simple modification of Lamport's one-time signatures (Lamport '79) achieves $2^{(0.812-o(1))q}$ black-box security usin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.3680","kind":"arxiv","version":3},"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.3680","created_at":"2026-05-17T23:49:53.530797+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.3680v3","created_at":"2026-05-17T23:49:53.530797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.3680","created_at":"2026-05-17T23:49:53.530797+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMQBORI7G33Y","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMQBORI7G33YT4QC","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMQBORI7","created_at":"2026-05-18T12:25:57.157939+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/LMQBORI7G33YT4QCPMFQY3RXHZ","json":"https://pith.science/pith/LMQBORI7G33YT4QCPMFQY3RXHZ.json","graph_json":"https://pith.science/api/pith-number/LMQBORI7G33YT4QCPMFQY3RXHZ/graph.json","events_json":"https://pith.science/api/pith-number/LMQBORI7G33YT4QCPMFQY3RXHZ/events.json","paper":"https://pith.science/paper/LMQBORI7"},"agent_actions":{"view_html":"https://pith.science/pith/LMQBORI7G33YT4QCPMFQY3RXHZ","download_json":"https://pith.science/pith/LMQBORI7G33YT4QCPMFQY3RXHZ.json","view_paper":"https://pith.science/paper/LMQBORI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.3680&json=true","fetch_graph":"https://pith.science/api/pith-number/LMQBORI7G33YT4QCPMFQY3RXHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LMQBORI7G33YT4QCPMFQY3RXHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMQBORI7G33YT4QCPMFQY3RXHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMQBORI7G33YT4QCPMFQY3RXHZ/action/storage_attestation","attest_author":"https://pith.science/pith/LMQBORI7G33YT4QCPMFQY3RXHZ/action/author_attestation","sign_citation":"https://pith.science/pith/LMQBORI7G33YT4QCPMFQY3RXHZ/action/citation_signature","submit_replication":"https://pith.science/pith/LMQBORI7G33YT4QCPMFQY3RXHZ/action/replication_record"}},"created_at":"2026-05-17T23:49:53.530797+00:00","updated_at":"2026-05-17T23:49:53.530797+00:00"}