Fetching the paper…
Reading the bibliography…
We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of classical semi-honest adversaries that we call specious.
How to generate and exchange secrets
Andrew Yao · 1986
Earlier work this paper cites.
Founding cryptography on oblivious transfer
Joe Kilian · 1988
Earlier work this paper cites.
Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels
Charles H. Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres, and William K. Wootters · 1993
Earlier work this paper cites.
Quantum nonlocality as an axiom
Sandu Popescu and Daniel Rohrlich · 1994
Earlier work this paper cites.
Fault-tolerant quantum computation
Peter W. Shor · 1996
Earlier work this paper cites.
Physical Review Letters
1997
Earlier work this paper cites.
Fault-tolerant quantum computation with constant error
D. Aharonov and M. Ben-Or · 1997
Earlier work this paper cites.
Insecurity of quantum secure computations
Hoi-Kwong Lo · 1997
Earlier work this paper cites.
Causality and nonlocality as axioms for quantum mechanics
Sandu Popescu and Daniel Rohrlich · 1997
Cited alongside, same era.
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
Daniel Gottesman and Isaac L. Chuang · 1999
Cited alongside, same era.
Quantum teleportation is a universal computational primitive
Daniel Gottesman and Isaac L. Chuang · 1999
Cited alongside, same era.
Private quantum channels
Andris Ambainis, Michele Mosca, Alain Tapp, and Ronald de Wolf · 2000
Cited alongside, same era.
Security and composition of multiparty cryptographic protocols
Ran Canetti · 2000
Cited alongside, same era.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Cited alongside, same era.
Quantum interactive proofs with competing provers
G. Gutoski and J. Watrous · 2005
Later among the works it cites.
Universally composable privacy amplification against quantum adversaries
Renato Renner and Robert König · 2005
Later among the works it cites.
Oblivious transfer and quantum non-locality
Stefan Wolf and Jürg Wullschleger · 2005
Later among the works it cites.
Secure multiparty quantum computation with (only) a strict honest majority
Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, and Adam Smith · 2006
Later among the works it cites.
Techniques for secure distributed computing with quantum data
Adam Smith · 2006
Later among the works it cites.
Universal blind quantum computation, December 2009
Anne Broadbent, Joseph Fitzsimons, and Elham Kashefi · 2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Secure multi-party quantum computation
Claude Crépeau, Daniel Gottesman, and Adam Smith · 2002
Cited alongside, same era.
Limits on the power of quantum statistical zero-knowledge
John Watrous · 2002
Cited alongside, same era.
Is quantum bit commitment really possible?
Hoi-Kwong Lo and Hoi Fung Chau
Cited in the paper.
Unconditionally secure quantum bit commitment is impossible
Dominic Mayers
Cited in the paper.
Later among the works it cites.
Improving the security of quantum protocols via commit-and-open
Ivan B. Damgård, Serge Fehr, Carolin Lunemann, Louis Salvail, and Christian Schaffner · 2009
Later among the works it cites.
On the power of two-party quantum cryptography
Louis Salvail, Miroslava Sotáková, and Christian Schaffner · 2009
Later among the works it cites.