Author of the publication

Collision-Free Hashing from Lattice Problems.

, , and . Studies in Complexity and Cryptography, volume 6650 of Lecture Notes in Computer Science, Springer, (2011)

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

How to Incentivize Data-Driven Collaboration Among Competing Parties., , and . IACR Cryptology ePrint Archive, (2015)Verifiable Partial Key Escrow., and . IACR Cryptology ePrint Archive, (1996)Pseudo-deterministic Algorithms (Invited Talk).. STACS, volume 14 of LIPIcs, page 29-29. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)The Complexity of Problems in P Given Correlated Instances., and . ITCS, volume 67 of LIPIcs, page 13:1-13:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Functional Signatures and Pseudorandom Functions., , and . Public Key Cryptography, volume 8383 of Lecture Notes in Computer Science, page 501-519. Springer, (2014)How to Compute in the Presence of Leakage., and . SIAM J. Comput., 44 (5): 1480-1549 (2015)A Note on the Impossibility of Obfuscation with Auxiliary Input., and . IACR Cryptology ePrint Archive, (2013)On the Limits of Non-Approximability of Lattice Problems., and . STOC, page 1-9. ACM, (1998)On the power of interaction., , and . Combinatorica, 10 (1): 3-25 (1990)A (de)constructive approach to program checking., , , , and . STOC, page 143-152. ACM, (2008)