Privacy amplification from non-malleable codes

DOI10.1007/978-3-030-35423-7_16MaRDI QIDQ2179398zbMATH OpenOpenAlexFDO

Authors Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar

Publication date 12 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-35423-7_16

zbMATH Keywords

fully tamperable public channeluniformly distributed secret key

Mathematics Subject Classification ID

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

Recommendations

• Non-malleable condensers for arbitrary min-entropy, and almost optimal protocols for privacy amplification
• Nonmalleable extractors with short seeds and applications to privacy amplification
• Design extractors, non-malleable condensers and privacy amplification

Cites work

• A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
• Advances in Cryptology - CRYPTO 2003
• Capacity of non-malleable codes
• Design extractors, non-malleable condensers and privacy amplification
• Four-state non-malleable codes with explicit constant rate
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Generalized privacy amplification
• scientific article; zbMATH DE number 708824 (Why is no real title available?)
• scientific article; zbMATH DE number 1088243 (Why is no real title available?)
• Improved non-malleable extractors, non-malleable codes and independent source extractors
• Key Agreement from Close Secrets over Unsecured Channels
• Non-malleable codes
• Non-malleable codes from additive combinatorics (extended abstract)
• Non-malleable condensers for arbitrary min-entropy, and almost optimal protocols for privacy amplification
• Non-malleable extractors and codes, with their many tampered extensions
• Non-malleable extractors and non-malleable codes: partially optimal constructions
• Non-malleable extractors and symmetric key cryptography from weak secrets
• Non-malleable randomness encoders and their applications
• Non-malleable reductions and applications
• Non-malleable secret sharing
• Nonmalleable extractors with short seeds and applications to privacy amplification
• Optimal computational split-state non-malleable codes
• Privacy Amplification by Public Discussion
• Privacy amplification from non-malleable codes
• Privacy amplification with asymptotically optimal entropy loss
• Randomness is linear in space
• Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
• Textbook non-malleable commitments

Cited in

(7)

• Privacy amplification from non-malleable codes
• A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
• Nonmalleable extractors and codes, with their many tampered extensions
• Non-malleable condensers for arbitrary min-entropy, and almost optimal protocols for privacy amplification
• Noisy Channel Coding via Privacy Amplification and Information Reconciliation
• Extractors: low entropy requirements colliding with non-malleability
• Efficient randomized strong 2-source non-malleable extractor for any linear min-entropy

This page was built for publication: Privacy amplification from non-malleable codes

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