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-Round Asynchronous Multi-Party Computation Based on One-Way Functions

Sandro Coretti, Juan A. Garay, Martin Hirt, Vassilis Zikas

Published Jan 1, 2016• 43 citations
Publisher
DOI
10.1007/978-3-662-53890-6_33

Related papers

Constant-Round Asynchronous Multi-Party Computation.

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

•Jan 1, 2016•1 citation

Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback

Giovanni Deligios, Martin Hirt, Chen-Da Liu-Zhang

Lecture notes in computer science•Jan 1, 2021•31 citations

Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol

Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto

Lecture notes in computer science•Jan 1, 2014•24 citations

Mercury: Constant-Round Protocols for Multi-Party Computation with Rationals

Luke Harmon, Gaetan Delavignette

Lecture notes in computer science•Jan 1, 2023•0 citations

Constant Round Non-Malleable Protocols using One Way Functions.

Vipul Goyal

We provide the first constant round constructions of non-malleable commitment and zero-knowledge protocols based only on one-way functions. This improves upon several previous (incomparable) works which required either: (a) super-constant number of rounds, or, (b) non-standard or sub-exponential hardness assumptions, or, (c) non-black-box simulation and collision resistant hash functions. These constructions also allow us to obtain the first constant round multi-party computation protocol relying only on the existence of constant round oblivious transfer protocols. Our primary technique can be seen as a means of implementing the previous “two-slot simulation ” idea in the area of non-malleability with only black-box simulation. A simple modification of our commitment scheme gives a construction which makes use of the underlying one-way function in a black-box way. The modified construction satisfies the notion of what we call nonmalleability w.r.t. replacement. Non-malleability w.r.t. replacement is a slightly weaker yet natural notion of non-malleability which we believe suffices for many application of non-malleable commitments. We show that a commitment scheme which is non-malleable only w.r.t. replacement is sufficient to obtain a (fully) black-box multi-party computation protocol. This allows us to obtain a constant round multi-party computation protocol making only a black-box use of the standard cryptographic primitives with polynomial-time hardness thus directly improving upon the recent work of Wee (FOCS’10). 0 1

•Jan 1, 2010•0 citations

Adaptively Secure UC Constant Round Multi-Party Computation Protocols.

Ivan Damgård, Antigoni Polychroniadou, Vanishree Rao

•Jan 1, 2014•5 citations
We provide the first constant round constructions of non-malleable commitment and zero-knowledge protocols based only on one-way functions. This improves upon several previous (incomparable) works which required either: (a) super-constant number of rounds, or, (b) non-standard or sub-exponential hardness assumptions, or, (c) non-black-box simulation and collision resistant hash functions. These constructions also allow us to obtain the first constant round multi-party computation protocol relying only on the existence of constant round oblivious transfer protocols. Our primary technique can be seen as a means of implementing the previous “two-slot simulation ” idea in the area of non-malleability with only black-box simulation. A simple modification of our commitment scheme gives a construction which makes use of the underlying one-way function in a black-box way. The modified construction satisfies the notion of what we call nonmalleability w.r.t. replacement. Non-malleability w.r.t. replacement is a slightly weaker yet natural notion of non-malleability which we believe suffices for many application of non-malleable commitments. We show that a commitment scheme which is non-malleable only w.r.t. replacement is sufficient to obtain a (fully) black-box multi-party computation protocol. This allows us to obtain a constant round multi-party computation protocol making only a black-box use of the standard cryptographic primitives with polynomial-time hardness thus directly improving upon the recent work of Wee (FOCS’10). 0 1