{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:I6QGION7K6OY4JGEOIZR4LUMYL","short_pith_number":"pith:I6QGION7","schema_version":"1.0","canonical_sha256":"47a06439bf579d8e24c472331e2e8cc2cc5f9b5f4c504bbbbee3cd4170ea4d54","source":{"kind":"arxiv","id":"1210.6673","version":3},"attestation_state":"computed","paper":{"title":"Semantically Secure Lattice Codes for the Gaussian Wiretap Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Damien Stehl\\'e, Jean-Claude Belfiore, Laura Luzzi","submitted_at":"2012-10-24T20:27:35Z","abstract_excerpt":"We propose a new scheme of wiretap lattice coding that achieves semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our security proof is the flatness factor which characterizes the convergence of the conditional output distributions corresponding to different messages and leads to an upper bound on the information leakage. We not only introduce the notion of secrecy-good lattices, but also propose the {flatness factor} as a design criterion of such lattices. Both the modulo-lattice Gaussian channel and the genuine Gaussian channel are considered. In the lat"},"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":"1210.6673","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-24T20:27:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d0bc293f1b440b958f1913df2f9c1871481cd3a390516db40b2bbbfe37205b5e","abstract_canon_sha256":"e1055ffba1f17c4a6922775b505667411570779925fea7543702f5f86a3ba79d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.720862Z","signature_b64":"c1YaGKW2SAT4MS/zrFjoNHkjPbffCQUyf3KrCiWH5SNlzKGfi/seD0fm3tN2aXlajf46K60SMtV9+rsIJh3mDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47a06439bf579d8e24c472331e2e8cc2cc5f9b5f4c504bbbbee3cd4170ea4d54","last_reissued_at":"2026-05-18T00:57:56.720443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.720443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semantically Secure Lattice Codes for the Gaussian Wiretap Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Damien Stehl\\'e, Jean-Claude Belfiore, Laura Luzzi","submitted_at":"2012-10-24T20:27:35Z","abstract_excerpt":"We propose a new scheme of wiretap lattice coding that achieves semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our security proof is the flatness factor which characterizes the convergence of the conditional output distributions corresponding to different messages and leads to an upper bound on the information leakage. We not only introduce the notion of secrecy-good lattices, but also propose the {flatness factor} as a design criterion of such lattices. Both the modulo-lattice Gaussian channel and the genuine Gaussian channel are considered. In the lat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6673","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":""},"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":"1210.6673","created_at":"2026-05-18T00:57:56.720504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6673v3","created_at":"2026-05-18T00:57:56.720504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6673","created_at":"2026-05-18T00:57:56.720504+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6QGION7K6OY","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6QGION7K6OY4JGE","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6QGION7","created_at":"2026-05-18T12:27:09.501522+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/I6QGION7K6OY4JGEOIZR4LUMYL","json":"https://pith.science/pith/I6QGION7K6OY4JGEOIZR4LUMYL.json","graph_json":"https://pith.science/api/pith-number/I6QGION7K6OY4JGEOIZR4LUMYL/graph.json","events_json":"https://pith.science/api/pith-number/I6QGION7K6OY4JGEOIZR4LUMYL/events.json","paper":"https://pith.science/paper/I6QGION7"},"agent_actions":{"view_html":"https://pith.science/pith/I6QGION7K6OY4JGEOIZR4LUMYL","download_json":"https://pith.science/pith/I6QGION7K6OY4JGEOIZR4LUMYL.json","view_paper":"https://pith.science/paper/I6QGION7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6673&json=true","fetch_graph":"https://pith.science/api/pith-number/I6QGION7K6OY4JGEOIZR4LUMYL/graph.json","fetch_events":"https://pith.science/api/pith-number/I6QGION7K6OY4JGEOIZR4LUMYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6QGION7K6OY4JGEOIZR4LUMYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6QGION7K6OY4JGEOIZR4LUMYL/action/storage_attestation","attest_author":"https://pith.science/pith/I6QGION7K6OY4JGEOIZR4LUMYL/action/author_attestation","sign_citation":"https://pith.science/pith/I6QGION7K6OY4JGEOIZR4LUMYL/action/citation_signature","submit_replication":"https://pith.science/pith/I6QGION7K6OY4JGEOIZR4LUMYL/action/replication_record"}},"created_at":"2026-05-18T00:57:56.720504+00:00","updated_at":"2026-05-18T00:57:56.720504+00:00"}