Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
From MaRDI portal
Publication:3614152
DOI10.1137/060651380zbMath1165.94326arXivcs/0602007OpenAlexW2146813141MaRDI QIDQ3614152
No author found.
Publication date: 16 March 2009
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0602007
error-correcting codesnonuniformityrandomness extractorsmetric embeddingsbiometric authenticationerror-tolerancefuzzy extractorsfuzzy fingerprintspassword-based systems
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Measures of information, entropy (94A17) Theory of error-correcting codes and error-detecting codes (94B99) Decoding (94B35) Authentication, digital signatures and secret sharing (94A62) Theory of computing (68Q99)
Related Items (only showing first 100 items - show all)
Attribute-Based Keyword Search from Lattices ⋮ Memory leakage-resilient secret sharing schemes ⋮ Recovering Attacks Against Linear Sketch in Fuzzy Signature Schemes of ACNS 2015 and 2016 ⋮ A Practical Leakage-Resilient Signature Scheme in the Generic Group Model ⋮ Privacy with Imperfect Randomness ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Reproducible Circularly-Secure Bit Encryption: Applications and Realizations ⋮ Leakage-Resilient Revocable Certificateless Encryption with an Outsourced Revocation Authority ⋮ Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation ⋮ Fine-grained verifier NIZK and its applications ⋮ Short leakage resilient and non-malleable secret sharing schemes ⋮ Fully Continuous Leakage-Resilient Certificate-Based Signcryption Scheme for Mobile Communications ⋮ Nearly optimal property preserving hashing ⋮ Fuzzy authenticated key exchange with tight security ⋮ Leakage-resilient \textsf{IBE}/\textsf{ABE} with optimal leakage rates from lattices ⋮ IBE with incompressible master secret and small identity secrets ⋮ Rate-1 incompressible encryption from standard assumptions ⋮ Speak much, remember little: cryptography in the bounded storage model, revisited ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Unnamed Item ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ Lattice-based programmable hash functions and applications ⋮ Almost tight multi-user security under adaptive corruptions from LWE in the standard model ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Password Mistyping in Two-Factor-Authenticated Key Exchange ⋮ Unnamed Item ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ An Improved Robust Fuzzy Extractor ⋮ On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes ⋮ Критерии секретности ключа ⋮ Preserving Randomness for Adaptive Algorithms ⋮ Leakage-Resilient Revocable Identity-Based Signature with Cloud Revocation Authority ⋮ Fully Leakage-Resilient Codes ⋮ Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs ⋮ Privacy amplification with asymptotically optimal entropy loss ⋮ On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles ⋮ Unnamed Item ⋮ Continuously non-malleable codes with split-state refresh ⋮ Unnamed Item ⋮ Four-state non-malleable codes with explicit constant rate ⋮ On the Foundations of Quantitative Information Flow ⋮ Key Agreement from Close Secrets over Unsecured Channels ⋮ Unnamed Item ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption ⋮ Non-malleable functions and their applications ⋮ Improved computational extractors and their applications ⋮ Adaptive extractors and their application to leakage resilient secret sharing ⋮ Robustly reusable fuzzy extractor with imperfect randomness ⋮ HalftimeHash: modern hashing without 64-bit multipliers or finite fields ⋮ Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries ⋮ Condensed Unpredictability ⋮ Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Two-message statistically sender-private OT from LWE ⋮ How to Compute in the Presence of Leakage ⋮ LWE without modular reduction and improved side-channel attacks against BLISS ⋮ Targeted lossy functions and applications ⋮ Leakage-resilient cryptography from minimal assumptions ⋮ Leakage Resilient One-Way Functions: The Auxiliary-Input Setting ⋮ Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience ⋮ Local Correlation Breakers and Applications to Three-Source Extractors and Mergers ⋮ A counterexample to the chain rule for conditional HILL entropy ⋮ Fully leakage-resilient signatures ⋮ Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model ⋮ Public key encryption resilient to leakage and tampering attacks ⋮ Asymptotically quasi-optimal cryptography ⋮ Authentication in the bounded storage model ⋮ Secure non-interactive simulation: feasibility and rate ⋮ Feasibility and infeasibility of secure computation with malicious PUFs ⋮ Obfuscated fuzzy Hamming distance and conjunctions from subset product problems ⋮ Continuously non-malleable secret sharing for general access structures ⋮ Privacy amplification from non-malleable codes ⋮ Deciding unique decodability of bigram counts via finite automata ⋮ Leakage-resilient CCA2-secure certificateless public-key encryption scheme without bilinear pairing ⋮ Reflection Cryptanalysis of PRINCE-Like Ciphers ⋮ Authentication in Constrained Settings ⋮ Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy ⋮ Metric Pseudoentropy: Characterizations, Transformations and Applications ⋮ The Chaining Lemma and Its Application ⋮ Information Theoretic Security for Encryption Based on Conditional Rényi Entropies ⋮ Modulus Computational Entropy ⋮ Multi-key Homomorphic Authenticators ⋮ A Practical Fuzzy Extractor for Continuous Features ⋮ A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage ⋮ Updatable Lossy Trapdoor Functions and Its Application in Continuous Leakage ⋮ Computational fuzzy extractor from LWE ⋮ When Are Fuzzy Extractors Possible? ⋮ Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience ⋮ Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Access control encryption with efficient verifiable sanitized decryption ⋮ Lattice-based e-cash, revisited ⋮ Quasi chain rule for min-entropy ⋮ Algebraic manipulation detection codes ⋮ Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme
This page was built for publication: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
