Privacy amplification from non-malleable codes

DOI10.1007/978-3-030-35423-7_16zbMath1456.94062OpenAlexW2949723301MaRDI QIDQ2179398

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

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)

Related Items (3)

Privacy amplification from non-malleable codes ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-malleable randomness encoders and their applications
• Randomness is linear in space
• Privacy amplification from non-malleable codes
• Optimal Computational Split-state Non-malleable Codes
• Privacy amplification with asymptotically optimal entropy loss
• Non-malleable Reductions and Applications
• Capacity of non-malleable 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
• Non-Malleable Codes
• Generalized privacy amplification
• Improved non-malleable extractors, non-malleable codes and independent source extractors
• Non-malleable extractors and symmetric key cryptography from weak secrets
• Non-malleable secret sharing
• Non-malleable codes from additive combinatorics
• A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
• Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification
• Non-malleable extractors and codes, with their many tampered extensions
• Textbook non-malleable commitments
• 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
• Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
• Four-state non-malleable codes with explicit constant rate

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