On extractors, error-correction and hiding all partial information
暂无分享,去创建一个
[1] Gilles Brassard,et al. Secret-Key Reconciliation by Public Discussion , 1994, EUROCRYPT.
[2] Yevgeniy Dodis,et al. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, EUROCRYPT.
[3] Yevgeniy Dodis,et al. Correcting errors without leaking partial information , 2005, STOC '05.
[4] Moni Naor,et al. Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..
[5] Yevgeniy Dodis,et al. Entropic Security and the Encryption of High Entropy Messages , 2005, TCC.
[6] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[7] Yan Zong Ding,et al. Error Correction in the Bounded Storage Model , 2005, TCC.
[8] Ueli Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher , 2004, Journal of Cryptology.
[9] Noam Nisan,et al. Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..
[10] Ran Canetti,et al. Perfectly one-way probabilistic hashing , 1998 .
[11] Alexander Russell,et al. How to fool an unbounded adversary with a short key , 2002, IEEE Transactions on Information Theory.
[12] Wen-Guey Tzeng,et al. Extracting randomness from multiple independent sources , 2005, IEEE Transactions on Information Theory.
[13] Noga Alon,et al. Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.