How to play ANY mental game

Goldreich, Oded; Micali, Silvio; Wigderson, Avi

doi:10.1145/28395.28420

Cited by 2,763 publications

(1,081 citation statements)

References 10 publications

Supporting

Mentioning

1,079

Contrasting

Unclassified

Order By: Relevance

“…Both frameworks have composition theorems, and are based on older definitional work. The initial ideal-model based definitional approach for secure function evaluation is informally proposed by Goldreich, Micali, and Wigderson in [22]. The first formalizations appear in Goldwasser and Levin [24], Micali and Rogaway [34], and Beaver [5].…”

Section: Previous Workmentioning

confidence: 99%

A Sender Verifiable Mix-Net and a New Proof of a Shuffle

Wikström

2005

Lecture Notes in Computer Science

164

View full text Add to dashboard Cite

Abstract. We introduce the first El Gamal based mix-net in which each mix-server partially decrypts and permutes its input, i.e., no reencryption is necessary. An interesting property of the construction is that a sender can verify non-interactively that its message is processed correctly. We call this sender verifiability. The mix-net is provably UC-secure against static adversaries corrupting any minority of the mix-servers. The result holds under the decision Diffie-Hellman assumption, and assuming an ideal bulletin board and an ideal zero-knowledge proof of knowledge of a correct shuffle. Then we construct the first proof of a decryption-permutation shuffle, and show how this can be transformed into a zero-knowledge proof of knowledge in the UC-framework. The protocol is sound under the strong RSA-assumption and the discrete logarithm assumption. Our proof of a shuffle is not a variation of existing methods. It is based on a novel idea of independent interest, and we argue that it is at least as efficient as previous constructions.

show abstract

Section: Previous Workmentioning

confidence: 99%

A Sender Verifiable Mix-Net and a New Proof of a Shuffle

Wikström

2005

Lecture Notes in Computer Science

164

View full text Add to dashboard Cite

show abstract

“…Oblivious transfer, and consequently ANDOS, can be based on various assumptions like the existence of trapdoor functions [16], of noisy channels [12] or of quantum channels [3]. From a practical point of view, efficient implementation can be based on the quadratic residuosity problem [7,25] or on the Diffie-Hellman assumption [1,23].…”

Section: All-or Nothing Disclosure Of Secrets Protocolsmentioning

confidence: 99%

“…At the moment, let us stress that we do not develop a general two-party computation protocol but just an efficient scheme suitable to the generation of shared RSA keys. Consequently we need weaker notions of privacy and correctness than those described in more general papers [2,8,16,26].…”

Section: Efficient Two-party Evaluation Of Algebraic Expressionsmentioning

confidence: 99%

“…In 1986, Yao [26] proved the existence of secure two-party protocols assuming the computational intractability of factoring large integers. Goldreich, Micali and Wigderson [16] generalized this result and showed that trapdoor functions enable to evaluate any function whose inputs are privately owned by the parties, provided a majority of them is honest. The next year, Ben-Or, Goldwasser and Wigderson [2] and independently Chaum, Crépeau and Damgård [8] solved the same problem under an information-theoretic approach.…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

Generation of Shared RSA Keys by Two Parties

Poupard

Stern

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. At Crypto'97 Boneh and Franklin proposed a protocol to efficiently generate shared RSA keys. In the case of two parties, the drawback of their scheme is the need of an independent third party. Furthermore, the security is guaranteed only if the three players follow the protocol. In this paper, we propose a protocol that enables two parties to evaluate any algebraic expression, including an RSA modulus, along the same lines as in the Boneh-Franklin protocol. Our solution does not need the help of a third party and the only assumption we make is the existence of an oblivious transfer protocol. Furthermore, it remains robust even if one of the two players deviates from the protocol.

show abstract

“…A number of cooperative computation problems have been shown to be plausible, in a secure way, using multi party computational techniques [2,5]. Generic solutions have been developed [3,8] and much effort has been directed towards reducing the communication complexity [7] and round complexity [6] of these solutions.…”

Section: Introductionmentioning

confidence: 99%

Secure Two-Party Context Free Language Recognition

Singh

Barman

Shukla

2005

Distributed Computing and Internet Technology

View full text Add to dashboard Cite

Abstract. The growth of the internet provides opportunities for cooperative computation, it also requires development of protocols that can accomplish this task among mutually untrusting parties. The aim is to develop methods which ensure both the correct evaluation of the function and privacy of individual inputs. Multiparty Computation protocols help to achieve the aim without using a trusted third party.In this paper we consider the problem of context-free language recognition in a two-party setting. Alice has the description of a context-free language L while Bob has a secret string whose membership in L is to be checked. Neither Alice nor Bob is ready to disclose his/her input to the other. Here we propose a protocol which accomplishes secure two party context-free language recognition. The novelty of this paper lies in the use of formal languages based approach for multiparty computations.

show abstract

How to play ANY mental game

Cited by 2,763 publications

References 10 publications

A Sender Verifiable Mix-Net and a New Proof of a Shuffle

A Sender Verifiable Mix-Net and a New Proof of a Shuffle

Generation of Shared RSA Keys by Two Parties

Secure Two-Party Context Free Language Recognition

Contact Info

Product

Resources

About