Privacy amplification and non-malleable extractors via character sums

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 668-677

  Dodis, Yevgeniy ^a   Li, Xin ^b   Wooley, Trevor D ^c   Zuckerman, David ^b  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE ADVERSARY; ARBITRARY FUNCTIONS; ARITHMETIC PROGRESSIONS; ASYMPTOTICALLY OPTIMAL; CHARACTER SUMS; COMPUTATIONAL POWER; ENTROPY RATES; KEY AGREEMENT; NEW PROTOCOL; NON-MALLEABLE; POLYNOMIAL-TIME; PRIME NUMBER; PRIVACY AMPLIFICATION; RANDOM SEEDS; RUNNING TIME;

AMPLIFICATION; COMPUTER SCIENCE; POLYNOMIAL APPROXIMATION;

SIGNAL THEORY;

EID: 84863321325     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.67     Document Type: Conference Paper

References (23)

1. C. Bennett, G. Brassard, and J.-M. Robert, "Privacy amplification by public discussion," SIAM Journal on Computing, vol. 17, pp. 210-229, 1988.
2. N. Nisan and D. Zuckerman, "Randomness is linear in space," Journal of Computer and System Sciences, vol. 52, no. 1, pp. 43-52, 1996.
3. U. M. Maurer and S. Wolf, "Privacy amplification secure against active adversaries," in CRYPTO '97, 1997.
4. Y. Dodis, J. Katz, L. Reyzin, and A. Smith, "Robust fuzzy extractors and authenticated key agreement from close secrets," in CRYPTO, 2006, pp. 232-250.
5. Y. Dodis and D. Wichs, "Non-malleable extractors and symmetric key cryptography from weak secrets," in STOC09, 2009.
6. R. Renner and S. Wolf, "Unconditional authenticity and privacy from an arbitrarily weak secret," in CRYPTO, 2003, pp. 78-95.
7. B. Kanukurthi and L. Reyzin, "Key agreement from close secrets over unsecured channels," in EUROCRYPT, 2009, pp. 206-223.
8. N. Chandran, B. Kanukurthi, R. Ostrovsky, and L. Reyzin, "Privacy amplification with asymptotically optimal entropy loss," in STOC10, 2010, pp. 785-794.
9. B. Chor and O. Goldreich, "Unbiased bits from sources of weak randomness and probabilistic communication complexity," SIAM Journal on Computing, vol. 17, no. 2, pp. 230-261, 1988.
10. B. Kanukurthi and L. Reyzin, "An improved robust fuzzy extractor," in SCN, 2008, pp. 156-171.
11. G. Cohen, R. Raz, and G. Segev, "Non-malleable extractors with short seeds and applications to privacy amplification," ECCC Report TR11-096, 2011.
12. Y. Dodis, X. Li, T. Wooley, and D. Zuckerman, "Privacy amplification and non-malleable extractors via character sums," Arxiv, Tech. Rep., 2011, http://arxiv.org/abs/1102.5415.
13. Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, "Fuzzy extractors: How to generate strong keys from biometrics and other noisy data," SIAM Journal on Computing, vol. 38, pp. 97-139, 2008.
14. A. Terras, Fourier Analysis on Finite Groups and Applications. Cambridge University Press, 1999.
15. A. Rao, "An exposition of Bourgain's 2-source extractor,"ECCC, Tech. Rep. TR07-034, 2007.
16. Y. Dodis and R. Oliveira, "On extracting private randomness over a public channel," in RANDOM 2003, 2003, pp. 252-263.
17. A. Weil, "On some exponential sums," Proceedings of the National Academy of Sciences, vol. 34, pp. 204-207, 1948.
18. W. Schmidt, Equations over Finite Fields. An Elementary Approach, ser. Lecture Notes in Mathematics. Springer-Verlag, 1976, vol. 536.
19. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson, "Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors," in STOC05, 2005, pp. 1-10.
20. R. Raz, "Extractors with weak random seeds," in STOC05, 2005, pp. 11-20.
21. D. Zuckerman, "Linear degree extractors and the inapproximability of Max Clique and Chromatic Number,"Theory of Computing, vol. 3, pp. 103-128, 2007.
22. V. Guruswami, C. Umans, and S. Vadhan, "Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes," Journal of the ACM, vol. 56, no. 4, 2009.
23. Z. Dvir, S. Kopparty, S. Saraf, and M. Sudan, "Extensions to the method of multiplicities, with applications to kakeya sets and mergers," in FOCS09, 2009.