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 and Communication-Efficient Multiparty Computation

Michele Ciampi, Rafail Ostrovsky, Hendrik Waldner, Vassilis Zikas

Published Jan 1, 2022• 8 citations
Publisher
DOI
10.1007/978-3-031-06944-4_3

Related papers

Round-Optimal Secure Multiparty Computation with Honest Majority

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel +1 more

Lecture notes in computer science•Jan 1, 2018•47 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

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

Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

Lecture notes in computer science•Jan 1, 2025•2 citations

Round Efficient Unconditionally Secure Multiparty Computation Protocol

Arpita Patra, Ashish Choudhary, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2008•12 citations

On 2-Round Secure Multiparty Computation

Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz Z +1 more

Lecture notes in computer science•Jan 1, 2002•70 citations