Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
暂无分享,去创建一个
[1] Yan Zong Ding,et al. Error Correction in the Bounded Storage Model , 2005, TCC.
[2] Rafail Ostrovsky,et al. Secure Remote Authentication Using Biometric Data , 2005, EUROCRYPT.
[3] Rafail Ostrovsky,et al. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, SIAM J. Comput..
[4] Ueli Maurer,et al. Generalized privacy amplification , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.
[5] Renato Renner,et al. The Exact Price for Unconditionally Secure Asymmetric Cryptography , 2004, EUROCRYPT.
[6] Ueli Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher , 2004, Journal of Cryptology.
[7] A. D. Wyner,et al. The wire-tap channel , 1975, The Bell System Technical Journal.
[8] Yevgeniy Dodis,et al. Correcting errors without leaking partial information , 2005, STOC '05.
[9] Renato Renner,et al. Simple and Tight Bounds for Information Reconciliation and Privacy Amplification , 2005, ASIACRYPT.
[10] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[11] Joel H. Spencer,et al. On the (non)universality of the one-time pad , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[12] Sarvar Patel,et al. Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman , 2000, EUROCRYPT.
[13] Xavier Boyen,et al. Reusable cryptographic fuzzy extractors , 2004, CCS '04.
[14] Noam Nisan,et al. Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..
[15] Larry Carter,et al. New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..
[16] Jean-Paul M. G. Linnartz,et al. New Shielding Functions to Enhance Privacy and Prevent Misuse of Biometric Templates , 2003, AVBPA.
[17] Mihir Bellare,et al. Authenticated Key Exchange Secure against Dictionary Attacks , 2000, EUROCRYPT.
[18] Bert den Boer. A Simple and Key-Economical Unconditional Authentication Scheme , 1993, J. Comput. Secur..
[19] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[20] Stefan Wolf,et al. Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement , 1998, ASIACRYPT.
[21] Ueli Maurer,et al. Privacy Amplification Secure Against Active Adversaries , 1997, CRYPTO.
[22] Yehuda Lindell,et al. A Framework for Password-Based Authenticated Key Exchange , 2003, EUROCRYPT.
[23] Richard Taylor,et al. An Integrity Check Value Algorithm for Stream Ciphers , 1993, CRYPTO.
[24] Ueli Maurer,et al. Secret-key agreement over unauthenticated public channels III: Privacy amplification , 2003, IEEE Trans. Inf. Theory.
[25] Ueli Maurer,et al. Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion , 1997, EUROCRYPT.
[26] Gilles Brassard,et al. Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..
[27] Rafail Ostrovsky,et al. Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords , 2001, EUROCRYPT.
[28] Ueli Maurer,et al. Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.
[29] Salil P. Vadhan,et al. Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model , 2003, Journal of Cryptology.
[30] Aravind Srinivasan,et al. Computing with Very Weak Random Sources , 1999, SIAM J. Comput..
[31] Renato Renner,et al. Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret , 2003, CRYPTO.
[32] Yonatan Aumann,et al. Everlasting security in the bounded storage model , 2002, IEEE Trans. Inf. Theory.
[33] Jaikumar Radhakrishnan,et al. Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators , 2000, SIAM J. Discret. Math..
[34] Ari Juels,et al. Error-tolerant password recovery , 2001, CCS '01.
[35] Yevgeniy Dodis,et al. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, EUROCRYPT.
[36] Mihir Bellare,et al. Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[37] Yehuda Lindell,et al. Session-Key Generation Using Human Passwords Only , 2001, CRYPTO.
[38] Claude Crépeau,et al. Efficient Cryptographic Protocols Based on Noisy Channels , 1997, EUROCRYPT.
[39] Thomas Johansson,et al. On Families of Hash Functions via Geometric Codes and Concatenation , 1993, CRYPTO.
[40] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[41] Martin Wattenberg,et al. A fuzzy commitment scheme , 1999, CCS '99.
[42] Douglas R. Stinson,et al. Universal hashing and authentication codes , 1991, Des. Codes Cryptogr..