Author of the publication

Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits.

, , , , , and . IACR Cryptology ePrint Archive, (2012)

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

Multiparty Computation from Somewhat Homomorphic Encryption., , , and . CRYPTO, volume 7417 of Lecture Notes in Computer Science, page 643-662. Springer, (2012)Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits., , , , , and . IACR Cryptology ePrint Archive, (2012)Robust Secret Sharing Schemes Against Local Adversaries., and . IACR Cryptology ePrint Archive, (2014)Robust Secret Sharing Schemes Against Local Adversaries., and . Public Key Cryptography (2), volume 9615 of Lecture Notes in Computer Science, page 327-356. Springer, (2016)Overdrive: Making SPDZ Great Again., , and . IACR Cryptology ePrint Archive, (2017)Essentially Optimal Robust Secret Sharing with Maximal Corruptions., , , and . EUROCRYPT (1), volume 9665 of Lecture Notes in Computer Science, page 58-86. Springer, (2016)Overdrive: Making SPDZ Great Again., , and . EUROCRYPT (3), volume 10822 of Lecture Notes in Computer Science, page 158-189. Springer, (2018)Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits., , , , , and . ESORICS, volume 8134 of Lecture Notes in Computer Science, page 1-18. Springer, (2013)Essentially Optimal Robust Secret Sharing with Maximal Corruptions., , , and . IACR Cryptology ePrint Archive, (2015)On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations., , and . IACR Cryptology ePrint Archive, (2011)