Fetching the paper…
Reading the bibliography…
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks.
Equivalence between two flavours of oblivious transfers
Claude Crépeau · 1987
Earlier work this paper cites.
Founding cryptography on oblivious transfer
Joe Kilian · 1988
Earlier work this paper cites.
Is quantum bit commitment really possible?
Hong-Kwong Lo and H. F. Chau · 1997
Earlier work this paper cites.
Insecurity of quantum secure computations
Hong-Kwong Lo · 1997
Earlier work this paper cites.
Unconditionally secure quantum bit commitment is impossible
Dominic Mayers · 1997
Earlier work this paper cites.
Quantum bit commitment from a physical assumption
Louis Salvail · 1998
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Earlier work this paper cites.
Proof of security of quantum key distribution with two-way classical communications
Daniel Gottesman and Hoi-Kwong Lo · 2003
Earlier work this paper cites.
Quantum coin-flipping
A. Kitaev · 2003
Earlier work this paper cites.
General security definition and composability for quantum and classical protocols, September 2004
Michael Ben-Or and Dominic Mayers · 2004
Cited alongside, same era.
Foundations of Cryptography
Oded Goldreich · 2004
Cited alongside, same era.
Simulatable security for quantum protocols
Dominique Unruh · 2004
Cited alongside, same era.
Secure multiparty quantum computation with (only) a strict honest majority
Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, and Adam Smith · 2005
Cited alongside, same era.
The universal composable security of quantum key distribution
Michael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, and Jonathan Oppenheim · 2005
Cited alongside, same era.
Cryptography in the bounded quantum-storage model
Ivan B. Damgård, Serge Fehr, Louis Salvail, and Christian Schaffner · 2005
Cited alongside, same era.
Information-theoretic conditions for two-party secure function evaluation
Claude Crépeau, George Savvides, Christian Schaffner, and Jürg Wullschleger · 2006
Later among the works it cites.
A tight high-order entropic quantum uncertainty relation with applications
Ivan B. Damgård, Serge Fehr, Renato Renner, Louis Salvail, and Christian Schaffner · 2007
Later among the works it cites.
Secure identification and QKD in the bounded-quantum-storage model
Ivan B. Damgård, Serge Fehr, Louis Salvail, and Christian Schaffner · 2007
Later among the works it cites.
Small accessible quantum information does not imply security
Robert Koenig, Renato Renner, Andor Bariska, and Ueli Maurer · 2007
Later among the works it cites.
Practical cryptography from noisy photonic storage
Stephanie Wehner, Christian Schaffner, and Barbara Terhal · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Security of Quantum Key Distribution
Renato Renner · 2005
Cited alongside, same era.
Universally composable privacy amplification against quantum adversaries
Renato Renner and Robert König · 2005
Cited alongside, same era.
Statistical security conditions for two-party secure function evaluation
Claude Crépeau and Jürg Wullschleger · 2008
Closest in time.
Cryptography in the bounded-quantum-storage model
Ivan B. Damgård, Serge Fehr, Louis Salvail, and Christian Schaffner · 2008
Closest in time.
Composable security in the bounded-quantum-storage model
Stephanie Wehner and Jürg Wullschleger · 2008
Closest in time.