Fetching the paper…
Reading the bibliography…
We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w as possible, namely the adversary can exclude at most one possible password for each execution of the scheme.
The existence of binary linear concatenated codes with Reed-Solomon outer codes which asymptotically meet the Gilbert-Varshamov bound
Christian Thommesen · 1983
Earlier work this paper cites.
How to prove yourself: Practical solutions to identification and signature problems
Amos Fiat and Adi Shamir · 1986
Earlier work this paper cites.
Zero knowledge proofs of identity
Uriel Feige, Amos Fiat, and Adi Shamir · 1987
Earlier work this paper cites.
A provably-secure strongly-randomized cipher
Ueli M. Maurer · 1990
Earlier work this paper cites.
Insecurity of quantum secure computations
Hoi-Kwong Lo · 1997
Earlier work this paper cites.
Oblivious transfer with a memory-bounded receiver
C. Cachin, C. Crépeau, and J. Marcil · 1998
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Earlier work this paper cites.
Efficient password-authenticated key exchange using human-memorable passwords
Jonathan Katz, Rafail Ostrovsky, and Moti Yung · 2001
Earlier work this paper cites.
Everlasting security in the bounded storage model
Yonatan Aumann, Yan Zong Ding, and Michael O. Rabin · 2002
Earlier work this paper cites.
Quantum cryptography in practice
Chip Elliott, David Pearson, and Gregory Troxel · 2003
Earlier work this paper cites.
A framework for password-based authenticated key exchange
Rosario Gennaro and Yehuda Lindell · 2003
Cited alongside, same era.
On generating the initial key in the bounded-storage model
Stefan Dziembowski and Ueli M. Maurer · 2004
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.
Correcting errors without leaking partial information
Yevgeniy Dodis and Adam Smith · 2005
Cited alongside, same era.
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.
Composing quantum protocols in a classical environment
Serge Fehr and Christian Schaffner · 2008
Closest in time.
Randomness extraction via delta-biased masking in the presence of a quantum attacker
Serge Fehr and Christian Schaffner · 2008
Closest in time.
The operational meaning of min- and max-entropy
Robert König, Renato Renner, and Christian Schaffner · 2008
Closest in time.
Robust cryptography in the noisy-quantum-storage model
Christian Schaffner, Barbara M. Terhal, and Stephanie Wehner · 2008
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Robust fuzzy extractors and authenticated key agreement from close secrets
Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin, and Adam Smith · 2006
Cited alongside, same era.
A tight high-order entropic quantum uncertainty relation with applications
Ivan B. Damgård, Serge Fehr, Renato Renner, Louis Salvail, and Christian Schaffner · 2007
Cited alongside, same era.
Secure identification and QKD in the bounded-quantum-storage model
Ivan B. Damgård, Serge Fehr, Louis Salvail, and Christian Schaffner · 2007
Cited alongside, same era.
Secure two-party quantum computation against semi-honest adversaries
Jesper Buus Nielsen, Thomas B. Pedersen, and Louis Salvail · 2007
Cited alongside, same era.
Stephanie Wehner, Christian Schaffner, and Barbara M. Terhal · 2008
Closest in time.
Impossibility of two-party secure function evaluation
Harry Buhrman, Matthias Christandl, and Christian Schaffner · 2009
Closest in time.
Improving the security of quantum protocols
Ivan B. Damgård, Serge Fehr, Carolin Lunemann, Louis Salvail, and Christian Schaffner · 2009
Closest in time.
Composing quantum protocols in a classical environment
Serge Fehr and Christian Schaffner · 2009
Closest in time.
Unconditional security from noisy quantum storage
Robert König, Stephanie Wehner, and Jürg Wullschleger · 2009
Closest in time.