From post

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.

 

Другие публикации лиц с тем же именем

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