Extractors for low-weight affine sources

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2009, Pages 95-101

  Rao, Anup ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Affine sources; Bit fixing sources; Exposure resilient cryptography; Extractors

Indexed keywords

AFFINE SOURCES; BIT-FIXING SOURCES; EXPOSURE RESILIENT CRYPTOGRAPHY; EXTRACTORS; LINEAR SPACES; LOW ENTROPY; LOW WEIGHT; LOW-DIMENSIONAL SUBSPACE; POLYNOMIAL-TIME; RANDOM POINTS; RANDOM SOURCES; WEIGHT VECTOR;

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; POLYNOMIAL APPROXIMATION;

WEIGHING;

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

References (19)

1. Noga Alon, Oded Goldreich, Johan Hastad, and Reńe Peralta. Simple construction of almost k-wise independent random variables. Random Structures and Algorithms, 3(3): 289-304, 1992.
2. Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, and Avi Wigderson. Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 1-10, 2005.
3. Matt Blaze. High-bandwidth encryption with lowbandwidth smartcards. Lecture Notes in Computer Science, 1039: 33-??, 1996.
4. Jean Bourgain. On the construction of affine-source extractors. Geometric and Functional Analysis, 1: 33- 57, 2007.
5. Victor Boyko. On the security properties of OAEP as an all-or-nothing transform. Lecture Notes in Computer Science, 1666: 503-518, 1999.
6. Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, and Amit Sahai. Exposure-resilient functions and all-or-nothing transforms. In Bart Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 453-469. Springer-Verlag, May 2000.
7. Benny Chor, Joel Friedman, Oded Goldreich, Johan Hastad, Steven Rudich, and Roman 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.
8. Yevgeniy Dodis. Exposure-resilient cryptography. PhD thesis, Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
9. Cynthia Dwork, Krishnaram Kenthapadi, Frank Mc- Sherry, Ilya Mironov, and Moni Naor. Our data, ourselves: Privacy via distributed noise generation. In Serge Vaudenay, editor, EUROCRYPT, volume 4004 of Lecture Notes in Computer Science, pages 486-503. Springer, 2006.
10. Ariel Gabizon and Ran Raz. Deterministic extractors for affine sources over large fields. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005.
11. Ariel Gabizon, Ran Raz, and Ronen Shaltiel. Deterministic extractors for bit-fixing sources by obtaining an independent seed. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004.
12. Markus Jakobsson, Julien P. Stern, and Moti Yung. Scramble all, encrypt small. Lecture Notes in Computer Science, 1636: 95-111, 1999.
13. Jesse Kamp and David Zuckerman. Deterministic extractors for affine sources from bent functions. Manuscript.
14. Jesse Kamp and David Zuckerman. Deterministic extractors for bit-fixing sources and exposureresilient cryptography. SIAM Journal on Computing, 36(5): 1231-1247, 2007.
15. Joseph Naor and Moni Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing, 22(4): 838-856, August 1993.
16. Anup Rao. Extractors for a constant number of polynomially small min-entropy independent sources. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006.
17. Ran Raz, Omer Reingold, and Salil Vadhan. Extracting all the randomness and reducing the error in trevisan's extractors. jcss, 65(1): 97-128, 2002.
18. Ronald Rivest. All-or-nothing encryption and the package transform. Lecture Notes in Computer Science, 1267: 210-??, 1997.
19. Luca Trevisan. Extractors and pseudorandom generators. Journal of the ACM, pages 860-879, 2001.