Author of the publication

Pseudorandom Bit Generators That Fool Modular Sums.

, , , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 615-630. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Pseudorandom Functions and Factoring., , and . SIAM J. Comput., 31 (5): 1383-1404 (2002)Constructing pseudo-random permutations with a prescribed structure., and . SODA, page 458-459. ACM/SIAM, (2001)Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders, , and . Annals of Mathematics, 155 (1): pp. 157-187 (2002)Only valuable experts can be valued., , , and . EC, page 221-222. ACM, (2011)Immunizing Encryption Schemes from Decryption Errors., , and . EUROCRYPT, volume 3027 of Lecture Notes in Computer Science, page 342-360. Springer, (2004)Completeness in two-party secure computation: a computational view., , , and . STOC, page 252-261. ACM, (2004)Number-theoretic Constructions of Efficient Pseudo-random Functions, and . J. ACM, 51 (2): 231--262 (March 2004)On the Communication Complexity of Key-Agreement Protocols., , , , and . ITCS, volume 124 of LIPIcs, page 40:1-40:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Balls and Bins: Smaller Hash Families and Faster Evaluation., , , and . SIAM J. Comput., 42 (3): 1030-1050 (2013)On the Power of the Randomized Iterate, , and . Electron. Colloquium Comput. Complex., (2005)