{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CFWZUFEEP5ZS6IITO6JCKMYDTS","short_pith_number":"pith:CFWZUFEE","schema_version":"1.0","canonical_sha256":"116d9a14847f732f211377922533039ca0b370288ef7fc453d6bdfe7e977adfd","source":{"kind":"arxiv","id":"1307.3360","version":4},"attestation_state":"computed","paper":{"title":"Low-complexity Multiclass Encryption by Compressed Sensing","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-07-12T08:20:24Z","abstract_excerpt":"The idea that compressed sensing may be used to encrypt information from unauthorised receivers has already been envisioned, but never explored in depth since its security may seem compromised by the linearity of its encoding process. In this paper we apply this simple encoding to define a general private-key encryption scheme in which a transmitter distributes the same encoded measurements to receivers of different classes, which are provided partially corrupted encoding matrices and are thus allowed to decode the acquired signal at provably different levels of recovery quality.\n  The securit"},"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.3360","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-12T08:20:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f6d41cdaf0401d66599d270533c41de1a837867e082f4bfda3b45a51cf71cf7","abstract_canon_sha256":"934f00d0a1cda3fadb7a152db2df263b3a752ecd00138b86a6d03192162be461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:02.900586Z","signature_b64":"inABf4qlv19OOIZ+4XvNjq7JqMqYvbzmf9zJ+JPYfLOEO16RoLOWTLw1t4UyLqkWvzqvDnoqPSasaVYcN2cXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"116d9a14847f732f211377922533039ca0b370288ef7fc453d6bdfe7e977adfd","last_reissued_at":"2026-05-18T02:26:02.900085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:02.900085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-complexity Multiclass Encryption by Compressed Sensing","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-07-12T08:20:24Z","abstract_excerpt":"The idea that compressed sensing may be used to encrypt information from unauthorised receivers has already been envisioned, but never explored in depth since its security may seem compromised by the linearity of its encoding process. In this paper we apply this simple encoding to define a general private-key encryption scheme in which a transmitter distributes the same encoded measurements to receivers of different classes, which are provided partially corrupted encoding matrices and are thus allowed to decode the acquired signal at provably different levels of recovery quality.\n  The securit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3360","kind":"arxiv","version":4},"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.3360","created_at":"2026-05-18T02:26:02.900148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3360v4","created_at":"2026-05-18T02:26:02.900148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3360","created_at":"2026-05-18T02:26:02.900148+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFWZUFEEP5ZS","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFWZUFEEP5ZS6IIT","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFWZUFEE","created_at":"2026-05-18T12:27:40.988391+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/CFWZUFEEP5ZS6IITO6JCKMYDTS","json":"https://pith.science/pith/CFWZUFEEP5ZS6IITO6JCKMYDTS.json","graph_json":"https://pith.science/api/pith-number/CFWZUFEEP5ZS6IITO6JCKMYDTS/graph.json","events_json":"https://pith.science/api/pith-number/CFWZUFEEP5ZS6IITO6JCKMYDTS/events.json","paper":"https://pith.science/paper/CFWZUFEE"},"agent_actions":{"view_html":"https://pith.science/pith/CFWZUFEEP5ZS6IITO6JCKMYDTS","download_json":"https://pith.science/pith/CFWZUFEEP5ZS6IITO6JCKMYDTS.json","view_paper":"https://pith.science/paper/CFWZUFEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3360&json=true","fetch_graph":"https://pith.science/api/pith-number/CFWZUFEEP5ZS6IITO6JCKMYDTS/graph.json","fetch_events":"https://pith.science/api/pith-number/CFWZUFEEP5ZS6IITO6JCKMYDTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFWZUFEEP5ZS6IITO6JCKMYDTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFWZUFEEP5ZS6IITO6JCKMYDTS/action/storage_attestation","attest_author":"https://pith.science/pith/CFWZUFEEP5ZS6IITO6JCKMYDTS/action/author_attestation","sign_citation":"https://pith.science/pith/CFWZUFEEP5ZS6IITO6JCKMYDTS/action/citation_signature","submit_replication":"https://pith.science/pith/CFWZUFEEP5ZS6IITO6JCKMYDTS/action/replication_record"}},"created_at":"2026-05-18T02:26:02.900148+00:00","updated_at":"2026-05-18T02:26:02.900148+00:00"}