(Enter summary)
Abstract: 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 slightly 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... (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):
47.2%: Secure Multi-party Quantum Computation - Crepeau, Gottesman, Smith (2002)
(Correct)
23.4%: Multi-party Quantum Computation - Smith (2001)
(Correct)
Active bibliography (related documents): More All
0.1: Approximate Quantum Error-Correcting Codes - Crepeau, Gottesman, Smith
(Correct)
0.0: On Adaptive Vs. Non-Adaptive Security of Multiparty.. - Canetti, Damgaard.. (2001)
(Correct)
0.0: On the Power of Quantum Computation - Vazirani (1998)
(Correct)
Similar documents based on text: More All
0.8: Authentication of Quantum Messages - Barnum, Crépeau, Gottesman, Smith.. (2002)
(Correct)
0.4: Multiparty computation unconditionally secure against Q² .. - Smith, Stiglic (1998)
(Correct)
0.3: Player Simulation and General Adversary Structures in Perfect.. - Hirt, Maurer (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/crepeau02secure.html More
@misc{ crepeau02secure,
author = "C. Crepeau and D. Gottesman and A. Smith",
title = "Secure multi-party quantum computation",
text = "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.",
year = "2002",
url = "citeseer.ist.psu.edu/crepeau02secure.html" }
Citations (may not include all citations):
179
Security and composition of multiparty cryptographic protoco..
- Canetti - 2000
177
Completeness theorems for non-cryptographic fault-tolerant d.. (context) - Ben-Or, Goldwasser et al.
78
Foundations of secure interactive computing (context) - Beaver
33
Fault tolerant quantum computation with constant error rate
- Aharonov, Ben-Or - 1999
33
Fault tolerant quantum computation with constant error
- Aharonov, Ben-Or - 1997
21
Multiparty protocols tolerating half faulty processors (context) - Beaver - 1990
19
A unified framework for analyzing security of protocols (context) - Canetti - 2000
Documents on the same site (http://www.cs.mcgill.ca/~crepeau/proceedings.html): More
A zero-knowledge Poker protocol that achieves confidentiality of.. - Crépeau (1986)
(Correct)
Weakening Security Assumptions and Oblivious Transfer - Crépeau, al.
(Correct)
Computationally convincing proofs of knowledge.. - Brassard, Crépeau..
(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