Extractors: low entropy requirements colliding with non-malleability

DOI10.1007/978-3-031-38545-2_19arXiv2111.04157OpenAlexW3212973854MaRDI QIDQ6145926

Maciej Obremski, Divesh Aggarwal, Eldon Chung

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.04157

zbMATH Keywords

privacy amplificationcollision-resistant randomness extractorstwo-source non-malleable extractors

Mathematics Subject Classification ID

Cryptography (94A60) Measures of information, entropy (94A17) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-malleable coding against bit-wise and split-state tampering
• Hardness vs randomness
• Multi-source non-malleable extractors and applications
• Privacy amplification from non-malleable codes
• Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
• Explicit two-source extractors and resilient functions
• Non-malleable Codes from Two-Source Extractors
• Non-malleable Reductions and Applications
• Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
• Extractors with weak random seeds
• Leakage-Resilient Storage
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• Simple Constructions of Almost k-wise Independent Random Variables
• Non-Malleable Codes
• Non-Malleable Codes from Additive Combinatorics
• Improved non-malleable extractors, non-malleable codes and independent source extractors
• Towards optimal two-source extractors and Ramsey graphs
• An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
• Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors
• Non-malleable extractors and symmetric key cryptography from weak secrets
• AN EXPLICIT TWO‐SOURCE EXTRACTOR WITH MIN‐ENTROPY RATE NEAR
• Non-malleable secret sharing
• MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
• Non-malleable extractors and codes, with their many tampered extensions
• Textbook non-malleable commitments
• Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification
• Privacy Amplification and Nonmalleable Extractors Via Character Sums
• Extracting all the randomness and reducing the error in Trevisan's extractors
• Rate one-third non-malleable codes