( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Reusable Two-Round MPC from LPN.

, , , и . Public Key Cryptography (1), том 13177 из Lecture Notes in Computer Science, стр. 165-193. Springer, (2022)

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.

R Srinivasan

Sadagopan Srinivasan

Srinivasan Rajaraman

Srinivasan Seetharaman

Kamakshi Srinivasan

 

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

Stronger public key encryption system withstanding RAM scraper like attacks., , , и . Secur. Commun. Networks, 9 (12): 1650-1662 (2016)Muse: Secure Inference Resilient to Malicious Clients., , , и . USENIX Security Symposium, стр. 2201-2218. USENIX Association, (2021)Nearly Optimal Robust Secret Sharing Against Rushing Adversaries., , и . CRYPTO (3), том 12172 из Lecture Notes in Computer Science, стр. 156-185. Springer, (2020)SNARGs for P from Sub-exponential DDH and QR., , , и . EUROCRYPT (2), том 13276 из Lecture Notes in Computer Science, стр. 520-549. Springer, (2022)Two-Round Multiparty Secure Computation Minimizing Public Key Operations., , и . CRYPTO (3), том 10993 из Lecture Notes in Computer Science, стр. 273-301. Springer, (2018)Leakage Resilient Secret Sharing and Applications., и . IACR Cryptology ePrint Archive, (2018)Delphi: A Cryptographic Inference System for Neural Networks., , , , и . PPMLP@CCS, стр. 27-30. ACM, (2020)A Framework for Statistically Sender Private OT with Optimal Rate., , и . CRYPTO (1), том 14081 из Lecture Notes in Computer Science, стр. 548-576. Springer, (2023)Round-Optimal Black-Box MPC in the Plain Model., , , и . CRYPTO (1), том 14081 из Lecture Notes in Computer Science, стр. 393-426. Springer, (2023)Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)., , и . CRYPTO (5), том 14085 из Lecture Notes in Computer Science, стр. 224-257. Springer, (2023)