Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Journal of Computer and System Sciences
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
On the (non)Universality of the One-Time Pad
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Protocols for Secret Key Agreement by Public Discussion Based on Common Information
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Privacy Amplification Secure Against Active Adversaries
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
SIAM Journal on Computing
Information-theoretically secure secret-key agreement by NOT authenticated public discussion
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Secure remote authentication using biometric data
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Robust fuzzy extractors and authenticated key agreement from close secrets
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Secret-key agreement over unauthenticated public channels .II. Privacy amplification
IEEE Transactions on Information Theory
Key Agreement from Close Secrets over Unsecured Channels
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Client-Server Password Recovery
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II
A key binding system based on n-nearest minutiae structure of fingerprint
Pattern Recognition Letters
On related-secret pseudorandomness
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
| Hi-index | 0.00 |
We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, Wï戮驴 to agree on a secret key Rin the presence of an active adversary. Robust fuzzy extractors were defined by Dodis et al. in Crypto 2006 to be noninteractive, i.e., only one message P, which can be modified by an unbounded adversary, can pass from one party to the other. This allows them to be used by a single party at different points in time (e.g., for key recovery or biometric authentication), but also presents an additional challenge: what if Ris used, and thus possibly observed by the adversary, before the adversary has a chance to modify P. Fuzzy extractors secure against such a strong attack are called post-application robust.We construct a fuzzy extractor with post-application robustness that extracts a shared secret key of up to (2mï戮驴 n)/2 bits (depending on error-tolerance and security parameters), where nis the bit-length and mis the entropy of W. The previously best known result, also of Dodis et al., extracted up to (2mï戮驴 n)/3 bits (depending on the same parameters).