Privacy Amplification and Nonmalleable Extractors Via Character Sums

DOI10.1137/120868414zbMath1302.94043arXiv1102.5415MaRDI QIDQ5494939

Trevor D. Wooley, David Zuckerman, Xin Li, Yevgeniy Dodis

Publication date: 30 July 2014

Published in: SIAM Journal on Computing, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.5415

zbMATH Keywords

cryptography; randomness; extractors; privacy amplification; nonmalleable

Mathematics Subject Classification ID

94A60: Cryptography

68W20: Randomized algorithms

68M12: Network protocols

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)