Fetching the paper…
Reading the bibliography…
A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other's input than what is implied by the value of the function.
Zur theorie der gesellschaftsspiele
J. v. Neumann · 1928
Earlier work this paper cites.
Rep. Math. Phys
A. Uhlmann · 1976
Earlier work this paper cites.
Quantum cryptography: Public-key distribution and coin tossing
C. H. Bennett and G. Brassard · 1984
Earlier work this paper cites.
Quantum cryptography based on Bell’s theorem
A. K. Ekert · 1991
Earlier work this paper cites.
Studies in Secure Multiparty Computation and Applications
Ran Canetti · 1996
Earlier work this paper cites.
Is quantum bit commitment really possible?
H-K. Lo and H.F. Chau · 1997
Earlier work this paper cites.
Insecurity of quantum secure computations
Hoi-Kwong Lo · 1997
Earlier work this paper cites.
Unconditionally secure quantum bit commitment is impossible
D. Mayers · 1997
Cited alongside, same era.
Security and composition of multiparty cryptographic protocols
Ran Canetti · 2000
Cited alongside, same era.
General Security Definition and Composability for Quantum and Classical Protocols
M. Ben-Or and D. Mayers · 2004
Cited alongside, same era.
Foundations of Cryptography
Oded Goldreich · 2004
Cited alongside, same era.
Simulatable security for quantum protocols, 2004
D. Unruh · 2004
Cited alongside, same era.
Impossibility of secure two-party classical computation
Roger Colbeck · 2007
Cited alongside, same era.
Reexamination of quantum bit commitment: The possible and the impossible
G. M. D’Ariano, D. Kretschmann, D. Schlingemann, and R. F. Werner · 2007
Later among the works it cites.
Quantum weak coin flipping with arbitrarily small bias, 2007
Carlos Mochon · 2007
Later among the works it cites.
Post-selection technique for quantum channels with applications to quantum cryptography
M. Christandl, R. König, and R. Renner · 2009
Later among the works it cites.
Composing quantum protocols in a classical environment
Serge Fehr 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.
Universally composable quantum multi-party computation
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dominique Unruh · 2010
Later among the works it cites.