Fetching the paper…
Reading the bibliography…
Quantum cryptography exploits principles of quantum physics for the secure processing of information.
1903
Earlier work this paper cites.
1904
Earlier work this paper cites.
1908
Earlier work this paper cites.
1909
Earlier work this paper cites.
Bennett, Charles H, Gilles Brassard, Claude Crépeau, and Ueli Maurer (1995), “Generalized privacy amplification,” IEEE Trans. Inf. Theory 41
1923
Earlier work this paper cites.
Born, Max (1926), “Zur Quantenmechanik der Stoßvorgänge,” Zeitschrift für Physik 37
1926
Earlier work this paper cites.
Vernam, Gilbert S (1926), “Cipher printing telegraph systems for secret wire and radio telegraphic communications,” Trans. Am. Inst. Electr. Eng. XLV
1926
Earlier work this paper cites.
Einstein, Albert, Boris Podolsky, and Nathan Rosen (1935), “Can quantum-mechanical description of physical reality be considered complete?” Phys. Rev. 47
1935
Earlier work this paper cites.
Shannon, Claude E (1949), “Communication theory of secrecy systems,” Bell system technical journal 28
1949
Earlier work this paper cites.
Steane, Andrew (1996), “Multiple-particle interference and quantum error correction,” Proc. R. Soc. London, Ser. A 452
1954
Earlier work this paper cites.
Bell, John Stewart (1964), “On the Einstein-Podolsky-Rosen paradox,” Physics 1
1964
Earlier work this paper cites.
Bell, John Stewart (1966), “On the problem of hidden variables in quantum mechanics,” Rev. Mod. Phys. 38
1966
Earlier work this paper cites.
Kochen, Simon B, and Ernst P. Specker (1967), “The problem of hidden variables in quantum mechanics,” J. Math. Mech. 17
1967
Earlier work this paper cites.
Clauser, John, Michael Horne, Abner Shimony, and Richard Holt (1969), “Proposed experiment to test local hidden-variable theories,” Phys. Rev. Lett. 23
1969
Earlier work this paper cites.
Wiesner, Stephen (1983), “Conjugate coding,” SIGACT news 15
1969
Earlier work this paper cites.
1971
Earlier work this paper cites.
Freedman, Stuart J, and John F. Clauser (1972), “Experimental test of local hidden-variable theories,” Phys. Rev. Lett. 28
1972
Earlier work this paper cites.
Helstrom, Carl W (1976), Quantum Detection and Estimation Theory , Mathematics in science and engineering, Vol. 123 (Academic Press)
1976
Earlier work this paper cites.
Rivest, Ronald L, Adi Shamir, and Leonard Adleman (1978), “A method for obtaining digital signatures and public-key cryptosystems,” Commun. ACM 21
1978
Earlier work this paper cites.
Carter, Larry, and Mark N. Wegman (1979), “Universal classes of hash functions,” J. Comput. Syst. Sci. 18
1979
Earlier work this paper cites.
Aspect, Alain, Philippe Grangier, and Gérard Roger (1981), “Experimental tests of realistic local theories via Bell’s theorem,” Phys. Rev. Lett. 47
1981
Earlier work this paper cites.
Wegman, Mark N, and Larry Carter (1981), “New hash functions and their use in authentication and set equality,” J. Comput. Syst. Sci. 22
1981
Earlier work this paper cites.
Aspect, Alain, Jean Dalibard, and Gérard Roger (1982), “Experimental test of Bell’s inequalities using time-varying analyzers,” Phys. Rev. Lett. 49
1982
Earlier work this paper cites.
Wootters, William K, and Wojciech H. Zurek (1982), “A single quantum cannot be cloned,” Nature 299
1982
Earlier work this paper cites.
Blum, Manuel (1983), “Coin flipping by telephone a protocol for solving impossible problems,” ACM SIGACT News 15
1983
Earlier work this paper cites.
Bennett, Charles H, and Gilles Brassard (1984), “Quantum cryptography: Public key distribution and coin tossing,” in Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing , pp. 175–179
1984
Earlier work this paper cites.
1984
Earlier work this paper cites.
1984
Earlier work this paper cites.
Simmons, Gustavus J (1985), “Authentication theory/coding theory,” in Advances in Cryptology – CRYPTO ’84 , LNCS, Vol. 196 (Springer) pp. 411–431
1985
Earlier work this paper cites.
Goldreich, Oded, Silvio Micali, and Avi Wigderson (1986), “Proofs that yield nothing but their validity and a methodology of cryptographic protocol design,” in Proceedings of the 27th Symposium on Foundations of Computer Science, FOCS ’86 (IEEE) pp. 174–187
1986
Earlier work this paper cites.
Goldreich, Oded, Silvia Micali, and Avi Wigderson (1987), “How to play any mental game,” in Proceedings of the 19th Symposium on Theory of Computing, STOC ’87 (ACM) pp. 218––229
1987
Earlier work this paper cites.
Bennett, Charles H, Gilles Brassard, and Jean-Marc Robert (1988), “Privacy amplification by public discussion,” SIAM J. Comput. 17
1988
Earlier work this paper cites.
Crépeau, Claude, and Joe Kilian (1988), “Achieving oblivious transfer using weakened security assumptions,” in Proceedings of the 29th Symposium on Foundations of Computer Science, FOCS ’88 , pp. 42–52
1988
Earlier work this paper cites.
Simmons, Gustavus J (1988), “A survey of information authentication,” Proc. IEEE 76
1988
Earlier work this paper cites.
Stinson, Douglas R (1990), “The combinatorics of authentication and secrecy codes,” J. Crypt. 2
1990
Earlier work this paper cites.
Zuckerman, David (1990), “General weak random sources,” in Proceedings of the 31st Symposium on Foundations of Computer Science, FOCS ’90 (IEEE) pp. 534–543
1990
Earlier work this paper cites.
Ekert, Artur (1991), “Quantum cryptography based on Bell’s theorem,” Phys. Rev. Lett. 67
1991
Earlier work this paper cites.
Renes, Joseph M, and Renato Renner (2012), “One-shot classical data compression with quantum side information and the distillation of common randomness or secret keys,” IEEE Trans. Inf. Theory 58
1991
Earlier work this paper cites.
Beaver, Donald (1992), “Foundations of secure interactive computing,” in Advances in Cryptology – CRYPTO ’91 , LNCS, Vol. 576 (Springer) pp. 377–391
1992
Earlier work this paper cites.
Micali, Silvio, and Phillip Rogaway (1992), “Secure computation (abstract),” in Advances in Cryptology – CRYPTO ’91 , LNCS, Vol. 576 (Springer) pp. 392–404
1992
Earlier work this paper cites.
Ahlswede, Rudolph, and Imre Csiszár (1993), “Common randomness in information theory and cryptography—Part I: Secret sharing,” IEEE Trans. Inf. Theory 39
1993
Earlier work this paper cites.
Maurer, Ueli (1993), “Secret key agreement by public discussion,” IEEE Trans. Inf. Theory 39
1993
Earlier work this paper cites.
Ohya, Masanori, and Dénes Petz (1993), Quantum Entropy and Its Use (Springer)
1993
Earlier work this paper cites.
Maurer, Ueli (1994), “The strong secret key rate of discrete random triples,” in Communications and Cryptography: Two Sides of One Tapestry , The Springer International Series in Engineering and Computer Science, Vol. 276 (Springer) pp. 271–285
1994
Earlier work this paper cites.
Stinson, Douglas R (1994), “Universal hashing and authentication codes,” Des. Codes Cryptogr. 4
1994
Earlier work this paper cites.
Calderbank, A R, and Peter W. Shor (1996), “Good quantum error-correcting codes exist,” Phys. Rev. A 54
1996
Earlier work this paper cites.
Mayers, Dominic (1996), “Quantum key distribution and string oblivious transfer in noisy channels,” in Advances in Cryptology – CRYPTO ’96 , LNCS, Vol. 1109 (Springer) pp. 343–357, arXiv:quant-ph/9606003
1996
Earlier work this paper cites.
Bellare, Mihir, Anand Desai, Eron Jokipii, and Phillip Rogaway (1997), “A concrete security treatment of symmetric encryption,” in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, FOCS ’97 (IEEE) pp. 394–403
1997
Earlier work this paper cites.
Biham, Eli, and Tal Mor (1997), “Security of quantum cryptography against collective attacks,” Phys. Rev. Lett. 78
1997
Earlier work this paper cites.
Fuchs, Christopher A, Nicolas Gisin, Robert B. Griffiths, Chi-Sheng Niu, and Asher Peres (1997), “Optimal eavesdropping in quantum cryptography. i. information bound and optimal strategy,” Phys. Rev. A 56
1997
Earlier work this paper cites.
Muller, Antoine, Thomas Herzog, Bruno Huttner, Woflgang Tittel, Hugo Zbinden, and Nicolas Gisin (1997), ““plug and play” systems for quantum cryptography,” Appl. Phys. Lett. 70
1997
Earlier work this paper cites.
Shor, Peter W (1997), “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM J. Comput. 26
1997
Earlier work this paper cites.
Bellare, Mihir, Anand Desai, David Pointcheval, and Phillip Rogaway (1998), “Relations among notions of security for public-key encryption schemes,” in Advances in Cryptology – CRYPTO ’98 (Springer) pp. 26–45
1998
Earlier work this paper cites.
Brassard, Gilles, Claude Crépeau, Dominic Mayers, and Louis Salvail (1998), “Defeating classical bit commitments with a quantum computer,” e-print, arXiv:quant-ph/9806031
1998
Earlier work this paper cites.
Canetti, Ran (2000), “Security and composition of multiparty cryptographic protocols,” J. Crypt. 13
1998
Earlier work this paper cites.
Fuchs, Christopher A (1998), “Information gain vs. state disturbance in quantum theory,” Fortschritte der Physik: Progress of Physics 46
1998
Earlier work this paper cites.
Horodecki, Michał, Paweł Horodecki, and Ryszard Horodecki (1998), “Mixed-state entanglement and distillation: Is there a “bound” entanglement in nature?” Phys. Rev. Lett. 80
1998
Earlier work this paper cites.
Tittel, Wolfgang, Jurgen Brendel, Bernard Gisin, Thomas Herzog, Hugo Zbinden, and Nicolas Gisin (1998), “Experimental demonstration of quantum correlations over more than 10 km,” Phys. Rev. A 57
1998
Earlier work this paper cites.
Weihs, Gregor, Thomas Jennewein, Christoph Simon, Harald Weinfurter, and Anton Zeilinger (1998), “Violation of Bell’s inequality under strict einstein locality conditions,” Phys. Rev. Lett. 81
1998
Earlier work this paper cites.
Fuchs, Christopher A, and Jeroen Van De Graaf (1999), “Cryptographic distinguishability measures for quantum-mechanical states,” IEEE Trans. Inf. Theory 45
1999
Earlier work this paper cites.
Kent, Adrian (1999), “Unconditionally secure bit commitment,” Phys. Rev. Lett. 83
1999
Earlier work this paper cites.
Wolf, Stefan (1999), Information-Theoretically and Computationally Secure Key Agreement in Cryptography , Ph.D. thesis (Swiss Federal Institute of Technology (ETH) Zurich)
1999
Earlier work this paper cites.
Ambainis, Andris, Michele Mosca, Alain Tapp, and Ronald de Wolf (2000), “Private quantum channels,” in Proceedings of the 41st Symposium on Foundations of Computer Science, FOCS ’00 (IEEE) p. 547, arXiv:quant-ph/0003101
2000
Earlier work this paper cites.
Biham, Eli, Michel Boyer, P. Oscar Boykin, Tal Mor, and Vwani Roychowdhury (2000), “A proof of the security of quantum key distribution (extended abstract),” in Proceedings of the 32nd Symposium on Theory of Computing, STOC ’00 (ACM) pp. 715–724, arXiv:quant-ph/9912053
2000
Earlier work this paper cites.
Brassard, Gilles, Norbert Lütkenhaus, Tal Mor, and Barry C. Sanders (2000), “Limitations on practical quantum cryptography,” Phys. Rev. Lett. 85
2000
Earlier work this paper cites.
Canetti, Ran (2020), “Universally composable security: A new paradigm for cryptographic protocols,” e-Print IACR 2000/067 , updated version of Canetti [73]
2000
Earlier work this paper cites.
Coffman, Valerie, Joydip Kundu, and William K. Wootters (2000), “Distributed entanglement,” Phys. Rev. A 61
2000
Earlier work this paper cites.
Lütkenhaus, Norbert (2000), “Security against individual attacks for realistic quantum key distribution,” Phys. Rev. A 61
2000
Earlier work this paper cites.
Maurer, Ueli, and Stefan Wolf (2000), “Information-theoretic key agreement: From weak to strong secrecy for free,” in Advances in Cryptology – EUROCRYPT 2000 , LNCS, Vol. 1807 (Springer) pp. 351–368
2000
Earlier work this paper cites.
Pfitzmann, Birgit, and Michael Waidner (2000), “Composition and integrity preservation of secure reactive systems,” in Proceedings of the 7th ACM Conference on Computer and Communications Security, CSS ’00 (ACM) pp. 245–254
2000
Earlier work this paper cites.
Shor, Peter W, and John Preskill (2000), “Simple proof of security of the BB84 quantum key distribution protocol,” Phys. Rev. Lett. 85
2000
Earlier work this paper cites.
Thorisson, Hermann (2000), Coupling, Stationarity, and Regeneration , Probability and its Applications (New York) (Springer)
2000
Earlier work this paper cites.
Canetti, Ran (2001), “Universally composable security: A new paradigm for cryptographic protocols,” in Proceedings of the 42nd Symposium on Foundations of Computer Science, FOCS ’01 (IEEE) pp. 136–145
2001
Earlier work this paper cites.
Canetti, Ran, and Marc Fischlin (2001), “Universally composable commitments,” in Advances in Cryptology — CRYPTO 2001 , edited by Joe Kilian (Springer) pp. 19–40, e-Print IACR 2001/055
2001
Earlier work this paper cites.
Mayers, Dominic (2001), “Unconditional security in quantum cryptography,” J. ACM 48
2001
Earlier work this paper cites.
Pfitzmann, Birgit, and Michael Waidner (2001), “A model for asynchronous reactive systems and its application to secure message transmission,” in IEEE Symposium on Security and Privacy (IEEE) pp. 184–200
2001
Earlier work this paper cites.
Rowe, M A, David Kielpinski, V. Meyer, Charles A. Sackett, Wayne M. Itano, C. Monroe, and D. J. Wineland (2001), “Experimental violation of a bell’s inequality with efficient detection,” Nature 409
2001
Earlier work this paper cites.
Barnum, Howard, Claude Crépeau, Daniel Gottesman, Adam Smith, and Alain Tapp (2002), “Authentication of quantum messages,” in Proceedings of the 43rd Symposium on Foundations of Computer Science, FOCS ’02 (IEEE) pp. 449–458, arXiv:quant-ph/0205128
2002
Earlier work this paper cites.
Biham, Eli, Michel Boyer, Gilles Brassard, Jeroen van de Graaf, and Tal Mor (2002), “Security of quantum key distribution against all collective attacks,” Algorithmica 34
2002
Earlier work this paper cites.
Canetti, Ran, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai (2002), “Universally composable two-party and multi-party secure computation,” in Proceedings of the 34th Symposium on Theory of Computing, STOC ’02 (ACM) p. 494–503, e-Print IACR 2002/140
2002
Earlier work this paper cites.
Crépeau, Claude, Daniel Gottesman, and Adam Smith (2002), “Secure multi-party quantum computation,” in Proceedings of the 34th Symposium on Theory of Computing, STOC ’02 (ACM) pp. 643–652, arXiv:quant-ph/0206138
2002
Earlier work this paper cites.
Inoue, Kyo, Edo Waks, and Yoshihisa Yamamoto (2002), “Differential phase shift quantum key distribution,” Phys. Rev. Lett. 89
2002
Earlier work this paper cites.
Maurer, Ueli (2002), “Indistinguishability of random systems,” in Advances in Cryptology – EUROCRYPT 2002 , LNCS, Vol. 2332 (Springer) pp. 110–132
2002
Earlier work this paper cites.
Nishioka, Tsuyoshi, Hirokazu Ishizuka, Toshio, and Junichi Abe (2002), ““circular type” quantum key distribution,” IEEE Photonics Technol. Lett. 14
2002
Earlier work this paper cites.
Boykin, P Oscar, and Vwani Roychowdhury (2003), “Optimal encryption of quantum bits,” Phys. Rev. A 67
2003
Earlier work this paper cites.
Canetti, Ran, Hugo Krawczyk, and Jesper B. Nielsen (2003), “Relaxing chosen-ciphertext security,” in Advances in Cryptology – CRYPTO 2003 , edited by Dan Boneh (Springer) pp. 565–582
2003
Earlier work this paper cites.
Gottesman, Daniel, and Hoi-Kwong Lo (2003), “Proof of security of quantum key distribution with two-way classical communications,” IEEE Trans. Inf. Theory 49
2003
Earlier work this paper cites.
Hwang, Won-Young (2003), “Quantum key distribution with high loss: Toward global secure communication,” Phys. Rev. Lett. 91
2003
Earlier work this paper cites.
Lo, Hoi-Kwong (2003), “Method for decoupling error correction from privacy amplification,” New J. Phys. 5
2003
Earlier work this paper cites.
Mateus, Paulo, John C. Mitchell, and Andre Scedrov (2003), “Composition of cryptographic protocols in a probabilistic polynomial-time process calculus,” in CONCUR 2003 – Concurrency Theory , LNCS, Vol. 2761 (Springer) pp. 327–349
2003
Earlier work this paper cites.
Renner, Renato, and Stefan Wolf (2003), “Unconditional authenticity and privacy from an arbitrarily weak secret,” in Advances in Cryptology – CRYPTO 2003 , LNCS, Vol. 2729 (Springer) pp. 78–95
2003
Earlier work this paper cites.
Tamaki, Kiyoshi, Masato Koashi, and Nobuyuki Imoto (2003), “Unconditionally secure key distribution based on two nonorthogonal states,” Phys. Rev. Lett. 90
2003
Earlier work this paper cites.
Alicki, Robert, and Mark Fannes (2004), “Continuity of quantum conditional information,” J. Phys. A 37
2004
Earlier work this paper cites.
Ambainis, Andris, and Adam Smith (2004), “Small pseudo-random families of matrices: Derandomizing approximate quantum encryption,” in Proceedings of the 8th International Workshop on Randomization and Computation, RANDOM 2004 (Springer) pp. 249–260, arXiv:quant-ph/0404075
2004
Earlier work this paper cites.
Backes, Michael, Birgit Pfitzmann, and Michael Waidner (2004), “A general composition theorem for secure reactive systems,” in Theory of Cryptography, Proceedings of TCC 2004 , LNCS, Vol. 2951 (Springer) pp. 336–354
2004
Earlier work this paper cites.
Backes, Michael, Birgit Pfitzmann, and Michael Waidner (2007), “The reactive simulatability (RSIM) framework for asynchronous systems,” Inform. and Comput. 205
2004
Earlier work this paper cites.
Bell, John Stewart, and Alain Aspect (2004), “Free variables and local causality,” in Speakable and Unspeakable in Quantum Mechanics: Collected Papers on Quantum Philosophy , Chap. 12, 2nd ed. (Cambridge University Press) pp. 100–104
2004
Earlier work this paper cites.
Bellare, Mihir, and Phillip Rogaway (2006), “The security of triple encryption and a framework for code-based game-playing proofs,” in Advances in Cryptology – EUROCRYPT 2006 , LNCS, Vol. 4004, edited by Serge Vaudenay (Springer) pp. 409–426, e-Print IACR 2004/331
2004
Earlier work this paper cites.
Ben-Or, Michael, and Dominic Mayers (2004), “General security definition and composability for quantum & classical protocols,” e-Print, arXiv:quant-ph/0409062
2004
Earlier work this paper cites.
Christandl, Matthias, Renato Renner, and Artur Ekert (2004), “A generic security proof for quantum key distribution,” e-Print, arXiv:quant-ph/0402131
2004
Earlier work this paper cites.
DiVincenzo, David, Michał Horodecki, Debbie Leung, John Smolin, and Barbara Terhal (2004), “Locking classical correlation in quantum states,” Phys. Rev. Lett. 92
2004
Earlier work this paper cites.
Goldreich, Oded (2004), Foundations of Cryptography: Volume 2, Basic Applications (Cambridge University Press, New York, NY, USA)
2004
Earlier work this paper cites.
Gottesman, Daniel, Hoi-Kwong Lo, Norbert Lütkenhaus, and John Preskill (2004), “Security of quantum key distribution with imperfect devices,” Quantum Inf. Comput. 4
2004
Cited alongside, same era.
Hayden, Patrick, Debbie Leung, Peter W. Shor, and Andreas Winter (2004), “Randomizing quantum states: Constructions and applications,” Commun. Math. Phys. 250
2004
Cited alongside, same era.
Koashi, Masato (2004), “Unconditional security of coherent-state quantum key distribution with a strong phase-reference pulse,” Phys. Rev. Lett. 93
2004
Cited alongside, same era.
Koashi, Masato, and Andreas Winter (2004), “Monogamy of quantum entanglement and other correlations,” Phys. Rev. A 69
2004
Cited alongside, same era.
Branciard, Cyril, Eric G. Cavalcanti, Stephen P. Walborn, Valerio Scarani, and Howard M. Wiseman (2012), “One-sided device-independent quantum key distribution: Security, feasibility, and the connection with steering,” Phys. Rev. A 85
2012
Later among the works it cites.
Braunstein, Samuel L, and Stefano Pirandola (2012), “Side-channel-free quantum key distribution,” Phys. Rev. Lett. 108
2012
Later among the works it cites.
Colbeck, Roger, and Renato Renner (2012), “Free randomness can be amplified,” Nat. Phys. 8
2012
Later among the works it cites.
Cover, Thomas M, and Joy A. Thomas (2012), Elements of information theory (John Wiley & Sons)
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2004
Cited alongside, same era.
Peres, Asher, and Daniel R. Terno (2004), “Quantum information and relativity theory,” Rev. Mod. Phys. 76
2004
Cited alongside, same era.
Scarani, Valerio, Antonio Acín, Grégoire Ribordy, and Nicolas Gisin (2004), “Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulse implementations,” Phys. Rev. Lett. 92
2004
Cited alongside, same era.
Shaltiel, Ronen (2004), “Recent developments in explicit constructions of extractors,” in Current Trends in Theoretical Computer Science: The Challenge of the New Century, Vol 1: Algorithms and Complexity (World Scientific) pp. 189–228
2004
Cited alongside, same era.
Terhal, Barbara M (2004), “Is entanglement monogamous?” IBM J. Res. Dev. 48
2004
Cited alongside, same era.
Unruh, Dominique (2004), “Simulatable security for quantum protocols,” e-Print, arXiv:quant-ph/0409125
2004
Cited alongside, same era.
Barrett, Jonathan, Lucien Hardy, and Adrian Kent (2005), “No signaling and quantum key distribution,” Phys. Rev. Lett. 95
2005
Cited alongside, same era.
Ben-Or, Michael, Michał Horodecki, Debbie Leung, Dominic Mayers, and Jonathan Oppenheim (2005), “The universal composable security of quantum key distribution,” in Theory of Cryptography, Proceedings of TCC 2005 , LNCS, Vol. 3378 (Springer) pp. 386–406, arXiv:quant-ph/0409078
2005
Cited alongside, same era.
2012
Later among the works it cites.
Dupuis, Frédéric, Jesper B. Nielsen, and Louis Salvail (2012), “Actively secure two-party evaluation of any quantum operation,” in Advances in Cryptology – CRYPTO 2012 , LNCS, Vol. 7417, edited by Reihaneh Safavi-Naini and Ran Canetti (Springer) pp. 794–811, e-Print IACR 2012/304
2012
Later among the works it cites.
Gutoski, Gus (2012), “On a measure of distance for quantum strategies,” J. Math. Phys. 53
2012
Later among the works it cites.
2012
Later among the works it cites.
2012
Later among the works it cites.
2012
Later among the works it cites.
2012
Later among the works it cites.
Maurer, Ueli, Andreas Rüedlinger, and Björn Tackmann (2012), “Confidentiality and integrity: A constructive perspective,” in Theory of Cryptography, Proceedings of TCC 2012 , LNCS, Vol. 7194, edited by Ronald Cramer (Springer) pp. 209–229
2012
Later among the works it cites.
Tamaki, Kiyoshi, Hoi-Kwong Lo, Chi-Hang Fred Fung, and Bing Qi (2012), “Phase encoding schemes for measurement-device-independent quantum key distribution with basis-dependent flaw,” Phys. Rev. A 85
2012
Later among the works it cites.
2012
Later among the works it cites.
Unruh, Dominique (2013), “Everlasting multi-party computation,” in Advances in Cryptology – CRYPTO 2013 , LNCS, Vol. 8043 (Springer) pp. 380–397, e-Print IACR 2012/177
2012
Later among the works it cites.
2012
Later among the works it cites.
Zhandry, Mark (2012), “How to construct quantum random functions,” in Proceedings of the 53rd Symposium on Foundations of Computer Science, FOCS ’12 (IEEE) pp. 679–687, e-Print IACR 2012/182
2012
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
Christensen, Bradley G, Kevin T. McCusker, J. B. Altepeter, Brice Calkins, Thomas Gerrits, Adriana E. Lita, Aaron Miller, L. K. Shalm, Y. Zhang, S. W. Nam, Nicolas Brunner, Charles Ci Wen Lim, Nicolas Gisin, and Paul G. Kwiat (2013), “Detection-loophole-free test of quantum nonlocality, and applications,” Phys. Rev. Lett. 111
2013
Later among the works it cites.
Coretti, Sandro, Ueli Maurer, and Björn Tackmann (2013), “Constructing confidential channels from authenticated channels—public-key encryption revisited,” in Advances in Cryptology – ASIACRYPT 2013 , LNCS, Vol. 8269 (Springer) pp. 134–153, e-Print IACR 2013/719
2013
Later among the works it cites.
Demay, Gregory, and Ueli Maurer (2013), “Unfair coin tossing,” in Proceedings of the 2013 IEEE International Symposium on Information Theory, ISIT 2013 (IEEE) pp. 1556–1560
2013
Later among the works it cites.
Giustina, Marissa, Alexandra Mech, Sven Ramelow, Bernhard Wittmann, Johannes Kofler, Jörn Beyer, Adriana Lita, Brice Calkins, Thomas Gerrits, Sae Woo Nam, Rupert Ursin, and Anton Zeilinger (2013), “Bell violation using entangled photons without the fair-sampling assumption,” Nature 497
2013
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
Renes, Joseph M (2013), “The physics of quantum information: Complementarity, uncertainty, and entanglement,” Int. J. Quantum Inf. 11
2013
Later among the works it cites.
2013
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
Ekert, Artur, and Renato Renner (2014), “The ultimate physical limits of privacy,” Nature 507
2014
Later among the works it cites.
Hardy, Lucien (2015), “Quantum theory with bold operator tensors,” Philos. Trans. R. Soc. London, Ser. A 373
2014
Later among the works it cites.
Jouguet, Paul, and Sebastien Kunz-Jacques (2014), “High performance error correction for quantum key distribution using polar codes,” Quantum Inf. Comput. 14
2014
Later among the works it cites.
Lim, Charles Ci Wen, Marcos Curty, Nino Walenta, Feihu Xu, and Hugo Zbinden (2014), “Concise security bounds for practical decoy-state quantum key distribution,” Phys. Rev. A 89
2014
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
Portmann, Christopher (2014), “Key recycling in authentication,” IEEE Trans. Inf. Theory 60
2014
Later among the works it cites.
Sasaki, Toshihiko, Yoshihisa Yamamoto, and Masato Koashi (2014), “Practical quantum key distribution protocol without monitoring signal disturbance,” Nature 509
2014
Later among the works it cites.
Tang, Yan-Lin, Hua-Lei Yin, Si-Jing Chen, Yang Liu, Wei-Jun Zhang, Xiao Jiang, Lu Zhang, Jian Wang, Li-Xing You, Jian-Yu Guan, Dong-Xu Yang, Zhen Wang, Hao Liang, Zhen Zhang, Nan Zhou, Xiongfeng Ma, Teng-Yun Chen, Qiang Zhang, and Jian-Wei Pan (2014), “Measurement-device-independent quantum key distribution over 200 km,” Phys. Rev. Lett. 113
2014
Later among the works it cites.
Unruh, Dominique (2014), “Quantum position verification in the random oracle model,” in Advances in Cryptology – CRYPTO 2014 , LNCS, Vol. 8617 (Springer) pp. 1–18, e-Print IACR 2014/118
2014
Later among the works it cites.
2014
Later among the works it cites.
2015
Later among the works it cites.
Cramer, Ronald, Ivan B. Damgård, and Jesper B. Nielsen (2015), Secure Multiparty Computation and Secret Sharing (Cambridge University Press)
2015
Later among the works it cites.
Giustina, Marissa, Marijn A. M. Versteegh, Sören Wengerowsky, Johannes Handsteiner, Armin Hochrainer, Kevin Phelan, Fabian Steinlechner, Johannes Kofler, Jan-Åke Larsson, Carlos Abellán, Waldimar Amaya, Valerio Pruneri, Morgan W. Mitchell, Jörn Beyer, Thomas Gerrits, Adriana E. Lita, Lynden K. Shalm, Sae Woo Nam, Thomas Scheidl, Rupert Ursin, Bernhard Wittmann, and Anton Zeilinger (2015), “Significant-loophole-free test of Bell’s theorem with entangled photons,” Phys. Rev. Lett. 115
2015
Later among the works it cites.
Hensen, B, H. Bernien, A. E. Dréau, A. Reiserer, N. Kalb, M. S. Blok, J. Ruitenberg, R. F. L. Vermeulen, R. N. Schouten, C. Abellán, W. Amaya, V. Pruneri, M. W. Mitchell, M. Markham, D. J. Twitchen, D. Elkouss, S. Wehner, T. H. Taminiau, and R. Hanson (2015), “Loophole-free bell inequality violation using electron spins separated by 1.3 kilometres,” Nature 526
2015
Later among the works it cites.
Ishai, Yuval, Rafail Ostrovsky, and Vassilis Zikas (2014), “Secure multi-party computation with identifiable abort,” in Advances in Cryptology – CRYPTO 2014 , edited by Juan A. Garay and Rosario Gennaro (Springer) pp. 369–386, e-Print IACR 2015/325
2015
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.
Pirandola, Stefano, Carlo Ottaviani, Gaetana Spedalieri, Christian Weedbrook, Samuel L. Braunstein, Seth Lloyd, Tobias Gehring, Christian S. Jacobsen, and Ulrik L. Andersen (2015), “High-rate measurement-device-independent quantum cryptography,” Nat. Photonics 9
2015
Later among the works it cites.
Shalm, Lynden K, Evan Meyer-Scott, Bradley G. Christensen, Peter Bierhorst, Michael A. Wayne, Martin J. Stevens, Thomas Gerrits, Scott Glancy, Deny R. Hamel, Michael S. Allman, Kevin J. Coakley, Shellee D. Dyer, Carson Hodge, Adriana E. Lita, Varun B. Verma, Camilla Lambrocco, Edward Tortorici, Alan L. Migdall, Yanbao Zhang, Daniel R. Kumor, William H. Farr, Francesco Marsili, Matthew D. Shaw, Jeffrey A. Stern, Carlos Abellán, Waldimar Amaya, Valerio Pruneri, Thomas Jennewein, Morgan W. Mitchell, Paul G. Kwiat, Joshua C. Bienfang, Richard P. Mirin, Emanuel Knill, and Sae Woo Nam (2015), “Strong loophole-free test of local realism,” Phys. Rev. Lett. 115
2015
Later among the works it cites.
2015
Later among the works it cites.
Webb, Zak (2015), “The Clifford group forms a unitary 3-design,” Quantum Inf. Comput. 16
2015
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
Maurer, Ueli, and Renato Renner (2016), “From indifferentiability to constructive cryptography (and back),” in Theory of Cryptography, Proceedings of TCC 2016-B, Part I , LNCS, Vol. 9985 (Springer) pp. 3–24, e-Print IACR 2016/903
2016
Later among the works it cites.
Seiler, Gregor, and Ueli Maurer (2016), “On the impossibility of information-theoretic composable coin toss extension,” in Proceedings of the 2016 IEEE International Symposium on Information Theory, ISIT 2016 (IEEE) pp. 3058–3061
2016
Later among the works it cites.
2016
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Coles, Patrick J, Mario Berta, Marco Tomamichel, and Stephanie Wehner (2017), “Entropic uncertainty relations and their applications,” Rev. Mod. Phys. 89
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Rosenfeld, Wenjamin, Daniel Burchardt, Robert Garthoff, Kai Redeker, Norbert Ortegel, Markus Rau, and Harald Weinfurter (2017), “Event-ready bell test using entangled atoms simultaneously closing detection and locality loopholes,” Phys. Rev. Lett. 119
2017
Later among the works it cites.
Streltsov, Alexander, Gerardo Adesso, and Martin B. Plenio (2017), “Colloquium: Quantum coherence as a resource,” Rev. Mod. Phys. 89
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Zhu, Huangjun (2017), “Multiqubit Clifford groups are unitary 3-designs,” Phys. Rev. A 96
2017
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
Arnon-Friedman, Rotem, Frédéric Dupuis, Omar Fawzi, Renato Renner, and Thomas Vidick (2018), “Practical device-independent quantum cryptography via entropy accumulation,” Nat. Commun. 9
2018
Later among the works it cites.
Lucamarini, Marco, Zhiliang L. Yuan, James F. Dynes, and Andrew J. Shields (2018), “Overcoming the rate–distance limit of quantum key distribution without quantum repeaters,” Nature 557
2018
Later among the works it cites.
Watrous, John (2018), The Theory of Quantum Information (Cambridge University Press) available at http://cs.uwaterloo.ca/~watrous/TQI/
2018
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Chitambar, Eric, and Gilad Gour (2019), “Quantum resource theories,” Rev. Mod. Phys. 91
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Yin, Hua-Lei, and Zeng-Bing Chen (2019), “Finite-key analysis for twin-field quantum key distribution with composable security,” Sci. Rep. 9
2019
Later among the works it cites.
Alon, Bar, Hao Chung, Kai-Min Chung, Mi-Ying Huang, Yi Lee, and Yu-Ching Shen (2020), “Round efficient secure multiparty quantum computation with identifiable abort,” to appear at CRYPTO 2021, e-Print IACR 2020/1464
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
Prokop, Milǒs (2020), “Composable security of quantum bit commitment protocol,” e-print
2020
Later among the works it cites.
2021
Closest in time.
Vakhitov, Artem, Vadim Makarov, and Dag R. Hjelme (2001), “Large pulse attack as a method of conventional optical eavesdropping in quantum cryptography,” J. Mod. Opt. 48
2038
Closest in time.
Bennett, Charles H, Herbert J. Bernstein, Sandu Popescu, and Benjamin Schumacher (1996a), “Concentrating partial entanglement by local operations,” Phys. Rev. A 53
2052
Closest in time.
Devetak, Igor, and Andreas Winter (2005), “Distillation of secret key and entanglement from quantum states,” Proc. R. Soc. London, Ser. A 461
2053
Closest in time.
Lo, Hoi-Kwong, and Hoi Fung Chau (1999), “Unconditional security of quantum key distribution over arbitrarily long distances,” Science 283
2056
Closest in time.