Exposure-resilient extractors

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 2006, Issue , 2006, Pages 64-72

  Zimand, Marius ^a  

^a TOWSON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; CIRCUIT THEORY; RANDOM PROCESSES; STATISTICAL TESTS;

ADAPTIVE QUERIES; ORACLE CIRCUITS; QUERY RESISTANCE; RESILIENT EXTRACTORS;

RANDOM VARIABLES;

EID: 34247514891     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2006.19     Document Type: Conference Paper

References (19)

1. B. Barak, R. Shaltiel, and E. Tromer. True random number generators secure in achanging environment. In Workshop in Cryptography Hardware and Embedded Systems(CHES), number 2779 in LNCS, pages 166-180. Springer Verlag, 2003.
2. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850-864, Nov. 1984.
3. Y. Dodis. Exposure-resilient Cryptography. PhD thesis, MIT, August 2000.
4. Y. Dodis, A. Sahai, and A. Smith. On perfect and adaptive security in exposure-resilient cryptography. In Advances in Cryptology - EUROCRYPT, May 2001.
5. R. Gennaro and L. Trevisan. Lower bounds on the efficiency of generic cryptographic constructions. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, 2000.
6. O. Goldreich, R. Rubinfeld, and M. Sudan. Learning polynomials with queries - the highly noisy case. Technical Report TR98-060, Electronic Colloquium on Computational Complexity, 1998. http://www.eccc.uni-trier.de/eccc.
7. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. Construction of a pseudo-random generator from any one-way function. SIAM Journal on Computing, 28(4), 1999.
8. R. Impagliazzo. Very strong one-way functions and pseudo-random generators exist relative to a random oracle, (manuscript), January 1996.
9. J. Kamp and D. Zuckerman. Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, pages 92-101. IEEE, 2003.
10. C. Lu. Encryption against storage-bounded adversaries from on-line strong extractors. Journal of Cryptology, 17(1):27-42, January 2004.
11. N. Nisan. Extracting randomness: how and why. A survey. In Proceedings of the 11th Structure in Complexity Theory Conference, pages 44-58, 1996.
12. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
13. R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin EATCS, 77:67-95, June 2002.
14. L. Trevisan. Extractors and pseudorandom generators. Journal of the ACM, 48(4):860-879, 2001.
15. S. Vadhan. Randomess extractors and their cryptographic applications. Netherlands RISC Seminar and Intercity Number Theory Seminar, January 21, 2005. Available at http://eecs.harvard.edu/~salil/survey-talks.html.
16. S. Vadhan. On constructing locally computable extractors and cryptosystems in the bounded-storage model. J. of Cryptology, 17(1):43-77, January 2004.
17. H. Wee. On obfuscating point functions. In Proceedings of the 37th ACM Symposium on Theory of Computing, pages 523-532, May 2005.
18. A. Yao. Theory and application of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.
19. M. Zimand. Simple extractors via constructions of cryptographic pseudo-random generators. In Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 3580, pages 115-127. Springer-Verlag, 2005.