Polar Coding for Secret-Key Generation

DOI10.1109/TIT.2015.2471179MaRDI QIDQ2977131zbMATH OpenOpenAlexFDO

Authors Rémi A. Chou, Matthieu Bloch, Emmanuel Abbe

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1305.4746

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Abstract: Practical implementations of secret-key generation are often based on sequential strategies, which handle reliability and secrecy in two successive steps, called reconciliation and privacy amplification. In this paper, we propose an alternative approach based on polar codes that jointly deals with reliability and secrecy. Specifically, we propose secret-key capacity-achieving polar coding schemes for the following models: (i) the degraded binary memoryless source (DBMS) model with rate-unlimited public communication, (ii) the DBMS model with one-way rate-limited public communication, (iii) the 1-to-m broadcast model and (iv) the Markov tree model with uniform marginals. For models (i) and (ii) our coding schemes remain valid for non-degraded sources, although they may not achieve the secret-key capacity. For models (i), (ii) and (iii), our schemes rely on pre-shared secret seed of negligible rate; however, we provide special cases of these models for which no seed is required. Finally, we show an application of our results to secrecy and privacy for biometric systems. We thus provide the first examples of low-complexity secret-key capacity-achieving schemes that are able to handle vector quantization for model (ii), or multiterminal communication for models (iii) and (iv).

Recommendations

• Polar coding for ring-LWE-based public key encryption
• Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
• Efficient one-way secret-key agreement and private channel coding via polarization
• Polar Codes for Private and Quantum Communication Over Arbitrary Channels
• Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy
• Polar codes
• Polarization and polar codes
• On Polar Coding for Side Information Channels
• How to Construct Polar Codes
• Polar Codes for Broadcast Channels

Cited in

(5)

• Efficient quantum key distribution protocol based on classical-quantum polarized channels
• Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy
• Randomness and Dependencies Extraction via Polarization, With Applications to Slepian–Wolf Coding and Secrecy
• scientific article; zbMATH DE number 6961201 (Why is no real title available?)
• Hybrid encryption in correlated randomness model and KEM combiners

This page was built for publication: Polar Coding for Secret-Key Generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977131)