Constructing Non-malleable Commitments: A Black-Box Approach

Goyal, Vipul; Lee, Chen-Kuei; Ostrovsky, Rafail; Visconti, Ivan

doi:10.1109/focs.2012.47

Cited by 70 publications

(19 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To overcome this problem, we use the commitment scheme wExtCom that was introduced by Goyal et al [13]. The commit phase of wExtCom consists of three stages: commit, challenge, and reply.…”

Section: Building Block 1: Concurrently Extractable Commitment Schemementioning

confidence: 99%

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

Kiyoshima¹

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present a round-efficient black-box construction of a general MPC protocol that satisfies composability in the plain model. The security of our protocol is proven in angel-based UC framework under the minimal assumption of the existence of semi-honest oblivious transfer protocols. When the round complexity of the underlying oblivious transfer protocol is rot(n), the round complexity of our protocol is max(O(log 2 n), O(rot(n))). Since constant-round semi-honest oblivious transfer protocols can be constructed under standard assumptions (such as the existence of enhanced trapdoor permutations), our result gives O(log 2 n)-round protocol under these assumptions. Previously, only an O(max(n , rot(n)))-round protocol was shown, where > 0 is an arbitrary constant. We obtain our MPC protocol by constructing a O(log 2 n)-round CCAsecure commitment scheme in a black-box way under the assumption of the existence of one-way functions.

show abstract

“…To overcome this problem, we use the commitment scheme wExtCom that was introduced by Goyal et al [13]. The commit phase of wExtCom consists of three stages: commit, challenge, and reply.…”

Section: Building Block 1: Concurrently Extractable Commitment Schemementioning

confidence: 99%

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

Kiyoshima¹

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…An interesting question is which type of SOA security can be achieved also against man-in-the-middle attacks. The recent work of [12] gives hope towards a construction of a constant-round non-malleable SOA-secure protocol with blackbox simulation and black-box use of any one-way function.…”

Section: Selective Opening Adaptive Security Trapdoor Commitments Amentioning

confidence: 99%

Revisiting Lower and Upper Bounds for Selective Decommitments

Ostrovsky

Rao²,

Scafuro

et al. 2013

Theory of Cryptography

Self Cite

View full text Add to dashboard Cite

In [6,7], Dwork et al. posed the fundamental question of existence of commitment schemes that are secure against selective opening attacks (SOA, for short). In [2] Bellare, Hofheinz, and Yilek, and Hofheinz in [13] answered it affirmatively by presenting a scheme which is based solely on the non-black-box use of a one-way permutation needing a super-constant number of rounds. This result however opened other challenging questions about achieving a better round complexity and obtaining fully black-box schemes using underlying primitives and code of the adversary in a black-box manner. Recently, in TCC 2011, Xiao ([23]) investigated on how to achieve (nearly) optimal SOA-secure commitment schemes where optimality is in the sense of both the round complexity and the black-box use of cryptographic primitives. The work of Xiao focuses on a simulation-based security notion of SOA. Moreover, the various results in [23] focus only on either parallel or concurrent SOA. In this work we first point out various issues in the claims of [23] that actually reopen several of the questions left open in [2,13]. Then, we provide new lower bounds and concrete constructions that produce a very different state-of-the-art compared to the one claimed in [23].

show abstract

“…Further results of Goyal [Goy11] and Goyal et al [GLOV12] relied on better assumptions but with a round complexity still far from optimal. A very recent work of Garg et al [GMPP16b] makes a long jump ahead towards fully understanding the round complexity of secure MPCT.…”

Section: Introductionmentioning

confidence: 99%

Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds

Ciampi

Ostrovsky

Siniscalchi

et al. 2017

Theory of Cryptography

Self Cite

View full text Add to dashboard Cite

In this work we start from the following two results in the state-of-the art: 1. 4-round non-malleable zero knowledge (NMZK): Goyal et al. in FOCS 2014 showed the first 4-round one-one NMZK argument from one-way functions (OWFs). Their construction requires the prover to know the instance and the witness already at the 2nd round. 2. 4-round multi-party coin tossing (MPCT): Garg et al. in Eurocrypt 2016 showed the first 4-round protocol for MPCT. Their result crucially relies on 3-round 3-robust parallel non-malleable commitments. So far there is no candidate construction for such a commitment scheme under standard polynomial-time hardness assumptions. We improve the state-of-the art on NMZK and MPCT by presenting the following two results: 1. a delayed-input 4-round one-many NMZK argument Π NMZK from OWFs; moreover Π NMZK is also a delayed-input many-many synchronous NMZK argument. 2. a 4-round MPCT protocol Π MPCT from one-to-one OWFs; Π MPCT uses Π NMZK as subprotocol and exploits the special properties (e.g., delayed input, many-many synchronous) of Π NMZK . Both Π NMZK and Π MPCT make use of a special proof of knowledge that offers additional security guarantees when played in parallel with other protocols. The new technique behind such a proof of knowledge is an additional contribution of this work and is of independent interest.

show abstract

Constructing Non-malleable Commitments: A Black-Box Approach

Cited by 70 publications

References 44 publications

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

Revisiting Lower and Upper Bounds for Selective Decommitments

Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds

Contact Info

Product

Resources

About