Information-theoretic key agreement: from weak to strong secret for free
From MaRDI portal
Publication:3374920
zbMATH Open1082.94544MaRDI QIDQ3374920FDOQ3374920
Authors: Ueli M. Maurer, S. Wolf 
Publication date: 1 March 2006
Recommendations
- Secret key agreement by public discussion from common information
- scientific article; zbMATH DE number 2009980
- scientific article; zbMATH DE number 1302810
- Unconditionally secure key agreement and the intrinsic conditional information
- Non-malleable extractors and symmetric key cryptography from weak secrets
Cited In (28)
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Message transmission and key establishment: conditions for equality of weak and strong capacities
- On the Optimality of Secret Key Agreement via Omniscience
- Mosaics of combinatorial designs for information-theoretic security
- An interactive, similarity increasing algorithm for random strings with applications to key agreement in ad hoc networks
- Error correcting codes, block designs, perfect secrecy and finite fields
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- Information-theoretic secret-key agreement: the asymptotically tight relation between the secret-key rate and the channel quality ratio
- Secret key agreement by public discussion from common information
- Multiterminal secrecy by public discussion
- Title not available (Why is that?)
- Wireless-channel key exchange
- Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation
- A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
- Common Information, Noise Stability, and Their Extensions
- Key Agreement from Close Secrets over Unsecured Channels
- Secrecy results for compound wiretap channels
- Distillation of secret-key from a class of compound memoryless quantum sources
- Distributions attaining secret key at a rate of the conditional mutual information
- Basics of secrecy coding
- Secure and private, yet lightweight, authentication for the IoT via PUF and CBKA
- Non-malleable extractors and symmetric key cryptography from weak secrets
- An eavesdropping game with SINR as an objective function
- Efficient one-way secret-key agreement and private channel coding via polarization
- Comments On “Information-Theoretic Key Agreement of Multiple Terminals—Part I”
- (Secure) linear network coding multicast
- Title not available (Why is that?)
This page was built for publication: Information-theoretic key agreement: from weak to strong secret for free
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374920)
