On extractors, error-correction and hiding all partial information

2005 IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security

Volumn 2005, Issue , 2005, Pages 74-79

  Dodis, Yevgeniy ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION-RESISTANCE; RANDOMNESS EXTRACTORS; SECURE ENCRYPTION;

CODES (SYMBOLS); COMPUTER SCIENCE; CONSTRAINT THEORY; CRYPTOGRAPHY; ENTROPY; ERROR CORRECTION; FUNCTIONS;

RANDOM PROCESSES;

EID: 33750421112     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWTPI.2005.1543961     Document Type: Conference Paper

References (13)

1. Noga Alon, Oded Goldreich, Johan Håstad, René Peralta: Simple Constructions of Almost k-Wise Independent Random Variables. FOCS 1990: 544-553
2. Gilles Brassard, Louis Salvail. Secret-Key Reconciliation by Public Discussion. In Advances in Cryptology - EUROCRYPT 1993, p. 410-423.
3. R. Canetti, D. Micciancio, O. Reingold. Perfectly One-Way Probabilistic Hash Functions. In Proc. 30th ACM Symp. on Theory of Computing, 1998, pp. 131-140.
4. Y.Z. Ding. Error Correction in the Bounded Storage Model. In Theory of Cryptography Conference 2005, pp. 578-599.
5. Y. Dodis, L. Reyzin and A. Smith. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. In Advances in Cryptology - EUROCRYPT 2004.
6. Y. Dodis and A. Smith. Entropic Security and the Encryption of High-Entropy Messages. In Theory of Cryptography Conference 2005.
7. Y. Dodis and A. Smith. Correcting Errors Without Leaking partial Information. Proc. 37th ACM Symp. on Theory of Computing, 2005, pp. 654-663.
8. J. Håstad, R. Impagliazzo, L. Levin, M. Luby. A Pseudorandom generator from any one-way function. In Proc. 21st ACM Symp. on Theory of Computing, 1989.
9. C.-J. Lee, C.-J. Lu, S.-C. Tsai and W.-G. Tzeng. Extracting Randomness from Multiple Independent Sources. In IEEE Transactions on Information Theory (SCI), 51(6):2224-2227, 2005.
10. U. Maurer. Conditionally-Perfect Secrecy and a Provably Secure Randomized Cipher. Journal of Cryptology, 5(1):53-66, 1992.
11. J. Naor, M. Naor. Small-Bias Probability Spaces: Efficient Constructions and Applications.In SIAM J. Comput. 22(4): 838-856 (1993).
12. N. Nisan, D. Zuckerman. Randomness is Linear in Space. In JCSS, 52(1), pp. 43-52, 1996.
13. A. Russell and Wang. How to Fool an Unbounded Adversary with a Short Key. In Advances in Cryptology - EUROCRYPT 2002.