{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:23XHDBX7JEHRSD6NIUY2CTQVEL","short_pith_number":"pith:23XHDBX7","schema_version":"1.0","canonical_sha256":"d6ee7186ff490f190fcd4531a14e1522d23bc2518b3d0faedd74cd41c6dcaf49","source":{"kind":"arxiv","id":"1307.8186","version":1},"attestation_state":"computed","paper":{"title":"An Oblivious Password Cracking Server","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"2) ((1) Core Security Technologies, (2) ITBA (Instituto Tecnologico de Buenos Aires)), Ariel Futoransky (1), Aureliano Calvo (1), Carlos Sarraute (1","submitted_at":"2013-07-31T01:45:47Z","abstract_excerpt":"Building a password cracking server that preserves the privacy of the queries made to the server is a problem that has not yet been solved. Such a server could acquire practical relevance in the future: for instance, the tables used to crack the passwords could be calculated, stored and hosted in cloud-computing services, and could be queried from devices with limited computing power.\n  In this paper we present a method to preserve the confidentiality of a password cracker---wherein the tables used to crack the passwords are stored by a third party---by combining Hellman tables and Private Inf"},"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":"1307.8186","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2013-07-31T01:45:47Z","cross_cats_sorted":[],"title_canon_sha256":"f6a560ea76ef2383ca2507e06bc67fcc260e1dfa841fdcbe98e7d277dc5eec01","abstract_canon_sha256":"a6fd3c89f75260d56a26a50ecde84273087d1ab47a376df489fa2f7f2280c45f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:02.116122Z","signature_b64":"pwPsyUCI75gBrLKke1WMLHBQHVT9dg1dJA+qsy3Klf5wPVtXXT05ictewNGwkXlV1TGkZ1j9Tgw9zwASFVzPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6ee7186ff490f190fcd4531a14e1522d23bc2518b3d0faedd74cd41c6dcaf49","last_reissued_at":"2026-05-18T03:17:02.115261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:02.115261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Oblivious Password Cracking Server","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"2) ((1) Core Security Technologies, (2) ITBA (Instituto Tecnologico de Buenos Aires)), Ariel Futoransky (1), Aureliano Calvo (1), Carlos Sarraute (1","submitted_at":"2013-07-31T01:45:47Z","abstract_excerpt":"Building a password cracking server that preserves the privacy of the queries made to the server is a problem that has not yet been solved. Such a server could acquire practical relevance in the future: for instance, the tables used to crack the passwords could be calculated, stored and hosted in cloud-computing services, and could be queried from devices with limited computing power.\n  In this paper we present a method to preserve the confidentiality of a password cracker---wherein the tables used to crack the passwords are stored by a third party---by combining Hellman tables and Private Inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8186","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":"1307.8186","created_at":"2026-05-18T03:17:02.115426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.8186v1","created_at":"2026-05-18T03:17:02.115426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8186","created_at":"2026-05-18T03:17:02.115426+00:00"},{"alias_kind":"pith_short_12","alias_value":"23XHDBX7JEHR","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"23XHDBX7JEHRSD6N","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"23XHDBX7","created_at":"2026-05-18T12:27:30.460161+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/23XHDBX7JEHRSD6NIUY2CTQVEL","json":"https://pith.science/pith/23XHDBX7JEHRSD6NIUY2CTQVEL.json","graph_json":"https://pith.science/api/pith-number/23XHDBX7JEHRSD6NIUY2CTQVEL/graph.json","events_json":"https://pith.science/api/pith-number/23XHDBX7JEHRSD6NIUY2CTQVEL/events.json","paper":"https://pith.science/paper/23XHDBX7"},"agent_actions":{"view_html":"https://pith.science/pith/23XHDBX7JEHRSD6NIUY2CTQVEL","download_json":"https://pith.science/pith/23XHDBX7JEHRSD6NIUY2CTQVEL.json","view_paper":"https://pith.science/paper/23XHDBX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.8186&json=true","fetch_graph":"https://pith.science/api/pith-number/23XHDBX7JEHRSD6NIUY2CTQVEL/graph.json","fetch_events":"https://pith.science/api/pith-number/23XHDBX7JEHRSD6NIUY2CTQVEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23XHDBX7JEHRSD6NIUY2CTQVEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23XHDBX7JEHRSD6NIUY2CTQVEL/action/storage_attestation","attest_author":"https://pith.science/pith/23XHDBX7JEHRSD6NIUY2CTQVEL/action/author_attestation","sign_citation":"https://pith.science/pith/23XHDBX7JEHRSD6NIUY2CTQVEL/action/citation_signature","submit_replication":"https://pith.science/pith/23XHDBX7JEHRSD6NIUY2CTQVEL/action/replication_record"}},"created_at":"2026-05-18T03:17:02.115426+00:00","updated_at":"2026-05-18T03:17:02.115426+00:00"}