( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
ORTOA: A Family of One Round Trip Protocols For Operation-Type Obliviousness.

, , , , , , и . EDBT, стр. 534-546. OpenProceedings.org, (2024)

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.

Prabhanjan Ananth

Ananth Komanduri

 

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

Optimal Bounded-Collusion Secure Functional Encryption., и . TCC (1), том 11891 из Lecture Notes in Computer Science, стр. 174-198. Springer, (2019)From FE Combiners to Secure MPC and Back., , , , и . TCC (1), том 11891 из Lecture Notes in Computer Science, стр. 199-228. Springer, (2019)Fully Homomorphic NIZK and NIWI Proofs., , , и . TCC (2), том 11892 из Lecture Notes in Computer Science, стр. 356-385. Springer, (2019)Multikey FHE in the Plain Model., , , и . IACR Cryptol. ePrint Arch., (2020)Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications., , , и . TCC (1), том 13747 из Lecture Notes in Computer Science, стр. 237-265. Springer, (2022)On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions., , и . ASIACRYPT (8), том 14445 из Lecture Notes in Computer Science, стр. 39-72. Springer, (2023)Cryptography from Pseudorandom Quantum States., , и . CRYPTO (1), том 13507 из Lecture Notes in Computer Science, стр. 208-236. Springer, (2022)Secure Software Leasing., и . CoRR, (2020)Towards Efficiency-Preserving Round Compression in MPC - Do Fewer Rounds Mean More Computation?, , , и . ASIACRYPT (3), том 12493 из Lecture Notes in Computer Science, стр. 181-212. Springer, (2020)Unbounded Multi-party Computation from Learning with Errors., , , и . EUROCRYPT (2), том 12697 из Lecture Notes in Computer Science, стр. 754-781. Springer, (2021)