{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QKRW3JM6U6FSBQGRIDVWFL4ZI2","short_pith_number":"pith:QKRW3JM6","schema_version":"1.0","canonical_sha256":"82a36da59ea78b20c0d140eb62af9946a89bdfffd084d6ce16ed128e6d0e2218","source":{"kind":"arxiv","id":"1311.1363","version":2},"attestation_state":"computed","paper":{"title":"On Known-Plaintext Attacks to a Compressed Sensing-based Encryption: A Quantitative Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fabio Pareschi, Gianluca Setti, Mauro Mangia, Riccardo Rovatti, Valerio Cambareri","submitted_at":"2013-11-06T12:04:25Z","abstract_excerpt":"Despite the linearity of its encoding, compressed sensing may be used to provide a limited form of data protection when random encoding matrices are used to produce sets of low-dimensional measurements (ciphertexts). In this paper we quantify by theoretical means the resistance of the least complex form of this kind of encoding against known-plaintext attacks. For both standard compressed sensing with antipodal random matrices and recent multiclass encryption schemes based on it, we show how the number of candidate encoding matrices that match a typical plaintext-ciphertext pair is so large th"},"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":"1311.1363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-06T12:04:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"84f41a0ba3a9055ee1e784255a44a36a717572865b5632b5fba0a7853ba11600","abstract_canon_sha256":"555e76a3d06e403476858d734b96dbbe553fefbae9b3b672825d83f1d8641cc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.640166Z","signature_b64":"hDCladnRfWib5DPBJLcXJLzmfA/T/ZsUgNp1CDGJIJ2MZ19GvoY+4pq9D9bg8QALfgtbVQuybVlXsP2rt4AhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82a36da59ea78b20c0d140eb62af9946a89bdfffd084d6ce16ed128e6d0e2218","last_reissued_at":"2026-05-18T00:59:03.639586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.639586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Known-Plaintext Attacks to a Compressed Sensing-based Encryption: A Quantitative Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fabio Pareschi, Gianluca Setti, Mauro Mangia, Riccardo Rovatti, Valerio Cambareri","submitted_at":"2013-11-06T12:04:25Z","abstract_excerpt":"Despite the linearity of its encoding, compressed sensing may be used to provide a limited form of data protection when random encoding matrices are used to produce sets of low-dimensional measurements (ciphertexts). In this paper we quantify by theoretical means the resistance of the least complex form of this kind of encoding against known-plaintext attacks. For both standard compressed sensing with antipodal random matrices and recent multiclass encryption schemes based on it, we show how the number of candidate encoding matrices that match a typical plaintext-ciphertext pair is so large th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1363","kind":"arxiv","version":2},"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":"1311.1363","created_at":"2026-05-18T00:59:03.639687+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1363v2","created_at":"2026-05-18T00:59:03.639687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1363","created_at":"2026-05-18T00:59:03.639687+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKRW3JM6U6FS","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKRW3JM6U6FSBQGR","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKRW3JM6","created_at":"2026-05-18T12:27:57.521954+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/QKRW3JM6U6FSBQGRIDVWFL4ZI2","json":"https://pith.science/pith/QKRW3JM6U6FSBQGRIDVWFL4ZI2.json","graph_json":"https://pith.science/api/pith-number/QKRW3JM6U6FSBQGRIDVWFL4ZI2/graph.json","events_json":"https://pith.science/api/pith-number/QKRW3JM6U6FSBQGRIDVWFL4ZI2/events.json","paper":"https://pith.science/paper/QKRW3JM6"},"agent_actions":{"view_html":"https://pith.science/pith/QKRW3JM6U6FSBQGRIDVWFL4ZI2","download_json":"https://pith.science/pith/QKRW3JM6U6FSBQGRIDVWFL4ZI2.json","view_paper":"https://pith.science/paper/QKRW3JM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1363&json=true","fetch_graph":"https://pith.science/api/pith-number/QKRW3JM6U6FSBQGRIDVWFL4ZI2/graph.json","fetch_events":"https://pith.science/api/pith-number/QKRW3JM6U6FSBQGRIDVWFL4ZI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKRW3JM6U6FSBQGRIDVWFL4ZI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKRW3JM6U6FSBQGRIDVWFL4ZI2/action/storage_attestation","attest_author":"https://pith.science/pith/QKRW3JM6U6FSBQGRIDVWFL4ZI2/action/author_attestation","sign_citation":"https://pith.science/pith/QKRW3JM6U6FSBQGRIDVWFL4ZI2/action/citation_signature","submit_replication":"https://pith.science/pith/QKRW3JM6U6FSBQGRIDVWFL4ZI2/action/replication_record"}},"created_at":"2026-05-18T00:59:03.639687+00:00","updated_at":"2026-05-18T00:59:03.639687+00:00"}