Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets

DOI10.1007/11818175_14zbMath1161.94440OpenAlexW2137072047MaRDI QIDQ5756656

No author found.

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11818175_14

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Authentication, digital signatures and secret sharing (94A62)

Related Items (21)

Robustly reusable fuzzy extractor with imperfect randomness ⋮ LWE without modular reduction and improved side-channel attacks against BLISS ⋮ Binary AMD Circuits from Secure Multiparty Computation ⋮ Privacy with Imperfect Randomness ⋮ Privacy amplification from non-malleable codes ⋮ Preventing Scaling of Successful Attacks: A Cross-Layer Security Architecture for Resource-Constrained Platforms ⋮ Information Theoretic Security for Encryption Based on Conditional Rényi Entropies ⋮ Password Mistyping in Two-Factor-Authenticated Key Exchange ⋮ Computational robust (fuzzy) extractors for CRS-dependent sources with minimal min-entropy ⋮ Algebraic manipulation detection codes ⋮ Robustly reusable fuzzy extractor from standard assumptions ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Secure and Private, yet Lightweight, Authentication for the IoT via PUF and CBKA ⋮ An Improved Robust Fuzzy Extractor ⋮ Secure identification and QKD in the bounded-quantum-storage model ⋮ Non-Malleable Codes from Additive Combinatorics ⋮ Unnamed Item ⋮ Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources ⋮ Reusable fuzzy extractor from the decisional Diffie-Hellman assumption ⋮ Key Agreement from Close Secrets over Unsecured Channels ⋮ On Related-Secret Pseudorandomness

This page was built for publication: Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets