Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Round-Optimal Secure Multiparty Computation with Honest Majority

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain

Published Jan 1, 2018• 47 citations
Publisher
DOI
10.1007/978-3-319-96881-0_14

Related papers

Round Optimal Secure Multiparty Computation from Minimal Assumptions

Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal +2 more

Lecture notes in computer science•Jan 1, 2020•5 citations

A New Approach to Round-Optimal Secure Multiparty Computation

Prabhanjan Ananth, Arka Rai Choudhuri, Abhishek Jain

Lecture notes in computer science•Jan 1, 2017•47 citations

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds

Amos Beimel, Yehuda Lindell, Eran Omri +1 more

Lecture notes in computer science•Jan 1, 2011•58 citations

Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security

Benny Applebaum, Eliran Kachlon, Arpita Patra

Lecture notes in computer science•Jan 1, 2022•6 citations

Optimizing secure multiparty computation protocols for dishonest majority

Dragos Rotaru

•Jan 1, 2020•0 citations

Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation

Arpita Patra, Divya Ravi

Lecture notes in computer science•Jan 1, 2019•9 citations