Publication:5494939

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

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

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

cryptographyrandomnessextractorsprivacy amplificationnonmalleable

Mathematics Subject Classification ID

Cryptography (94A60) Randomized algorithms (68W20) Network protocols (68M12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Privacy amplification from non-malleable codes, Algebraic restriction codes and their applications, Extractors: low entropy requirements colliding with non-malleability, Nonmalleable Extractors and Codes, with Their Many Tampered Extensions, Privacy amplification with asymptotically optimal entropy loss, Unnamed Item, Explicit two-source extractors and resilient functions, Non-malleability against polynomial tampering