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 networks and systems

Unconditionally Fast Secure Multi-party Computation with Multi-depths Gates Using Pre-computed Information

Amirreza Hamidi, Hossein Ghodosi

Published Jul 26, 2022• 0 citations
Publisher
DOI
10.1007/978-981-19-1610-6_28

Related papers

Secure Multi-Party Computation Using Pre-distributed Information from an Initializer

Amirreza Hamidi, Hossein Ghodosi

Communications in computer and information science•Jan 1, 2021•0 citations

Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations

Anderson C. A. Nascimento, Joern Mueller-Quade, Akira Otsuka +2 more

Lecture notes in computer science•Jan 1, 2003•8 citations

Optimally-resilient Unconditionally-secure Asynchronous Multi-party Computation Revisited.

Ashish Choudhury

•Jan 1, 2020•4 citations

Efficient Secure Multi-party Computation

Martin Hirt, Ueli M. Maurer, Bartosz Przydatek

Lecture notes in computer science•Jan 1, 2000•128 citations

Brief Announcement: Optimally-Resilient Unconditionally-Secure Asynchronous Multi-Party Computation Revisited

Ashish Choudhury

In this paper, we present an optimally-resilient, unconditionally-secure asynchronous multi-party computation (AMPC) protocol for n parties, tolerating a computationally unbounded adversary, capable of corrupting up to t < n/3 parties. Our protocol needs a communication of 𝒪(n⁴) field elements per multiplication gate. This is to be compared with previous best AMPC protocol (Patra et al, ICITS 2009) in the same setting, which needs a communication of 𝒪(n⁵) field elements per multiplication gate. To design our protocol, we present a simple and highly efficient asynchronous verifiable secret-sharing (AVSS) protocol, which is of independent interest.

Leibniz international proceedings in informatics•Jan 1, 2020•0 citations

Lean and Fast Secure Multi-party Computation: Minimizing Communication and Local Computation using a Helper

Johannes Schneider

International Joint Conference on e-Business and Telecommunications (ICETE)•Jan 1, 2016•6 citations
In this paper, we present an optimally-resilient, unconditionally-secure asynchronous multi-party computation (AMPC) protocol for n parties, tolerating a computationally unbounded adversary, capable of corrupting up to t < n/3 parties. Our protocol needs a communication of 𝒪(n⁴) field elements per multiplication gate. This is to be compared with previous best AMPC protocol (Patra et al, ICITS 2009) in the same setting, which needs a communication of 𝒪(n⁵) field elements per multiplication gate. To design our protocol, we present a simple and highly efficient asynchronous verifiable secret-sharing (AVSS) protocol, which is of independent interest.