( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Composable Adaptive Secure Protocols without Setup under Polytime Assumptions.

, и . IACR Cryptology ePrint Archive, (2016)

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.

No persons found for author name Venkitasubramaniam, Muthuramakrishnan
add a person with the name Venkitasubramaniam, Muthuramakrishnan
 

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

What Security Can We Achieve Within 4 Rounds?, и . J. Cryptol., 32 (4): 1200-1262 (2019)Ligero: Lightweight Sublinear Arguments Without a Trusted Setup., , , и . IACR Cryptol. ePrint Arch., (2022)Brief announcement: on the round complexity of distributed consensus over synchronous networks., , , , и . PODC, стр. 397. ACM, (2004)Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions., и . TCC (B1), том 9985 из Lecture Notes in Computer Science, стр. 400-432. (2016)Flag: A Framework for Lightweight Robust Secure Aggregation., , , и . AsiaCCS, стр. 14-28. ACM, (2023)On Adaptively Secure Protocols.. SCN, том 8642 из Lecture Notes in Computer Science, стр. 455-475. Springer, (2014)What Security Can We Achieve Within 4 Rounds?, и . SCN, том 9841 из Lecture Notes in Computer Science, стр. 486-505. Springer, (2016)Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?, , и . EUROCRYPT (3), том 12107 из Lecture Notes in Computer Science, стр. 599-619. Springer, (2020)Can Alice and Bob Guarantee Output to Carol?, , и . EUROCRYPT (5), том 14655 из Lecture Notes in Computer Science, стр. 32-61. Springer, (2024)Better Two-Round Adaptive Multi-party Computation., , и . Public Key Cryptography (2), том 10175 из Lecture Notes in Computer Science, стр. 396-427. Springer, (2017)