( en | de | ru )

 

Disambiguation of "Vaikuntanathan, Vinod"

Author of the publication

copydeleteadd this publication to your clipboard
3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications.

, , , , and . CoRR, (2019)

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.

Vinod Vaikuntanathan

S Vinodh

Vinod Jadhav

Vinod Talgeri

Vinod Vijayakumar

 

Other publications of authors with the same name

Watermarking Cryptographic Capabilities., , , , and . SIAM J. Comput., 47 (6): 2157-2202 (2018)Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation., , , and . TCC (1), volume 11891 of Lecture Notes in Computer Science, page 55-80. Springer, (2019)Lattice Trapdoors and IBE from Middle-Product LWE., , and . TCC (1), volume 11891 of Lecture Notes in Computer Science, page 24-54. Springer, (2019)Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures., , and . FOCS, page 1162-1173. IEEE, (2022)Rate-1 Non-Interactive Arguments for Batch-NP and Applications., , , and . FOCS, page 1057-1068. IEEE, (2022)Planting Undetectable Backdoors in Machine Learning Models., , , and . CoRR, (2022)One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval., , , , and . IACR Cryptol. ePrint Arch., (2022)SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption., , and . IACR Cryptol. ePrint Arch., (2022)Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs., and . CRYPTO (3), volume 12172 of Lecture Notes in Computer Science, page 632-651. Springer, (2020)Lattice Problems beyond Polynomial Time., , , , , , , , and . STOC, page 1516-1526. ACM, (2023)