{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PZESTH6KX2NIXMQZ2ACHJBLDAH","short_pith_number":"pith:PZESTH6K","schema_version":"1.0","canonical_sha256":"7e49299fcabe9a8bb219d00474856301caeb8ff59ede04b227778d29f4384641","source":{"kind":"arxiv","id":"2512.17310","version":3},"attestation_state":"computed","paper":{"title":"Cryptanalysis of LDPC-Based Pseudorandom Error-Correcting Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Anyu Wang, Delong Ran, Jinyuan Liu, Tianrui Wang, Tianshuo Cong, Xiaoyun Wang","submitted_at":"2025-12-19T07:48:04Z","abstract_excerpt":"Pseudorandom error-correcting codes (PRCs), a novel cryptographic primitive recently proposed at CRYPTO 2024, are primarily applied in undetectable watermarking schemes for large generative models. However, the security of PRCs has not yet been systematically analyzed. To fill this gap, we present the first cryptanalysis of PRCs. Specifically, focusing on LDPC-PRC, the only known practical instantiation of PRCs, we propose three novel attacks that challenge its undetectability and robustness. To rigorously demonstrate the practical threat, we analyze the concrete attack complexity under realis"},"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":"2512.17310","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-12-19T07:48:04Z","cross_cats_sorted":[],"title_canon_sha256":"e16a1a1f9146d6e7c56f17d0b002ac3bd657a70fddbd281ed43aecd4b57b862d","abstract_canon_sha256":"4c1bbc3d21227d88da203b0ddef09fd26a40a2433b70961071f6b8092e4f9e8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:18.681630Z","signature_b64":"SB9pKZwtczbp4MzDjXsPDxPkZ7dSyfks7adMWwuyHuz/c0yl+sRLor6FUWqf23XuURmQe2lM5Tofqqb50E5RCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e49299fcabe9a8bb219d00474856301caeb8ff59ede04b227778d29f4384641","last_reissued_at":"2026-06-19T16:11:18.681205Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:18.681205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cryptanalysis of LDPC-Based Pseudorandom Error-Correcting Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Anyu Wang, Delong Ran, Jinyuan Liu, Tianrui Wang, Tianshuo Cong, Xiaoyun Wang","submitted_at":"2025-12-19T07:48:04Z","abstract_excerpt":"Pseudorandom error-correcting codes (PRCs), a novel cryptographic primitive recently proposed at CRYPTO 2024, are primarily applied in undetectable watermarking schemes for large generative models. However, the security of PRCs has not yet been systematically analyzed. To fill this gap, we present the first cryptanalysis of PRCs. Specifically, focusing on LDPC-PRC, the only known practical instantiation of PRCs, we propose three novel attacks that challenge its undetectability and robustness. To rigorously demonstrate the practical threat, we analyze the concrete attack complexity under realis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.17310","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.17310/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":"2512.17310","created_at":"2026-06-19T16:11:18.681260+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.17310v3","created_at":"2026-06-19T16:11:18.681260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.17310","created_at":"2026-06-19T16:11:18.681260+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZESTH6KX2NI","created_at":"2026-06-19T16:11:18.681260+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZESTH6KX2NIXMQZ","created_at":"2026-06-19T16:11:18.681260+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZESTH6K","created_at":"2026-06-19T16:11:18.681260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.29807","citing_title":"Rethinking Forgery Attacks on Semantic Watermarks in Black-Box Settings: A Geometric Distortion Perspective","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PZESTH6KX2NIXMQZ2ACHJBLDAH","json":"https://pith.science/pith/PZESTH6KX2NIXMQZ2ACHJBLDAH.json","graph_json":"https://pith.science/api/pith-number/PZESTH6KX2NIXMQZ2ACHJBLDAH/graph.json","events_json":"https://pith.science/api/pith-number/PZESTH6KX2NIXMQZ2ACHJBLDAH/events.json","paper":"https://pith.science/paper/PZESTH6K"},"agent_actions":{"view_html":"https://pith.science/pith/PZESTH6KX2NIXMQZ2ACHJBLDAH","download_json":"https://pith.science/pith/PZESTH6KX2NIXMQZ2ACHJBLDAH.json","view_paper":"https://pith.science/paper/PZESTH6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.17310&json=true","fetch_graph":"https://pith.science/api/pith-number/PZESTH6KX2NIXMQZ2ACHJBLDAH/graph.json","fetch_events":"https://pith.science/api/pith-number/PZESTH6KX2NIXMQZ2ACHJBLDAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZESTH6KX2NIXMQZ2ACHJBLDAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZESTH6KX2NIXMQZ2ACHJBLDAH/action/storage_attestation","attest_author":"https://pith.science/pith/PZESTH6KX2NIXMQZ2ACHJBLDAH/action/author_attestation","sign_citation":"https://pith.science/pith/PZESTH6KX2NIXMQZ2ACHJBLDAH/action/citation_signature","submit_replication":"https://pith.science/pith/PZESTH6KX2NIXMQZ2ACHJBLDAH/action/replication_record"}},"created_at":"2026-06-19T16:11:18.681260+00:00","updated_at":"2026-06-19T16:11:18.681260+00:00"}