{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HOOLI6TFESW674GM74UZH4RR72","short_pith_number":"pith:HOOLI6TF","schema_version":"1.0","canonical_sha256":"3b9cb47a6524adeff0ccff2993f231fe80292b27b14b6b995fbf3538f8ff3fbc","source":{"kind":"arxiv","id":"1505.02325","version":1},"attestation_state":"computed","paper":{"title":"Picking vs. Guessing Secrets: A Game-Theoretic Analysis (Technical Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.OC"],"primary_cat":"cs.GT","authors_text":"Carlos Cid, MHR Khouzani, Mudhakar Srivatsa, Piotr Mardziel","submitted_at":"2015-05-09T22:55:16Z","abstract_excerpt":"Choosing a hard-to-guess secret is a prerequisite in many security applications. Whether it is a password for user authentication or a secret key for a cryptographic primitive, picking it requires the user to trade-off usability costs with resistance against an adversary: a simple password is easier to remember but is also easier to guess; likewise, a shorter cryptographic key may require fewer computational and storage resources but it is also easier to attack. A fundamental question is how one can optimally resolve this trade-off. A big challenge is the fact that an adversary can also utiliz"},"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":"1505.02325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-05-09T22:55:16Z","cross_cats_sorted":["cs.CR","math.OC"],"title_canon_sha256":"1c1459b3e232e27bdc25cee0bb37dc7fae83f9cd4574e8b957c05b69f0349839","abstract_canon_sha256":"21b6b97297278a35b9c1c96a8413584050729574c4fcbce4815dc089a475cb86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:19.185627Z","signature_b64":"uPsOg0rO11AT7mfAce00SNpkWSnLbzz7IK/W4ZxWMWfBIyBnBWH+cCv7xSaE3F31B7Rr2yb9KC4HgYVnpH5QBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b9cb47a6524adeff0ccff2993f231fe80292b27b14b6b995fbf3538f8ff3fbc","last_reissued_at":"2026-05-18T02:16:19.184523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:19.184523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Picking vs. Guessing Secrets: A Game-Theoretic Analysis (Technical Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.OC"],"primary_cat":"cs.GT","authors_text":"Carlos Cid, MHR Khouzani, Mudhakar Srivatsa, Piotr Mardziel","submitted_at":"2015-05-09T22:55:16Z","abstract_excerpt":"Choosing a hard-to-guess secret is a prerequisite in many security applications. Whether it is a password for user authentication or a secret key for a cryptographic primitive, picking it requires the user to trade-off usability costs with resistance against an adversary: a simple password is easier to remember but is also easier to guess; likewise, a shorter cryptographic key may require fewer computational and storage resources but it is also easier to attack. A fundamental question is how one can optimally resolve this trade-off. A big challenge is the fact that an adversary can also utiliz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02325","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.02325","created_at":"2026-05-18T02:16:19.184946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02325v1","created_at":"2026-05-18T02:16:19.184946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02325","created_at":"2026-05-18T02:16:19.184946+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOOLI6TFESW6","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOOLI6TFESW674GM","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOOLI6TF","created_at":"2026-05-18T12:29:25.134429+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/HOOLI6TFESW674GM74UZH4RR72","json":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72.json","graph_json":"https://pith.science/api/pith-number/HOOLI6TFESW674GM74UZH4RR72/graph.json","events_json":"https://pith.science/api/pith-number/HOOLI6TFESW674GM74UZH4RR72/events.json","paper":"https://pith.science/paper/HOOLI6TF"},"agent_actions":{"view_html":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72","download_json":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72.json","view_paper":"https://pith.science/paper/HOOLI6TF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02325&json=true","fetch_graph":"https://pith.science/api/pith-number/HOOLI6TFESW674GM74UZH4RR72/graph.json","fetch_events":"https://pith.science/api/pith-number/HOOLI6TFESW674GM74UZH4RR72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72/action/storage_attestation","attest_author":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72/action/author_attestation","sign_citation":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72/action/citation_signature","submit_replication":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72/action/replication_record"}},"created_at":"2026-05-18T02:16:19.184946+00:00","updated_at":"2026-05-18T02:16:19.184946+00:00"}