Fetching the paper…
Reading the bibliography…
We consider the implementation of two-party cryptographic primitives based on the sole assumption that no large-scale reliable quantum storage is available to the cheating party.
Polynomial Codes Over Certain Finite Fields
I. S. Reed and G. Solomon · 1960
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
W. Uhlmann · 1963
Earlier work this paper cites.
Universal classes of hash functions (extended abstract)
J. L. Carter and M. N. Wegman · 1977
Earlier work this paper cites.
Conjugate coding
S. Wiesner · 1983
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.
Privacy amplification by public discussion
C. H. Bennett, G. Brassard, and J.-M. Robert · 1988
Earlier work this paper cites.
How to solve any protocol problem - an efficiency improvement
O. Goldreich and R. Vainish · 1988
Earlier work this paper cites.
Founding cryptography on oblivious transfer
J. Kilian · 1988
Earlier work this paper cites.
Generalized entropic uncertainty relations
H. Maassen and J. Uffink · 1988
Earlier work this paper cites.
Pseudo-random generation from one-way functions
R. Impagliazzo, L. A. Levin, and M. Luby · 1989
Earlier work this paper cites.
A provably-secure strongly-randomized cipher
U. Maurer · 1990
Earlier work this paper cites.
Fair games against an all-powerful adversary
R. Ostrovsky, R. Venkatesan, and M. Yung · 1991
Earlier work this paper cites.
Practical quantum oblivious transfer
C. H. Bennett, G. Brassard, C. Crépeau, and H. Skubiszewska · 1992
Earlier work this paper cites.
Conditionally-perfect secrecy and a provably-secure randomized cipher
U. Maurer · 1992
Earlier work this paper cites.
Quantum oblivious transfer
C. Crépeau · 1994
Earlier work this paper cites.
Short seed extractors against quantum storage
A. Ta-Shma · 1994
Earlier work this paper cites.
Precomputing oblivious transfer
D. Beaver · 1995
Earlier work this paper cites.
Generalized privacy amplification
C. H. Bennett, G. Brassard, C. Crépeau, and U. Maurer · 1995
Earlier work this paper cites.
Security of quantum protocols against coherent measurements
A. C.-C. Yao · 1995
Earlier work this paper cites.
Why quantum bit commitment and ideal quantum coin tossing are impossible
H-K. Lo and H.F. Chau · 1996
Earlier work this paper cites.
The trouble with quantum bit commitment
D. Mayers · 1996
Earlier work this paper cites.
A sample of samplers: A computational perspective on sampling
O. Goldreich · 1997
Earlier work this paper cites.
Insecurity of quantum secure computations
H-K. Lo · 1997
Earlier work this paper cites.
Is quantum bit commitment really possible?
H-K. Lo and H. F. Chau · 1997
Cited alongside, same era.
Unconditionally secure quantum bit commitment is impossible
D. Mayers · 1997
Cited alongside, same era.
Optimal entropic uncertainty relation in two-dimensional hilbert space
J. Sanchez-Ruiz · 1998
Cited alongside, same era.
Oblivious transfer in the bounded storage model
Y.Z. Ding · 2001
Cited alongside, same era.
On tolerant cryptographic constructions
A. Herzberg · 2002
Cited alongside, same era.
Additivity for unital qubit channels
C. King · 2002
Cited alongside, same era.
Recent developments in explicit constructions of extractors
Cryptography from noisy photonic storage
S. Wehner, C. Schaffner, and B. Terhal · 2007
Later among the works it cites.
State discrimination with post-measurement information
M. Ballester, S. Wehner, and A. Winter · 2008
Later among the works it cites.
Composing quantum protocols in a classical environment
S. Fehr and C. Schaffner · 2008
Later among the works it cites.
Personal communication
A. Kalev and S. Wehner · 2008
Later among the works it cites.
The bounded-storage model in the presence of a quantum adversary
R. König and B. Terhal · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Shaltiel · 2002
Cited alongside, same era.
The capacity of the quantum depolarizing channel
C. King · 2003
Cited alongside, same era.
On constructing locally computable extractors and cryptosystems in the bounded storage model
S. Vadhan · 2003
Cited alongside, same era.
Computational collapse of quantum state with application to oblivious transfer
C. Crépeau, P. Dumais, D. Mayers, and L. Salvail · 2004
Cited alongside, same era.
Constant-Round Oblivious Transfer in the Bounded Storage Model
Y.Z. Ding, D. Harnik, A. Rosen and R. Shaltiel · 2004
Cited alongside, same era.
The universal composable security of quantum key distribution
M. Ben-Or, M. Horodecki, D. Leung, D. Mayers, and J. Oppenheim · 2005
Cited alongside, same era.
S. Wehner · 2008
Later among the works it cites.
Cryptography from noisy storage
S. Wehner, C. Schaffner, and B. M. Terhal · 2008
Later among the works it cites.
Higher entropic uncertainty relations for anti-commuting observables
S. Wehner and A. Winter · 2008
Later among the works it cites.
Composable security in the bounded-quantum-storage model
S. Wehner and J. Wullschleger · 2008
Later among the works it cites.
Quantum reverse shannon theorem
C. H. Bennett, I. Devetak, A. Harrow, P. Show, and A. Winter · 2009
Closest in time.
Improving the security of quantum protocols
I. Damgaard, S. Fehr, C. Lunemann, L. Salvail, and C. Schaffner · 2009
Closest in time.
The operational meaning of min- and max-entropy
R. König, R. Renner, and C. Schaffner · 2009
Closest in time.
A strong converse for classical channel coding using entangled inputs
R. König and S. Wehner · 2009
Closest in time.
Robust cryptography in the noisy-quantum-storage model
C. Schaffner, B. Terhal, and S. Wehner · 2009
Closest in time.
In preparation
A. Bocquet · 2010
Closest in time.
Implementing two-party protocols in the noisy-storage model
M. Curty, H. Lo, C. Schaffner, and S. Wehner · 2010
Closest in time.
In preparation
C. Ervens · 2010
Closest in time.
Personal communication with Andreas Winter
M. Hayashi · 2010
Closest in time.
Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model
C. Schaffner · 2010
Closest in time.
Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes
J. Wullschleger · 2010
Closest in time.
Sampling of min-entropy relative to quantum knowledge
R. König and R. Renner · 2011
Closest in time.
Achieving the physical limits of the bounded-storage model
P. Mandayam and S. Wehner · 2011
Closest in time.