Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
arXiv:1210.6673 · doi:10.1109/TIT.2014.2343226
Abstract
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 latter case, we propose a novel secrecy coding scheme based on the discrete Gaussian distribution over a lattice, which achieves the secrecy capacity to within a half nat under mild conditions. No \textit{a priori} distribution of the message is assumed, and no dither is used in our proposed schemes.
Submitted to IEEE Trans. Information Theory, Sept. 2012; revised, Oct. 2013
References in corpus (1)
Cited by in corpus (30)
- Relay Selection for Wireless Communications Against Eavesdropping: A Security-Reliability Tradeoff Perspective
- Artificial Noise Revisited
- Secure Compute-and-Forward in a Bidirectional Relay
- Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information
- Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs
- A Survey of Physical Layer Security Techniques for 5G Wireless Networks and Challenges Ahead
- Construction of Capacity-Achieving Lattice Codes: Polar Lattices
- Multilevel LDPC Lattices with Efficient Encoding and Decoding and a Generalization of Construction D'
- Polar Lattices: Where Arıkan Meets Forney
- Almost universal codes for fading wiretap channels
- Some "Goodness" Properties of LDA Lattices
- Polar Lattices for Lossy Compression
- Sphere Decoding Revisited
- The MAC Resolvability Region, Semantic Security and Its Operational Implications
- Adaptive Compute-and-Forward with Lattice Codes Over Algebraic Integers
- Achieving Secrecy Capacity of the Gaussian Wiretap Channel with Polar Lattices
- Extracting Wyner's Common Information Using Polar Codes and Polar Lattices
- Unshared Secret Key Cryptography
- Weak Secrecy in the Multi-Way Untrusted Relay Channel with Compute-and-Forward
- Semantic Security on Wiretap Channels using Universal Hashing with Fading Applications
- Lattice-Based Minimum-Distortion Data Hiding
- Euclidean lattices: theory and applications
- Markov chain Monte Carlo Methods For Lattice Gaussian Sampling: Lattice Reduction and Decoding Optimization
- Leakage Rate Analysis for Artificial Noise Assisted Massive MIMO with Non-coherent Passive Eavesdropper in Block-fading
- Physical Layer Security for RF Satellite Channels in the Finite-length Regime
- Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling
- 2- and 3-modular Lattice Wiretap Codes in Small Dimensions
- Improving the Performance of Nested Lattice Codes Using Concatenation
- Oblivious Transfer over Wireless Channels
- Practical Secrecy: Bridging the Gap between Cryptography and Physical Layer Security