Privacy amplification with asymptotically optimal entropy loss

DOI10.1145/1806689.1806796MaRDI QIDQ2875205zbMATH OpenOpenAlexFDO

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

Publication date 13 August 2014

Published in Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1806689.1806796

zbMATH Keywords

privacy amplificationentropy lossinformation-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

Cited in

(11)

• Secret-key agreement over unauthenticated public channels-part III: privacy amplification
• Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
• Privacy amplification with asymptotically optimal entropy loss
• The effect of side-information on smooth entropy.
• scientific article; zbMATH DE number 7247651 (Why is no real title available?)
• Non-malleable extractors and non-malleable codes: partially optimal constructions
• A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
• Computational fuzzy extractors
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• Privacy amplification from non-malleable codes
• Key Agreement from Close Secrets over Unsecured Channels

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 Q2875205)