Claude Crepeau, Daniel Gottesman, Adam Smith  Home/Search
Context Related
Links: ACM DBLP | mit.edu/~cis/pubs/...Sstoc02final.ps crypto.cs.mcgill.ca/~crepeau...stocH.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~cis/cispublications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n=4 cheating parties (out of n). This is shown to be... (Update)
Cited by: More
Formale Sicherheit in der Quantenkryptologie - Formal Security In (Correct)
Secure Multi-party Computation for selecting a solution according .. - Silaghi (2004) (Correct)
Quantum Computation and Privacy - Wehner (2004) (Correct)
Similar documents (at the sentence level):
37.3%: Multi-party Quantum Computation - Smith (2001) (Correct)
35.7%: Secure Multi-party Quantum Computation - Crepeau, Gottesman, Smith (2002) (Correct)
Active bibliography (related documents): More All
0.5: Fault-Tolerant Quantum Computation With Constant Error - Aharonov, Ben-Or (1997) (Correct)
0.4: The Round Complexity of Verifiable Secret Sharing.. - Gennaro, Ishai.. (2001) (Correct)
0.3: On 2-Round Secure Multiparty Computation - Gennaro, Ishai, Kushilevitz, Rabin (2002) (Correct)
Similar documents based on text: More All
0.6: Player Simulation and General Adversary Structures in Perfect.. - Hirt, Maurer (2000) (Correct)
0.5: Multiparty computation unconditionally secure against Q² .. - Smith, Stiglic (1998) (Correct)
0.5: Mix and Match: Secure Function Evaluation via Ciphertexts.. - Jakobsson, Juels (2000) (Correct)
Related documents from co-citation: More All
3: Department of Electrical Engineering and Computer Science (context) - Smith, of et al. - 1997
3: Quantum Complexity Theory (context) - Bersntein, Vazarini - 1997
3: Universally composable security: A new paradigm for cryptographic protocols - Canetti - 2001
BibTeX entry: (Update)
C. Crepeau, D. Gottesman, and A. Smith. Secure multi-party quantum computation. In Proceedings of 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002. http://citeseer.ist.psu.edu/article/crepeau02secure.html More
@inproceedings{ cgs02,
author = {Claude Cr{\'e}peau and Daniel Gottesman and Adam
Smith},
title = {Secure Multi-party Quantum Computation},
booktitle = {34th {ACM} Symposium on the Theory of Computing
(STOC)},
pages = {643--652},
year = 2002,
url = {citeseer.ist.psu.edu/article/crepeau02secure.html} }
Citations (may not include all citations):287 Multiparty unconditionally secure protocols (context) - Chaum, Cr et al. ACM
189 Universally composable security: A new paradigm for cryptogr.. - Canetti - 2001 DBLP
177 Completeness theorems for non-cryptographic fault-tolerant d.. (context) - Ben-Or, Goldwasser et al.
167 Quantum Computation and Quantum Information (context) - Nielsen, Chuang - 2000 ACM
140 How to play any mental game or a completeness theorem for pr.. (context) - Goldreich, Micali et al. - 1987 DBLP
120 Secure computation (context) - Micali, Rogaway
98 Fair computation of general functions in presence of immoral.. (context) - Goldwasser, Levin - 1991 ACM DBLP
78 Foundations of secure interactive computing (context) - Beaver ACM DBLP
36 A theory of quantum error-correcting codes - Knill, amme - 1997
33 Fault tolerant quantum computation with constant error rate - Aharonov, Ben-Or - 1999
24 Veri able secret sharing and multiparty protocols with hones.. (context) - Rabin, Ben-Or - 1989
22 Composition and integrity preservation of secure reactive sy.. (context) - tzmann, Waidner - 2000 ACM DBLP
21 Multiparty protocols tolerating half faulty processors (context) - Beaver - 1990
11 Veri able secret sharing and achieving simultaneity in the p.. (context) - Chor, Goldwasser et al. - 1985
11 Springer-Verlag (context) - Feigenbaum, Proc et al. - 1992
9 Unconditional security of quantum key distribution over arbi.. (context) - Lo, Chau - 1999
3 Quantum-classical complexitysecurity tradeo in secure multi.. (context) - Chau - 2000
3 th STOC (context) - of - 1988
3 Ecient multiparty computations with dishonest minority (context) - Cramer, Damg et al. - 1999
2 How to share a quantum secret (context) - Cleve, Gottesman et al. - 1999
2 Multi-party quantum computation - Smith - 2001
2 Unpublished work (context) - Gottesman, Bennett - 1998
Documents on the same site (http://theory.lcs.mit.edu/~cis/cis-publications.html): More
"Pseudo-Random" Number Generation within.. - Bellare, Goldwasser, .. (1997) (Correct)
Can We Eliminate Certificate Revocation Lists? - Rivest (1998) (Correct)
The Shortest Vector in a Lattice is Hard to Approximate to.. - Micciancio (1998) (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