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

Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum

Kazuma Ohara, Kazuo Ohta, Koutarou Suzuki, Kazuki Yoneyama

Published Jan 1, 2014• 2 citations
Publisher
DOI
10.1007/978-3-319-06734-6_18

Related papers

Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security

Chao Ning, Qiuliang Xu

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

Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions

Sandro Coretti, Juan A. Garay, Martin Hirt +1 more

Lecture notes in computer science•Jan 1, 2016•43 citations

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

Arpita Patra, Divya Ravi

Journal of Cryptology•Jun 29, 2023•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•8 citations

Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation

Ivan Damgård, Matthias Fitzi, Eike Kiltz +2 more

Lecture notes in computer science•Jan 1, 2006•459 citations

On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation

Arpita Patra, Divya Ravi, Swati Singla

Lecture notes in computer science•Jan 1, 2020•1 citation