Non-malleable extractors with short seeds and applications to privacy amplification

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2012, Pages 298-308

  Cohen, Gil ^a   Raz, Ran ^a   Segev, Gil ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

extractors; non malleable extractors; privacy amplification

Indexed keywords

ARBITRARY CONSTANTS; ARBITRARY FUNCTIONS; ASYMPTOTICALLY OPTIMAL; CLASSICAL PROBLEMS; COMMUNICATION COMPLEXITY; ENTROPY LOSS; EXPLICIT CONSTRUCTIONS; EXTRACTORS; ITS EFFICIENCIES; MIN-ENTROPY RATE; NON-MALLEABILITY; NON-MALLEABLE; POLY-LOGARITHMIC COMMUNICATION; PRIME NUMBER; PRIVACY AMPLIFICATION;

COMMUNICATION; SIGNAL THEORY;

AMPLIFICATION;

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

References (21)

1. N. Alon and O. Goldreich and J. Håstad and R. Peralta, Simple Construction of Almost k-wise Independent Random Variables, Random Structures and Algorithms 3(3): 289-304, 1992.
2. C. H. Bennett and G. Brassard and C. Crépeau and U. M. Maurer, Generalized privacy amplification, IEEE Transactions on Information Theory 41(6): 1915-1923, 1995.
3. C. H. Bennett and G. Brassard and J. M. Robert, Privacy Amplification by Public Discussion, SIAM J. Comput. 17(2): 210-229, 1988
4. N. Chandran and B. Kanukurthi and R. Ostrovsky and L. Reyzin, Privacy amplification with asymptotically optimal entropy loss, Proceedings of the 42nd Annual ACM Symposium on Theory of Computing: 785-794, 2010.
5. B. Chor and O. Goldreich, Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity, SIAM J. on Computing 17(2): 230-261, 1988.
6. Y. Dodis and J. Katz and L. Reyzin and A. Smith, Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets, Advance in Cryptology - CRYPTO '06: 232-250, 2006.
7. Y. Dodis and X. Li and T. D. Wooley and D. Zuckerman Non-malleable extractors via character sums, arXiv:1102.5415v6 [cs.CR], http://arxiv.org/abs/ 1102.5415, 2011
8. Y. Dodis and X. Li and T. D. Wooley and D. Zuckerman Non-malleable extractors via character sums, Proceedings of the 52th Annual Symposium on Foundations of Computer Science: 601-610, 2011.
9. Y. Dodis and D. Wichs, Non-malleable extractors and symmetric key cryptography from weak secrets, Proceedings of the 41st Annual ACM Symposium on Theory of Computing: 601-610, 2009.
10. V. Guruswami and C. Umans and S. Vadhan, Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes, Journal of the ACM (JACM) 56(4): 1-34, 2009.
11. R. Impagliazzo and L. A. Levin and M. Luby, Pseudo-random Generation from one-way functions, Proceedings of the 21st Annual ACM Symposium on Theory of Computing: 12-24, 1989.
12. B. Kanukurthi and L. Reyzin, Key Agreement from Close Secrets over Unsecured Channels, Advance in Cryptology - EUROCRYPT '09: 206-223, 2009.
13. U. M. Maurer, Protocols for Secret Key Agreement by Public Discussion Based on Common Information, Advance in Cryptology - CRYPTO '92: 461-470, 1992.
14. U. M. Maurer, Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion, Advance in Cryptology - EUROCRYPT '97: 209-225, 1997.
15. U. M. Maurer and S. Wolf, emphSecret-key agreement over unauthenticated public channels III: Privacy amplification, IEEE Transactions on Information Theory 49(4): 839-851, 2003.
16. U. M. Maurer and S. Wolf, Privacy Amplification Secure Against Active Adversaries, Advance in Cryptology - CRYPTO '97: 307-321, 1997.
17. J. Naor and M. Naor, Small-Bias Probability Spaces: Efficient Constructions and Applications, SIAM J. on Computing 22(4): 838-856, 1993.
18. N. Nisan and D. Zuckerman, Randomness is linear in Space, J. of Computer and System Sciences, 52(1): 43-52, 1996.
19. R. Raz, Extractors with weak random seeds, Proceedings of the 37th Annual STOC: 11-20, 2005.
20. R. Renner and S. Wolf, Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret, Advance in Cryptology - CRYPTO '03: 78-95, 2003.
21. S. Wolf, Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement, Advance in Cryptology - ASIACRYPT '98: 405-419, 1998.