Fetching the paper…
Reading the bibliography…
Randomness is a vital resource for modern day information processing, especially for cryptography.
Quantum cryptography: public key distribution and coin tossing
Bennett, C. and Brassard, G. (1984) · 1984
Earlier work this paper cites.
Détection et correction d’erreurs en cryptographie
Robert, J.-M. (1985) · 1985
Earlier work this paper cites.
Privacy amplification by public discussion
Bennett, C. H., Brassard, G., and Robert, J.-M. (1988) · 1988
Earlier work this paper cites.
Going beyond Bell’s theorem
Greenberger, D., Horne, M., and Zeilinger, A. (1989) · 1989
Earlier work this paper cites.
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · 1991
Earlier work this paper cites.
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
Alon, N., Bruck, J., Naor, J., Naor, M., and Roth, R. M. (1992) · 1992
Earlier work this paper cites.
Practical quantum oblivious transfer
Bennett, C. H., Brassard, G., Crépeau, C., and Skubiszewska, M.-H. (1991) · 1992
Earlier work this paper cites.
Large Devitations Techniques and Applications
Dembo, A. and Zeitouni, O. (1997) · 1997
Earlier work this paper cites.
Quantum cryptography with imperfect apparatus
Mayers, D. and Yao, A. (1998) · 1998
Earlier work this paper cites.
Simple proof of security of BB84 quantum key distribution protocol
Shor, P. W. and Preskill, J. (2000) · 2000
Earlier work this paper cites.
Unconditional security in quantum cryptography
Mayers, D. (2001) · 2001
Earlier work this paper cites.
Extractors and pseudorandom generators
Trevisan, L. (2001) · 2001
Earlier work this paper cites.
All-multipartite Bell-correlation inequalities for two dichotomic observables per site
Werner, R. F. and Wolf, M. M. (2001) · 2001
Earlier work this paper cites.
List decoding with side information
Guruswami, V. (2003) · 2003
Earlier work this paper cites.
Non-commutative L p L^{p} -spaces
Pisier, G. and Xu, Q. (2003) · 2003
Earlier work this paper cites.
No signaling and quantum key distribution
Barrett, J., Hardy, L., and Kent, A. (2005) · 2005
Earlier work this paper cites.
Linear-time encodable/decodable codes with near-optimal rate
Guruswami, V. and Indyk, P. (2005) · 2005
Earlier work this paper cites.
Security of Quantum Key Distribution
Renner, R. (2005) · 2005
Earlier work this paper cites.
A proof of the security of quantum key distribution
Biham, E., Boyer, M., Boykin, P. O., Mor, T., and Roychowdhury, V. (2006) · 2006
Earlier work this paper cites.
Quantum And Relativistic Protocols For Secure Multi-Party Computation
Colbeck, R. (2006) · 2006
Earlier work this paper cites.
Explicit capacity-achieving list-decodable codes
Guruswami, V. and Rudra, A. (2006) · 2006
Earlier work this paper cites.
Analysis of the linux random number generator
Gutterman, Z., Pinkas, B., and Reinman, T. (2006) · 2006
Cited alongside, same era.
Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes
Smith, A. (2007) · 2007
Cited alongside, same era.
Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy
Guruswami, V. and Rudra, A. (2008) · 2008
Cited alongside, same era.
Non-abelian anyons and topological quantum computation
Nayak, C., Simon, S. H., Stern, A., Freedman, M., and Das Sarma, S. (2008) · 2008
Cited alongside, same era.
Trace inequalities and quantum entropy: An introductory course
Carlen, E. A. (2009) · 2009
Cited alongside, same era.
Min- and max- relative entropies and a new entanglement monotone
Datta, N. (2009) · 2009
Mining your Ps and Qs: Detection of widespread weak keys in network devices
Heninger, N., Durumeric, Z., Wustrow, E., and Halderman, J. A. (2012) · 2012
Later among the works it cites.
Ron was wrong, Whit is right
Lenstra, A. K., Hughes, J. P., Augier, M., Bos, J. W., Kleinjung, T., and Wachter, C. (2012) · 2012
Later among the works it cites.
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
Vazirani, U. V. and Vidick, T. (2012) · 2012
Later among the works it cites.
Memory attacks on device-independent quantum cryptography
Barrett, J., Colbeck, R., and Kent, A. (2013) · 2013
Later among the works it cites.
Robust randomness amplifiers: Upper and lower bounds
Coudron, M., Vidick, T., and Yuen, H. (2013) · 2013
Later among the works it cites.
Fault-tolerant quantum random-number generator certified by majorana fermions
Deng, D.-L. and Duan, L.-M. (2013) · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Information causality as a physical principle
Pawłowski, M., Paterek, T., Kaszlikowski, D., Scarani, V., Winter, A., and Żukowski, M. (2009) · 2009
Cited alongside, same era.
A fully quantum asymptotic equipartition property
Tomamichel, M., Colbeck, R., and Renner, R. (2009) · 2009
Cited alongside, same era.
Efficient device-independent quantum key distribution
Hänggi, E., Renner, R., and Wolf, S. (2010) · 2010
Cited alongside, same era.
Entropic fluctuations in quantum statistical mechanics. an introduction
Jaksic, V., Ogata, Y., Pautrat, Y., and Pillet, C.-A. (2010) · 2010
Cited alongside, same era.
Random numbers certified by Bell’s theorem
Pironio, S., Acín, A., Massar, S., Boyer de la Giroday, A., Matsukevich, D. N., Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T. A., and Monroe, C. (2010) · 2010
Cited alongside, same era.
When good randomness goes bad: Virtual machine reset vulnerabilities and hedging deployed cryptography
Ristenpart, T. and Yilek, S. (2010) · 2010
Cited alongside, same era.
Later among the works it cites.
Security and composability of randomness expansion from Bell inequalities
Fehr, S., Gelles, R., and Schaffner, C. (2013) · 2013
Later among the works it cites.
Optimal robust self-testing by binary nonlocal XOR games
Miller, C. A. and Shi, Y. (2013) · 2013
Later among the works it cites.
On quantum Rényi entropies: a new generalization and some properties
Müller-Lennert, M., Dupuis, F., Szehr, O., Fehr, S., and Tomamichel, M. (2013) · 2013
Later among the works it cites.
N.S.A. able to foil basic safeguards of privacy on web
Perlroth, N., Larson, J., and Shane, S. (2013) · 2013
Later among the works it cites.
Security of practical private randomness generation
Pironio, S. and Massar, S. (2013) · 2013
Later among the works it cites.
Classical command of quantum systems
Reichardt, B. W., Unger, F., and Vazirani, U. (2013) · 2013
Later among the works it cites.
Physical randomness extractors
Chung, K.-M., Wu, X., and Shi, Y. (2014) · 2014
Closest in time.
Infinite randomness expansion with a constant number of devices
Coudron, M. and Yuen, H. (2014) · 2014
Closest in time.
Fully device independent quantum key distribution
Vazirani, U. and Vidick, T. (2014) · 2014
Closest in time.
Strong converse for the classical capacity of entanglement-breaking and hadamard channels via a sandwiched rényi relative entropy
Wilde, M. M., Winter, A., and Yang, D. (2014) · 2014
Closest in time.
A Graduate Course in Applied Cryptography
Boneh, D. and Shoup, V. (2015) · 2015
Closest in time.
Entanglement sampling and applications
Dupuis, F., Fawzi, O., and Wehner, S. (2015) · 2015
Closest in time.
A rigorous and complete proof of finite key security of quantum key distribution
Tomamichel, M. and Leverrier, A. (2015) · 2015
Closest in time.
Unconditional security of quantum key distribution over arbitrarily long distances
Lo, H.-K. and Chau, H. F. (1999) · 2056
Closest in time.