( en | de | ru )

 

Disambiguation of "Garg, Sanjam"

Author of the publication

copydeleteadd this publication to your clipboard
Two-Round Oblivious Transfer from CDH or LPN.

, , , , and . EUROCRYPT (2), volume 12106 of Lecture Notes in Computer Science, page 768-797. Springer, (2020)

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.

Neil Garg

Animesh Garg

Priya Garg

Dineshkumar Garg

Martin Garg

 

Other publications of authors with the same name

Identity-based Encryption from the Diffie-Hellman Assumption., and . J. ACM, 68 (3): 14:1-14:46 (2021)Incremental Program Obfuscation., and . CRYPTO (2), volume 10402 of Lecture Notes in Computer Science, page 193-223. Springer, (2017)TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption., , and . CRYPTO (3), volume 9816 of Lecture Notes in Computer Science, page 563-592. Springer, (2016)Cryptography with Weights: MPC, Encryption and Signatures., , , , , and . CRYPTO (1), volume 14081 of Lecture Notes in Computer Science, page 295-327. Springer, (2023)Is Private Learning Possible with Instance Encoding?, , , , , , , and . SP, page 410-427. IEEE, (2021)Registration-Based Encryption from Standard Assumptions., , , , and . IACR Cryptol. ePrint Arch., (2018)Tight Verifiable Delay Functions., , , and . IACR Cryptol. ePrint Arch., (2019)Hardness Preserving Constructions of Pseudorandom Functions, Revisited., and . IACR Cryptol. ePrint Arch., (2012)Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More., , and . IACR Cryptol. ePrint Arch., (2019)Laconic Private Set Intersection and Applications., , , , , and . TCC (3), volume 13044 of Lecture Notes in Computer Science, page 94-125. Springer, (2021)