Deterministic extractors for bit-fixing sources and exposure-resilient cryptography

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 92-101

  Kamp, Jesse ^a   Zuckerman, David ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; VECTORS; COMPUTER SCIENCE; DATA MINING; RANDOM PROCESSES;

ADAPTIVE EXPOSURE RESILIENT FUNCTIONS; ALL OR NOTHING TRANSFORM; BIT FIXING SOURCES; DETERMINISTIC EXTRACTORS;

CRYPTOGRAPHY;

ALL OR NOTHINGS; BIT-FIXING SOURCES; COMPUTATIONAL MODEL; DETERMINISTIC ALGORITHMS; DETERMINISTIC EXTRACTOR; PROTECTION; RANDOM BITS; RESILIENT FUNCTION;

EID: 0344981502     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. M. Ajtai, J. Komlós, and E. Szemerédi. Deterministic simulation in Logspace. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 132-140, 1987.
2. M. Ajtai and N. Linial. The influence of large coalitions. Combinatorica, 13(2):129-145, 1993.
3. M. Ben-Or and N. Linial. Collective coin flipping. In. S. Micali, editor, Randomness and Computation, pages 91-115. Academic Press, New York, 1990.
4. J. Bierbrauer and H. Schellwat. Almost independent and weakly biased arrays: Efficient constructions and cryptologic applications. In Advances in Cryptology - CRYPTO '00, volume 1880 of Lecture Notes in Computer Science, pages 531-543, 2000.
5. M. Blaze. High-bandwidth encryption with low-bandwidth smartcards. In Fast Software Encryption, pages 33-40, 1996.
6. B. Bollobás and I. Leader. Exact edge-isoperimetric inequalities. Europ. J. Combinatorics, 11:335-340, 1990.
7. B. Bollobás and A. J. Radcliffe. Isoperimetric inequalities for faces of the cube and the grid. Europ. J. Combinatorics, 11:323-333, 1990.
8. V. Boyko. On the security properties of the oaep as an all-or-nothing transform. In M. Wiener, editor, Advances in Cryptology - CRYPTO '99, volume 1666 of Lecture Notes in Computer Science, pages 503-518, Springer-Verlag, 1999.
9. R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz, and A. Sahai. Exposure-resilient functions and all-or-nothing transforms. In B. Preneel, editor, Advances in Cryptology - EURO-CRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 453-469. Springer-Verlag, May 2000.
10. B. Chor, J. Friedman, O. Goldreich, J. Håstad, S. Rudich, and R. Smolensky. The bit extraction problem or t-resilient functions. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, pages 396-407, 1985.
11. A. Cohen and A. Wigderson. Dispersers, deterministic amplification, and weak random sources. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 14-19, 1989.
12. Y. Dodis. Exposure-Resilient Cryptography. PhD thesis, MIT, 2000.
13. Y. Dodis, A. Sahai, and A. Smith. On perfect and adaptive security in exposure-resilient cryptography. In B. Pfitzmann, editor, Advances in Cryptology - EUROCRYPT '01, volume 2045 of Lecture Notes in Computer Science, pages, 301-324. Springer-Verlag, May 2001.
14. J. Friedman. On the bit extraction problem. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 314-319, 1992.
15. O. Gabber and Z. Galil. Explicit construction of linear sized superconcentrators. Journal of Computer and System Sciences, 22:407-420, 1981.
16. R. Impagliazzo and D. Zuckerman. How to recycle random bits. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 248-253, 1989.
17. M. Jakobsson, J. P. Stern, and M. Yung. Scramble all, encrypt small. Lecture Notes in Computer Science, 1636:95-111, 1999.
18. J. Kahn, G. Kalai, and N. Linial. The influence of variables on Boolean functions. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 68-80, 1988.
19. K. Kurosawa, T. Johansson, and D. R. Stinson. Almost k-wise independent sample spaces and their cryptologic applications. Journal of Cryptology, 14(4):231-253, 2001.
20. L. Lovász. Random walks on graphs: A survey. In D. Miklós, V. T. Sós, and T. Szönyi, editors, Combinatorics, Paul Erdös is Eighty, Vol. 2, pages 353-398. J. Bolyai Math. Soc., Budapest, 1996.
21. A. Lubotzky. Discrete Groups, Expanding Graphs and Invariant Measures. Birkhäuser, 1994.
22. A. Lubotzky, R. Philips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261-277, 1988.
23. S. Matyas, M. Peyravian, and A. Roginsky. Encryption of long blocks using a short-block encryption procedure. http://grouper.ieee.org/groups/1363/P1363a/LongBlock.html.
24. N. Nisan and D. Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1)43-52, 1996.
25. O. Reingold, S. Vadhan, and A. Wigderson. Entropy waves, the zig-zag product, and new constant-degree expanders and extractors. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 3-13, 2000.
26. R. L. Rivest. All-or-nothing encryption and the package transform. Lecture Notes in Computer Science, 1267:210-218, 1997.
27. A. Russell and D. Zuckerman. Perfect-information leader election in log n + O(1) rounds. Journal of Computer System Sciences, 63:612-626, 2001.
28. M. Santha and U. V. Vazirani. Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences, 33:75-87, 1986.
29. R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the European Association for Theoretical Computer Science, (77):67-95, June 2002.
30. L. Trevisan and S. P. Vadhan. Extracting randomness from samplable distributions. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 32-42, 2000.