Privacy amplification with asymptotically optimal entropy loss

DOI10.1145/2630064MaRDI QIDQ5501933zbMATH OpenOpenAlexFDO

Authors Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky, Leonid Reyzin

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

zbMATH Keywords

authentication protocolskey agreementcryptographic protocolserror-correcting codesinformation-theoretic key agreement

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Privacy amplification with asymptotically optimal entropy loss
• Key Agreement from Close Secrets over Unsecured Channels
• Secret-key agreement over unauthenticated public channels-part III: privacy amplification
• Amplifying Privacy in Privacy Amplification
• scientific article; zbMATH DE number 1088243

Cites work

• scientific article; zbMATH DE number 1302810 (Why is no real title available?)
• scientific article; zbMATH DE number 1088243 (Why is no real title available?)
• scientific article; zbMATH DE number 1874366 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• Asymptotically good codes correcting insertions, deletions, and transpositions
• Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
• Design extractors, non-malleable condensers and privacy amplification
• Extracting correlations
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Generalized privacy amplification
• Key Agreement from Close Secrets over Unsecured Channels
• Non-malleable extractors and symmetric key cryptography from weak secrets
• Nonmalleable extractors with short seeds and applications to privacy amplification
• Privacy Amplification by Public Discussion
• Privacy amplification with asymptotically optimal entropy loss
• Randomness is linear in space
• Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets
• Secret-key agreement over unauthenticated public channels-part III: privacy amplification
• Secure Authentication from a Weak Key, without Leaking Information
• Secure Remote Authentication Using Biometric Data
• Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
• Universal classes of hash functions

Cited in

(9)

• A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
• Noisy Channel Coding via Privacy Amplification and Information Reconciliation
• Nonmalleable extractors and codes, with their many tampered extensions
• Computational fuzzy extractors
• Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
• Privacy amplification with asymptotically optimal entropy loss
• scientific article; zbMATH DE number 7247651 (Why is no real title available?)
• Key Agreement from Close Secrets over Unsecured Channels
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification

This page was built for publication: Privacy amplification with asymptotically optimal entropy loss

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