Reusable fuzzy extractors for low-entropy distributions
From MaRDI portal
Publication:2032056
DOI10.1007/s00145-020-09367-8zbMath1466.94021OpenAlexW3107080613MaRDI QIDQ2032056
Publication date: 16 June 2021
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1721.1/128698
Cryptography (94A60) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05) Authentication, digital signatures and secret sharing (94A62)
Related Items (2)
Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new distribution-sensitive secure sketch and popularity-proportional hashing
- On virtual grey box obfuscation for general circuits
- Reusable fuzzy extractor from LWE
- Reusable fuzzy extractor from the decisional Diffie-Hellman assumption
- Randomness is linear in space
- Computational fuzzy extractors
- Reusable Fuzzy Extractors for Low-Entropy Distributions
- Computational Fuzzy Extractors
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- On Virtual Grey Box Obfuscation for General Circuits
- When Are Fuzzy Extractors Possible?
- Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets
- A Sample of Samplers: A Computational Perspective on Sampling
- On Symmetric Encryption and Point Obfuscation
- On Strong Simulation and Composable Point Obfuscation
- Cryptographic Extraction and Key Derivation: The HKDF Scheme
- Feedback Codes Achieving the Capacity of the Z-Channel
- Towards a Theory of Extractable Functions
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Key Agreement from Close Secrets over Unsecured Channels
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Privacy Amplification by Public Discussion
- A Pseudorandom Generator from any One-way Function
- Secret key agreement by public discussion from common information
- Password hardening based on keystroke dynamics
- Efficient, Reusable Fuzzy Extractors from LWE
- When Are Fuzzy Extractors Possible?
- On cryptography with auxiliary input
- Advances in Cryptology - EUROCRYPT 2004
- Secure Remote Authentication Using Biometric Data
- Key Derivation without Entropy Waste
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Advances in Cryptology - CRYPTO 2003
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Obfuscating Point Functions with Multibit Output
- Class of constructive asymptotically good algebraic codes
This page was built for publication: Reusable fuzzy extractors for low-entropy distributions