Author of the publication

Degree 2 is Complete for the Round-Complexity of Malicious MPC.

, , and . EUROCRYPT (2), volume 11477 of Lecture Notes in Computer Science, page 504-531. Springer, (2019)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Key-Dependent Message Security: Generic Amplification and Completeness.. EUROCRYPT, volume 6632 of Lecture Notes in Computer Science, page 527-546. Springer, (2011)The Cryptographic Hardness of Random Local Functions - Survey.. IACR Cryptology ePrint Archive, (2015)Conditional Disclosure of Secrets and d-Uniform Secret Sharing with Constant Information Rate., and . IACR Cryptology ePrint Archive, (2018)Cryptography in Constant Parallel Time.. Information Security and Cryptography Springer, (2014)Semantic Security under Related-Key Attacks and Applications., , and . ICS, page 45-60. Tsinghua University Press, (2011)On Pseudorandom Generators with Linear Stretch in NC0., , and . Comput. Complex., 17 (1): 38-69 (2008)On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs., and . ITC, volume 199 of LIPIcs, page 4:1-4:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract)., , and . TCC (2), volume 13748 of Lecture Notes in Computer Science, page 103-120. Springer, (2022)On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate., and . TCC (1), volume 11239 of Lecture Notes in Computer Science, page 317-344. Springer, (2018)Secret Sharing, Slice Formulas, and Monotone Real Circuits., , , , and . ITCS, volume 215 of LIPIcs, page 8:1-8:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)