Privacy amplification with asymptotically optimal entropy loss
From MaRDI portal
Publication:5501933
DOI10.1145/2630064zbMath1321.94103OpenAlexW2024766111MaRDI QIDQ5501933
Rafail Ostrovsky, Nishanth Chandran, Leonid Reyzin, Bhavana Kanukurthi
Publication date: 14 August 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2630064
cryptographic protocolserror-correcting codesauthentication protocolskey agreementinformation-theoretic key agreement
Related Items
Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Computational fuzzy extractors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Universal classes of hash functions
- Randomness is linear in space
- Privacy amplification with asymptotically optimal entropy loss
- Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets
- Secure Authentication from a Weak Key, without Leaking Information
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Key Agreement from Close Secrets over Unsecured Channels
- Privacy Amplification by Public Discussion
- A Pseudorandom Generator from any One-way Function
- Asymptotically good codes correcting insertions, deletions, and transpositions
- Secret-key agreement over unauthenticated public channels-part III: privacy amplification
- Generalized privacy amplification
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Extracting Correlations
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Advances in Cryptology - EUROCRYPT 2004
- Secure Remote Authentication Using Biometric Data
- Design extractors, non-malleable condensers and privacy amplification
- Advances in Cryptology - CRYPTO 2003
- Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification
- Privacy Amplification and Nonmalleable Extractors Via Character Sums
