Fetching the paper…
Reading the bibliography…
Oblivious transfer is a fundamental primitive in cryptography.
Coin flipping by telephone
M. Blum · 1981
Earlier work this paper cites.
How to exchange secrets by oblivious transfer
M. Rabin · 1981
Earlier work this paper cites.
A randomized protocol for signing contracts
S. Even, O. Goldreich, and A. Lempel · 1982
Earlier work this paper cites.
Quantum cryptography: Public key distribution and coin tossing
C. Bennett and G. Brassard · 1984
Earlier work this paper cites.
Equivalence between two flavours of oblivious transfers
C. Crépeau · 1987
Earlier work this paper cites.
Founding cryptography on oblivious transfer
J. Kilian · 1988
Earlier work this paper cites.
Security of quantum protocols against coherent measurements
A. Yao · 1995
Earlier work this paper cites.
Is quantum bit commitment really possible?
H.-K. Lo and H. Chau · 1997
Earlier work this paper cites.
Insecurity of quantum secure computations
H.-K. Lo · 1997
Earlier work this paper cites.
Unconditionally secure quantum bit commitment is impossible
D. Mayers · 1997
Earlier work this paper cites.
Optimal lower bounds for quantum automata and random access codes
A. Nayak · 1999
Earlier work this paper cites.
Quantum bit escrow
D. Aharonov, A. Ta-Shma, U. Vazirani, and A. Yao · 2000
Earlier work this paper cites.
Quantum computation and quantum information
M. Nielsen and I. Chuang · 2000
Earlier work this paper cites.
Handbook of Semidefinite Programming
H. Wolkowicz, R. Saigal, and L. Vandenberghe, editors · 2000
Cited alongside, same era.
A new protocol and lower bounds for quantum coin flipping
A. Ambainis · 2001
Cited alongside, same era.
Degrees of concealment and bindingness in quantum bit commitment protocols
R. Spekkens and T. Rudolph · 2001
Cited alongside, same era.
Lower bound for a class of weak quantum coin flipping protocols
A. Ambainis · 2002
Cited alongside, same era.
A theorem about relative entropy of quantum states with an application to privacy in quantum communication
R. Jain, J. Radhakrishnan, and P. Sen · 2002
Cited alongside, same era.
Quantum protocol for cheat-sensitive weak coin flipping
R. Spekkens and T. Rudolph · 2002
Cited alongside, same era.
The impossibility of secure two-party classical computation
R. Colbeck · 2007
Later among the works it cites.
A tight high-order entropic quantum uncertainty relation with applications
I. Damgård, S. Fehr, R. Renner, L. Salvail, and C. Schaffner · 2007
Later among the works it cites.
Reexamination of quantum bit commitment: the possible and the impossible
G. D’Ariano, D. Kretschmann, D. Schlingemann, and R. Werner · 2007
Later among the works it cites.
Quantum weak coin flipping with arbitrarily small bias
C. Mochon · 2007
Later among the works it cites.
Cryptography in the bounded quantum-storage model
I. Damgård, S. Fehr, L. Salvail, and C. Schaffner · 2008
Later among the works it cites.
Optimal quantum strong coin flipping
A. Chailloux and I. Kerenidis · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum coin-flipping
A. Kitaev · 2003
Cited alongside, same era.
On bit-commitment based quantum coin flipping
A. Nayak and P. Shor · 2003
Cited alongside, same era.
Multiparty quantum coin flipping
A. Ambainis, H. Buhrman, Y. Dodis, and H. Rohrig · 2004
Cited alongside, same era.
Weak coin flipping with small bias
I. Kerenidis and A. Nayak · 2004
Cited alongside, same era.
A large family of quantum weak coin-flipping protocols
C. Mochon · 2005
Cited alongside, same era.
Oblivious transfer and linear functions
I. Damgård, S. Fehr, L. Salvail, and C. Schaffner · 2006
Cited alongside, same era.
On the power of two-party quantum cryptography
L. Salvail, C. Schaffner, and M. Sotakova · 2009
Later among the works it cites.
Sampling in a quantum population, and applications
N. Bouman and S. Fehr · 2010
Closest in time.
Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model
C. Schaffner · 2010
Closest in time.
Optimal bounds for quantum bit commitment
A. Chailloux and I. Kerenidis · 2011
Closest in time.
Quantum proofs for classical theorems
A. Drucker and R. de Wolf · 2011
Closest in time.
Complete insecurity of quantum protocols for classical two-party computation
H. Buhrman, M. Christandl, and C. Schaffner · 2012
Closest in time.