From post

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.

 

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

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)., , , и . ASIACRYPT (3), том 11274 из Lecture Notes in Computer Science, стр. 86-117. Springer, (2018)Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits., , , , , и . ESORICS, том 8134 из Lecture Notes in Computer Science, стр. 1-18. Springer, (2013)Efficient Pseudorandom Correlation Generators: Silent OT Extension and More., , , , , и . CRYPTO (3), том 11694 из Lecture Notes in Computer Science, стр. 489-518. Springer, (2019)Compact Zero-Knowledge Proofs of Small Hamming Weight., , , , и . IACR Cryptology ePrint Archive, (2017)Improved Key Generation for Gentry's Fully Homomorphic Encryption Scheme., и . IMACC, том 7089 из Lecture Notes in Computer Science, стр. 10-22. Springer, (2011)SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority., , , , и . CRYPTO (2), том 10992 из Lecture Notes in Computer Science, стр. 769-798. Springer, (2018)TinyKeys: A New Approach to Efficient Multi-Party Computation., , , и . J. Cryptol., 35 (2): 13 (2022)Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions., , , и . IACR Cryptol. ePrint Arch., (2020)SoK: Vector OLE-Based Zero-Knowledge Protocols., , , и . IACR Cryptol. ePrint Arch., (2023)On the Bottleneck Complexity of MPC with Correlated Randomness., , и . IACR Cryptol. ePrint Arch., (2021)