( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Data structures meet cryptography: 3SUM with preprocessing.

, , , , и . STOC, стр. 294-307. ACM, (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.

Vinod Vaikuntanathan

S Vinodh

Vinod Jadhav

Vinod Vijayakumar

Vinod Talgeri

 

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

Watermarking Cryptographic Capabilities., , , , и . SIAM J. Comput., 47 (6): 2157-2202 (2018)Planting Undetectable Backdoors in Machine Learning Models., , , и . CoRR, (2022)One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval., , , , и . IACR Cryptol. ePrint Arch., (2022)SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption., , и . IACR Cryptol. ePrint Arch., (2022)Rate-1 Non-Interactive Arguments for Batch-NP and Applications., , , и . FOCS, стр. 1057-1068. IEEE, (2022)Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation., , , и . TCC (1), том 11891 из Lecture Notes in Computer Science, стр. 55-80. Springer, (2019)Lattice Trapdoors and IBE from Middle-Product LWE., , и . TCC (1), том 11891 из Lecture Notes in Computer Science, стр. 24-54. Springer, (2019)A system capable of verifiably and privately screening global DNA synthesis., , , , , , , , , и 20 other автор(ы). CoRR, (2024)Lattice Problems beyond Polynomial Time., , , , , , , , и . STOC, стр. 1516-1526. ACM, (2023)Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs., и . CRYPTO (3), том 12172 из Lecture Notes in Computer Science, стр. 632-651. Springer, (2020)