Author of the publication

Round Optimal Blind Signatures.

, , , , and . CRYPTO, volume 6841 of Lecture Notes in Computer Science, page 630-648. 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.

No persons found for author name Garg, Sanjam
add a person with the name Garg, Sanjam
 

Other publications of authors with the same name

Incremental Program Obfuscation., and . IACR Cryptology ePrint Archive, (2015)Cryptography with One-Way Communication., , , , and . IACR Cryptology ePrint Archive, (2014)On the Exact Cryptographic Hardness of Finding a Nash Equilibrium., , and . IACR Cryptology ePrint Archive, (2015)Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13., , , and . IACR Cryptology ePrint Archive, (2016)Adversarially Robust Learning Could Leverage Computational Hardness., , , and . CoRR, (2019)Two-Round MPC: Information-Theoretic and Black-Box., , and . TCC (1), volume 11239 of Lecture Notes in Computer Science, page 123-151. Springer, (2018)A Simple Construction of iO for Turing Machines., and . TCC (2), volume 11240 of Lecture Notes in Computer Science, page 425-454. Springer, (2018)Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions., , , , and . ASIACRYPT (3), volume 10626 of Lecture Notes in Computer Science, page 275-303. Springer, (2017)Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions., and . INDOCRYPT, volume 8885 of Lecture Notes in Computer Science, page 89-103. Springer, (2014)Improved Bounds on Security Reductions for Discrete Log Based Signatures., , and . CRYPTO, volume 5157 of Lecture Notes in Computer Science, page 93-107. Springer, (2008)