One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption

DOI10.1007/11535218_29zbMATH Open1145.94443arXivcs/0608007OpenAlexW2135915451MaRDI QIDQ5451044FDOQ5451044

Authors: Thomas Holenstein, R. Renner 

Publication date: 17 March 2008

Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)

Abstract: Given a probability distribution P, what is the minimum amount of bits needed to store a value x sampled according to P, such that x can later be recovered (except with some small probability)? Or, what is the maximum amount of uniform randomness that can be extracted from x? Answering these and similar information-theoretic questions typically boils down to computing so-called smooth entropies. In this paper, we derive explicit and almost tight bounds on the smooth entropies of n-fold product distributions.

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

Recommendations

• Efficient one-way secret-key agreement and private channel coding via polarization
• Secret-key agreement over unauthenticated public channels-part I: definitions and a completeness result
• Information-theoretic key agreement: from weak to strong secret for free
• Secret key agreement by public discussion from common information
• Unconditionally secure key agreement and the intrinsic conditional information

Mathematics Subject Classification ID

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

Cited In (18)

• Degradation and Amplification of Computational Hardness
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• Combinatorially homomorphic encryption
• Sharp lower bounds on the extractable randomness from non-uniform sources
• Simultaneous secrecy and reliability amplification for a general channel model
• Public-key encryption from homogeneous CLWE
• The computational complexity of estimating MCMC convergence time
• A note on perfect correctness by derandomization
• Subversion-resilient public key encryption with practical watchdogs
• Reusable fuzzy extractors for low-entropy distributions
• When Are Fuzzy Extractors Possible?
• A note on perfect correctness by derandomization
• Statistical difference beyond the polarizing regime
• Cryptographic pseudorandom generators can make cryptosystems problematic
• Amplifying the security of functional encryption, unconditionally
• Lossy cryptography from code-based assumptions
• Non-committing encryption with constant ciphertext expansion from standard assumptions
• Efficient one-way secret-key agreement and private channel coding via polarization

This page was built for publication: One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption

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