See this document in CiteSeerX!

The Match-making Problem (1995)  (Make Corrections)  (1 citation)
Jeroen van de Graaf



  Home/Search   Context   Related

 
View or download:
cenapad.ufmg.br/~jvdg/ps/G95.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cenapad.ufmg.br/~jvdg/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . This paper discusses a cryptographic protocol to evaluate an and-gate such that a party can keep his input bit secret from the other party. Such a protocol is of interest, because it can be generalized to any logical circuit for any number of participants. A formal statement of this generalization reads as follows: n participants want to compute together a function f(x1 ; x2 ; :::; xn) with x i being their inputs; nobody wants to reveal information about his input except what can be... (Update)

Context of citations to this paper:   More

...More on this subject later. Since 1985 several protocols for MPC have appeared in the literature, for an overview with references, see [GR95] or [FR93] But even though many protocols have been presented in these papers, hardly any of these papers contains a rigorous proof of...

Cited by:   More
Towards a Formal Definition of Security for Quantum Protocols - Graaf (1997)   (Correct)

Similar documents (at the sentence level):
68.1%:   The Match-making Problem - Graaf (1995)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Cryptographic Primitives and Quantum Theory - Crépeau (1993)   (Correct)
0.5:   Oblivious Transfers and Intersecting Codes - Brassard, Crepeau, Santha (1996)   (Correct)
0.5:   Use of Correctness Assertions in Declarative Diagnosis of Logic.. - Lu   (Correct)

Similar documents based on text:   More   All
0.1:   A Debugging Environment for Lazy Functional Languages - Lapalme, al. (1999)   (Correct)
0.1:   Quantum Amplitude Amplification and Estimation - Brassard, Høyer, Mosca, .. (2000)   (Correct)
0.1:   Kernel Matching Pursuit - Vincent, Bengio (2000)   (Correct)

Related documents from co-citation:   More   All
2:   The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1985

BibTeX entry:   (Update)

VAN DE GRAAF, J., "The matchmaking problem", CWI Quarterly 8, 2 (1995), pp. 129--146. 126 http://citeseer.ist.psu.edu/article/vandegraaf95matchmaking.html   More

@misc{ graaf95matchmaking,
  author = "V. GRAAF",
  title = "The matchmaking problem",
  text = "VAN DE GRAAF, J., The matchmaking problem, CWI Quarterly 8, 2 (1995), pp.
    129--146. 126",
  year = "1995",
  url = "citeseer.ist.psu.edu/article/vandegraaf95matchmaking.html" }
Citations (may not include all citations):
531   The knowledge complexity of interactive proof-systems (context) - Goldwasser, Micali et al. - 1985
287   Multi-party unconditionally secure protocols (context) - Chaum, Crepeau et al. - 1988
278   Probabilistic encryption (context) - Goldwasser, Micali - 1984
250   How to play any mental game (context) - Goldreich, Micali et al. - 1987
206   Zero knowledge proofs of identity (context) - Feige, Fiat et al. - 1988
174   How to exchange secrets by oblivious transfer (context) - Rabin - 1981
167   Protocols for secure computations (context) - Chi-Chih - 1982
127   Verifiable secret sharing and multiparty protocols with hone.. (context) - Rabin, Ben-Or - 1989
120   Secure computation (context) - Micali, Rogaway - 1992
110   Proofs that yield nothing but their validity and a methodolo.. (context) - Goldreich, Micali et al. - 1986
100   Founding cryptography on oblivious transfer (context) - Kilian - 1988
98   Fair computation of general functions in presence of immoral.. (context) - Goldwasser, Levin - 1991
90   Secure multiparty protocols and zero-knowledge proof systems.. (context) - Beaver - 1991
78   Foundations of secure interactive computing (context) - Beaver - 1992
54   A robust and verifiable cryptographically secure election sc.. (context) - Cohen, Fischer - 1985
52   Multiparty computations ensuring privacy of each party's inp.. (context) - Damgard, Chaum et al. - 1988
42   Practical quantum oblivious transfer - Bennett, Brassard et al.
41   Nontransitive transfer of confidence: A perfect zeroknowledg.. - Brassard, Cr'epeau - 1986
32   Coin flipping by telephone (context) - Blum - 1982
30   How to solve any protocol problem - an efficiency improvemen.. - Goldreich, Vainish
27   Uses of Randomness In Algorithms and Protocols (context) - Kilian - 1990
27   Zero-knowledge simulation of boolean circuits - Brassard, Cr'epeau - 1987
23   Controlled gradual disclosure schemes for random bits and th.. (context) - Cleve - 1990
22   Mental poker (context) - Shamir, Rivest et al. - 1981
22   Demonstrating that a public predicate can be satisfied witho.. (context) - Chaum - 1987
21   Multiparty protocols tolerating half faulty processors (context) - Beaver - 1990
19   How to simultaneously exchange a secret bit by flipping a sy.. (context) - Luby, Micali et al. - 1983
18   Committed oblivious transfer and private multi-party computa.. (context) - Cr'epeau, Graaf et al. - 1995
16   A simple and secure way to show the validity of your public .. (context) - Graaf, Peralta - 1988
10   Completeness theorems for faulttolerant distributed computin.. (context) - Ben-Or, Goldwasser et al. - 1988
10   A zero-knowledge poker protocol that achieves confidentialit.. (context) - Cr'epeau - 1987
10   Computer Science Department (context) - Franklin, Security et al. - 1993
6   Cryptographic computation: Secure fauttolerant protocols and.. (context) - Galil, Haber et al. - 1988
5   Weakening security assumptions and oblivious transfer (context) - Cr'epeau, Kilian - 1988
4   Oblivious verification of common string (context) - Cr'epeau, Salvail - 1995
3   Will robots inherit the earth (context) - Minsky - 1994
3   Verifiable disclosure of secrets and applications (context) - Cr'epeau - 1990
1   Noisy channel and cryptographic protocols (context) - Cr'epeau - 1995

Documents on the same site (http://www.cenapad.ufmg.br/~jvdg/):
Towards a Formal Definition of Security for Quantum Protocols - Graaf (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC