{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:264JG4CHW6KYFUHX4TI5CCW3AW","short_pith_number":"pith:264JG4CH","schema_version":"1.0","canonical_sha256":"d7b8937047b79582d0f7e4d1d10adb05912e1e9cb5bc37b436d52032a3fedbe4","source":{"kind":"arxiv","id":"2402.03633","version":1},"attestation_state":"computed","paper":{"title":"Lossy Cryptography from Code-Based Assumptions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Aayush Jain, Quang Dao","submitted_at":"2024-02-06T02:17:08Z","abstract_excerpt":"Over the past few decades, we have seen a proliferation of advanced cryptographic primitives with lossy or homomorphic properties built from various assumptions such as Quadratic Residuosity, Decisional Diffie-Hellman, and Learning with Errors. These primitives imply hard problems in the complexity class $SZK$ (statistical zero-knowledge); as a consequence, they can only be based on assumptions that are broken in $BPP^{SZK}$. This poses a barrier for building advanced primitives from code-based assumptions, as the only known such assumption is Learning Parity with Noise (LPN) with an extremely"},"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":"2402.03633","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2024-02-06T02:17:08Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"2346ffcd37c6b36683aeec614a109f9ad54d501f197fb0af56cde09d5c2ca7a7","abstract_canon_sha256":"c1d76e45900d9e1a2ec8f1e03baef755c8044df37b36f7c609dedd03b0c1552d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:41:55.781476Z","signature_b64":"Xt9qa8x73Xs99mjIZh+UkEdcZAOMIydUJ59QSHvmm2Sk1k2pepj3qpN8Xj9sNH/Ng/Gq+SWM+L7A73hbCc40Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7b8937047b79582d0f7e4d1d10adb05912e1e9cb5bc37b436d52032a3fedbe4","last_reissued_at":"2026-07-05T07:41:55.780984Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:41:55.780984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lossy Cryptography from Code-Based Assumptions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Aayush Jain, Quang Dao","submitted_at":"2024-02-06T02:17:08Z","abstract_excerpt":"Over the past few decades, we have seen a proliferation of advanced cryptographic primitives with lossy or homomorphic properties built from various assumptions such as Quadratic Residuosity, Decisional Diffie-Hellman, and Learning with Errors. These primitives imply hard problems in the complexity class $SZK$ (statistical zero-knowledge); as a consequence, they can only be based on assumptions that are broken in $BPP^{SZK}$. This poses a barrier for building advanced primitives from code-based assumptions, as the only known such assumption is Learning Parity with Noise (LPN) with an extremely"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.03633","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.03633/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2402.03633","created_at":"2026-07-05T07:41:55.781047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.03633v1","created_at":"2026-07-05T07:41:55.781047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.03633","created_at":"2026-07-05T07:41:55.781047+00:00"},{"alias_kind":"pith_short_12","alias_value":"264JG4CHW6KY","created_at":"2026-07-05T07:41:55.781047+00:00"},{"alias_kind":"pith_short_16","alias_value":"264JG4CHW6KYFUHX","created_at":"2026-07-05T07:41:55.781047+00:00"},{"alias_kind":"pith_short_8","alias_value":"264JG4CH","created_at":"2026-07-05T07:41:55.781047+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.07554","citing_title":"Injecting Knowledge Graphs into Large Language Models","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/264JG4CHW6KYFUHX4TI5CCW3AW","json":"https://pith.science/pith/264JG4CHW6KYFUHX4TI5CCW3AW.json","graph_json":"https://pith.science/api/pith-number/264JG4CHW6KYFUHX4TI5CCW3AW/graph.json","events_json":"https://pith.science/api/pith-number/264JG4CHW6KYFUHX4TI5CCW3AW/events.json","paper":"https://pith.science/paper/264JG4CH"},"agent_actions":{"view_html":"https://pith.science/pith/264JG4CHW6KYFUHX4TI5CCW3AW","download_json":"https://pith.science/pith/264JG4CHW6KYFUHX4TI5CCW3AW.json","view_paper":"https://pith.science/paper/264JG4CH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.03633&json=true","fetch_graph":"https://pith.science/api/pith-number/264JG4CHW6KYFUHX4TI5CCW3AW/graph.json","fetch_events":"https://pith.science/api/pith-number/264JG4CHW6KYFUHX4TI5CCW3AW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/264JG4CHW6KYFUHX4TI5CCW3AW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/264JG4CHW6KYFUHX4TI5CCW3AW/action/storage_attestation","attest_author":"https://pith.science/pith/264JG4CHW6KYFUHX4TI5CCW3AW/action/author_attestation","sign_citation":"https://pith.science/pith/264JG4CHW6KYFUHX4TI5CCW3AW/action/citation_signature","submit_replication":"https://pith.science/pith/264JG4CHW6KYFUHX4TI5CCW3AW/action/replication_record"}},"created_at":"2026-07-05T07:41:55.781047+00:00","updated_at":"2026-07-05T07:41:55.781047+00:00"}