Fetching the paper…
Reading the bibliography…
Cryptographic key exchange protocols traditionally rely on computational conjectures such as the hardness of prime factorisation to provide security against eavesdropping attacks.
R. G. Gallager, Low-Density Parity-Check Codes (Cambridge, MA: MIT Press, 1963)
1963
Earlier work this paper cites.
J. S. Bell, On the Einstein Podolsky Rosen paradox, Phys. Phys. Fiz 1
1964
Earlier work this paper cites.
J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, Proposed experiment to test local hidden-variable theories, Phys. Rev. Lett. 23
1969
Earlier work this paper cites.
R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Commun. ACM 21
1978
Earlier work this paper cites.
M. N. Wegman and L. Carter, New hash functions and their use in authentication and set equality, J. Comput. Syst. Sci. 22
1981
Earlier work this paper cites.
C. H. Bennett and G. Brassard, Quantum cryptography: public key distribution and coin tossing., Theor. Comput. Sci. 560
1984
Earlier work this paper cites.
C. H. Bennett and G. Brassard, Quantum cryptography: public key distribution and coin tossing., Theor. Comput. Sci. 560
1984
Earlier work this paper cites.
A. K. Ekert, Quantum cryptography based on Bell’s theorem, Phys. Rev. Lett. 67
1991
Earlier work this paper cites.
A. K. Ekert, Quantum cryptography based on Bell’s theorem, Phys. Rev. Lett. 67
1991
Earlier work this paper cites.
D. R. Stinson, Universal hashing and authentication codes, Designs, Codes and Cryptography 4
1994
Earlier work this paper cites.
H. Krawczyk, LFSR-based hashing and authentication, in Advances in Cryptology - CRYPTO ’94 in Lecture Notes in Computer Science , Vol. 839 (Springer, 1994) pp. 129–139
1994
Earlier work this paper cites.
A. Shokrollahi, New sequences of linear time erasure codes approaching channel capacity, Proc. IEEE Int. Symp. Information Theory and its Applications, Honolulu, HI , 65 (1999)
1999
Earlier work this paper cites.
T. J. Richardson and R. L. Urbanke, The capacity of low-density parity-check codes under message-passing decoding, IEEE Trans. Inf. Theory. 47
2001
Earlier work this paper cites.
T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, Design of capacity-approaching irregular low-density parity-check codes, IEEE Trans. Inf. Theory. 47
2001
Earlier work this paper cites.
N. Gisin, G. Ribordy, W. Tittel, and H. Zbinden, Quantum cryptography, Rev. Mod. Phys. 74
2002
Earlier work this paper cites.
P. Oswald and A. Shokrollahi, Cappacity-achieving sequences for the erasure channel, IEEE Trans. Inf. Theory 48
2002
Earlier work this paper cites.
I. Sason and R. Urbanke, Parity-check density versus performance of binary linear block codes over memoryless symmetric channels, IEEE Trans. Inf. Theory 49
2003
Earlier work this paper cites.
R. Renner and S. Wolf, Unconditional authenticity and privacy from an arbitrarily weak secret, in Advances in Cryptology - CRYPTO ’03 in Lecture Notes in Computer Science (Springer, 2003) pp. 78–95
2003
Earlier work this paper cites.
D. Mayers and A. Yao, Self Testing Quantum Apparatus, Quantum Info. Comput. 4
2004
Earlier work this paper cites.
D. E. Hocevar, A reduced complexity decoder architecture via layered decoding of LDPC code, Proc. IEEE Workshop Signal processing and Systems (SIPS. 04), Austin, TX , 107 (2004)
2004
Earlier work this paper cites.
J. Barrett, L. Hardy, and A. Kent, No Signaling and Quantum Key Distribution, Phys. Rev. Lett. 95
2005
Earlier work this paper cites.
H. D. Pfister, I. Sason, and R. Urbanke, Capacity-achieving ensembles for the binary erasure channel with bounded complexity, IEEE Trans. Inf. Theory 51
2005
Earlier work this paper cites.
J. Zhang and M. Fossorier, Shuffled iterative decoding, IEEE Trans. Commun. 53
2005
Earlier work this paper cites.
A. Acín, N. Gisin, and L. Masanes, From Bell’s Theorem to Secure Quantum Key Distribution, Phys. Rev. Lett. 97
2006
Earlier work this paper cites.
J. Chen, D. He, and A. Jagmohan, Slepian-wolf code design via source-channel correspondence, in 2006 IEEE International Symposium on Information Theory (2006) pp. 2433–2437
2006
Earlier work this paper cites.
A. Acín, N. Brunner, N. Gisin, S. Massar, S. Pironio, and V. Scarani, Device-Independent Security of Quantum Cryptography against Collective Attacks, Phys. Rev. Lett. 98
2007
Earlier work this paper cites.
D. L. Moehring, P. Maunz, S. Olmschenk, K. C. Younge, D. N. Matsukevich, L.-M. Duan, and C. Monroe, Entanglement of Single-Atom Quantum Bits at a Distance, Nature 449
2007
Earlier work this paper cites.
J. Reháček, Z. Hradil, E. Knill, and A. I. Lvovsky, Diluted Maximum-Likelihood Algorithm for Quantum Tomography, Phys. Rev. A 75
2007
Earlier work this paper cites.
P. L’Ecuyer and R. Simard, Testu01: A c library for empirical testing of random number generators, ACM Trans. Math. Softw. 33
2007
Earlier work this paper cites.
W. Dai and T. Krovetz, VHASH Security, Cryptology ePrint Archive, http://eprint.iacr.org/2007/338
2007
Earlier work this paper cites.
Y. Zhao, C.-H. F. Fung, B. Qi, C. Chen, and H.-K. Lo, Quantum hacking: Experimental demonstration of time-shift attack against practical quantum-key-distribution systems, Phys. Rev. A 78
2008
Earlier work this paper cites.
Y. Zhao, C.-H. F. Fung, B. Qi, C. Chen, and H.-K. Lo, Quantum hacking: Experimental demonstration of time-shift attack against practical quantum-key-distribution systems, Phys. Rev. A 78
2008
Earlier work this paper cites.
T. Richardson and R. Urbanke, Modern Coding Theory (Cambridge: Cambridge University Press, 2008)
2008
Earlier work this paper cites.
V. Scarani, H. Bechmann-Pasquinucci, N. J. Cerf, M. Dušek, N. Lütkenhaus, and M. Peev, The security of practical quantum key distribution, Rev. Mod. Phys. 81
2009
Earlier work this paper cites.
L. Masanes, Universally Composable Privacy Amplification from Causality Constraints, Phys. Rev. Lett. 102
2009
Earlier work this paper cites.
P. Maunz, S. Olmschenk, D. Hayes, D. N. Matsukevich, L.-M. Duan, and C. Monroe, Heralded Quantum Gate between Remote Quantum Memories, Phys. Rev. Lett. 102
2009
Earlier work this paper cites.
S. Pironio, A. Acin, N. Brunner, N. Gisin, S. Massar, and V. Scarani, Device-independent quantum key distribution secure against collective attacks, New J. Phys. 11
2009
Earlier work this paper cites.
V. Scarani, H. Bechmann-Pasquinucci, N. J. Cerf, M. Dušek, N. Lütkenhaus, and M. Peev, The security of practical quantum key distribution, Rev. Mod. Phys. 81
2009
Earlier work this paper cites.
S. Pironio, A. Acin, N. Brunner, N. Gisin, S. Massar, and V. Scarani, Device-independent quantum key distribution secure against collective attacks, New J. Phys. 11
2009
Earlier work this paper cites.
E. Arikan, Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels, IEEE Trans. Inf. Theory. 55
2009
Earlier work this paper cites.
A. Amraoui, A. Montanari, T. Richardson, and R. Urbanke, Finite-Length Scaling for Iteratively Decoded LDPC Ensembles, IEEE Trans. Inf. Theory. 55
2009
Cited alongside, same era.
L. Lydersen, C. Wiechers, C. Wittmann, D. Elser, J. Skaar, and V. Makarov, Hacking commercial quantum cryptography systems by tailored bright illumination, Nat. Photonics 4
2010
Cited alongside, same era.
S. Pironio, A. Acín, S. Massar, A. Boyer de la Giroday, D. N. Matsukevich, P. Maunz, S. Olmschenk, D. Hayes, L. Luo, T. A. Manning, and C. Monroe, Random numbers certified by Bell’s theorem, Nature 464
2010
Cited alongside, same era.
L. Lydersen, C. Wiechers, C. Wittmann, D. Elser, J. Skaar, and V. Makarov, Hacking commercial quantum cryptography systems by tailored bright illumination, Nat. Photonics 4
2010
Cited alongside, same era.
M. Giustina, M. A. Versteegh, S. Wengerowsky, J. Handsteiner, A. Hochrainer, K. Phelan, F. Steinlechner, J. Kofler, J.-Å. Larsson, C. Abellán, et al. , Significant-loophole-free test of bell’s theorem with entangled photons, Phys. Rev. Lett. 115
2015
Later among the works it cites.
L. Wang and Y. Kim, Linear code duality between channel coding and Slepian-Wolf coding, in 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA (2015) pp. 147–152
2015
Later among the works it cites.
D. G. M. Mitchell, M. Lentmaier, and D. J. Costello, Spatially Coupled LDPC Codes Constructed From Protographs, IEEE Trans. Inform. Theory 61
2015
Later among the works it cites.
K. Heshami, D. G. England, P. C. Humphreys, P. J. Bustard, V. M. Acosta, J. Nunn, and B. J. Sussman, Quantum memories: emerging applications and recent advances, Journal of Modern Optics 63
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Pironio, A. Acín, S. Massar, A. Boyer de la Giroday, D. N. Matsukevich, P. Maunz, S. Olmschenk, D. Hayes, L. Luo, T. A. Manning, and C. Monroe, Random numbers certified by Bell’s theorem, Nature 464
2010
Cited alongside, same era.
Y. Polyanskiy, H. V. Poor, and S. Verdu, Channel Coding Rate in the Finite Blocklength Regime, IEEE Trans. Inf. Theory. 56
2010
Cited alongside, same era.
M. Lentmaier, A. Sridharan, D. J. Costello, and K. S. Zigangirov, Iterative Decoding Threshold Analysis for LDPC Convolutional Codes, IEEE Trans. Inf. Theory. 56
2010
Cited alongside, same era.
M. Tomamichel, R. Colbeck, and R. Renner, Duality Between Smooth Min- and Max-Entropies, IEEE Trans. on Inf. Theory 56
2010
Cited alongside, same era.
I. Gerhardt, Q. Liu, A. Lamas-Linares, J. Skaar, C. Kurtsiefer, and V. Makarov, Full-field implementation of a perfect eavesdropper on a quantum cryptography system, Nat. Commun. 2
2011
Cited alongside, same era.
H. Weier, H. Krauss, M. Rau, M. Fürst, S. Nauerth, and H. Weinfurter, Quantum eavesdropping without interception: an attack exploiting the dead time of single-photon detectors, New J. Phys. 13
2011
Cited alongside, same era.
M. Lettner, M. Mücke, S. Riedl, C. Vo, C. Hahn, S. Baur, J. Bochmann, S. Ritter, S. Dürr, and G. Rempe, Remote Entanglement between a Single Atom and a Bose-Einstein Condensate, Phys. Rev. Lett. 106
2011
Cited alongside, same era.
N. Sangouard, C. Simon, H. de Riedmatten, and N. Gisin, Quantum repeaters based on atomic ensembles and linear optics, Rev. Mod. Phys. 83
2011
Cited alongside, same era.
P. L. W. Maunz, High Optical Access Trap 2.0 , Technical Report SAND-2016-0796R (Sandia National Laboratories, Albuquerque, New Mexico, 2016)
2016
Later among the works it cites.
K. Heshami, D. G. England, P. C. Humphreys, P. J. Bustard, V. M. Acosta, J. Nunn, and B. J. Sussman, Quantum memories: emerging applications and recent advances, Journal of Modern Optics 63
2016
Later among the works it cites.
M. Tomamichel, Quantum Information Processing with Finite Resources, Springer International Publishing (2016)
2016
Later among the works it cites.
W. Rosenfeld, D. Burchardt, R. Garthoff, K. Redeker, N. Ortegel, M. Rau, and H. Weinfurter, Event-Ready Bell Test Using Entangled Atoms Simultaneously Closing Detection and Locality Loopholes, Phys. Rev. Lett. 119
2017
Later among the works it cites.
W. Rosenfeld, D. Burchardt, R. Garthoff, K. Redeker, N. Ortegel, M. Rau, and H. Weinfurter, Event-Ready Bell Test Using Entangled Atoms Simultaneously Closing Detection and Locality Loopholes, Phys. Rev. Lett. 119
2017
Later among the works it cites.
M. Tomamichel and A. Leverrier, A largely self-contained and complete security proof for quantum key distribution, Quantum 1
2017
Later among the works it cites.
R. Arnon-Friedman, F. Dupuis, O. Fawzi, R. Renner, and T. Vidick, Practical device-independent quantum cryptography via entropy accumulation, Nat. Commun. 9
2018
Later among the works it cites.
T. A. Wright, R. J. A. Francis-Jones, C. B. E. Gawith, J. N. Becker, P. M. Ledingham, P. G. R. Smith, J. Nunn, P. J. Mosley, B. Brecht, and I. A. Walmsley, Two-way photonic interface for linking the Sr+ transition at 422 nm to the telecommunication C band, Phys. Rev. Appl. 10
2018
Later among the works it cites.
R. Arnon-Friedman, F. Dupuis, O. Fawzi, R. Renner, and T. Vidick, Practical device-independent quantum cryptography via entropy accumulation, Nat. Commun. 9
2018
Later among the works it cites.
P. Bierhorst, E. Knill, S. Glancy, Y. Zhang, A. Mink, S. Jordan, A. Rommal, Y.-K. Liu, B. Christensen, S. W. Nam, M. J. Stevens, and L. K. Shalm, Experimentally Generated Randomness Certified by the Impossibility of Superluminal Signals, Nature 556
2018
Later among the works it cites.
G. Murta, S. B. van Dam, J. Ribeiro, R. Hanson, and S. Wehner, Towards a realization of device-independent quantum key distribution, Quantum Sci. Technol. 4
2019
Later among the works it cites.
G. Murta, S. B. van Dam, J. Ribeiro, R. Hanson, and S. Wehner, Towards a realization of device-independent quantum key distribution, Quantum Sci. Technol. 4
2019
Later among the works it cites.
R. Arnon-Friedman, R. Renner, and T. Vidick, Simple and Tight Device-Independent Security Proofs, SIAM J. Comput. 48
2019
Later among the works it cites.
F. Dupuis and O. Fawzi, Entropy Accumulation With Improved Second-Order Term, IEEE Trans. Inf. Theory 65
2019
Later among the works it cites.
M. Ho, P. Sekatski, E. Y.-Z. Tan, R. Renner, J.-D. Bancal, and N. Sangouard, Noisy Preprocessing Facilitates a Photonic Realization of Device-Independent Quantum Key Distribution, Phys. Rev. Lett. 124
2020
Later among the works it cites.
F. Dupuis, O. Fawzi, and R. Renner, Entropy Accumulation, Commun. Math. Phys. 379
2020
Later among the works it cites.
2020
Later among the works it cites.
L. J. Stephenson, D. P. Nadlinger, B. C. Nichol, S. An, P. Drmota, T. G. Ballance, K. Thirumalai, J. F. Goodwin, D. M. Lucas, and C. J. Ballance, High-Rate, High-Fidelity Entanglement of Qubits Across an Elementary Quantum Network, Phys. Rev. Lett. 124
2020
Later among the works it cites.
S. Pirandola, U. L. Andersen, L. Banchi, M. Berta, D. Bunandar, R. Colbeck, D. Englund, T. Gehring, C. Lupo, C. Ottaviani, J. L. Pereira, M. Razavi, J. S. Shaari, M. Tomamichel, V. C. Usenko, G. Vallone, P. Villoresi, and P. Wallden, Advances in quantum cryptography, Adv. Opt. Photon. 12
2020
Later among the works it cites.
L. J. Stephenson, D. P. Nadlinger, B. C. Nichol, S. An, P. Drmota, T. G. Ballance, K. Thirumalai, J. F. Goodwin, D. M. Lucas, and C. J. Ballance, High-Rate, High-Fidelity Entanglement of Qubits Across an Elementary Quantum Network, Phys. Rev. Lett. 124
2020
Later among the works it cites.
S. Pirandola, U. L. Andersen, L. Banchi, M. Berta, D. Bunandar, R. Colbeck, D. Englund, T. Gehring, C. Lupo, C. Ottaviani, J. L. Pereira, M. Razavi, J. S. Shaari, M. Tomamichel, V. C. Usenko, G. Vallone, P. Villoresi, and P. Wallden, Advances in quantum cryptography, Adv. Opt. Photon. 12
2020
Later among the works it cites.
M. Kessler and R. Arnon-Friedman, Device-independent randomness amplification and privatization, IEEE Journal on Selected Areas in Information Theory 1
2020
Later among the works it cites.
2020
Later among the works it cites.
F. Dupuis, O. Fawzi, and R. Renner, Entropy Accumulation, Commun. Math. Phys. 379
2020
Later among the works it cites.
R. Schwonnek, K. T. Goh, I. W. Primaatmaja, E. Y.-Z. Tan, R. Wolf, V. Scarani, and C. C.-W. Lim, Device-independent quantum key distribution with random key basis, Nat. Commun. 12
2021
Closest in time.
E. Woodhead, A. Acín, and S. Pironio, Device-independent quantum key distribution with asymmetric CHSH inequalities, Quantum 5
2021
Closest in time.
P. Sekatski, J.-D. Bancal, X. Valcarce, E.-Z. Tan, R. Renner, and N. Sangouard, Device-independent quantum key distribution from generalized CHSH inequalities, Quantum 5
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
W.-Z. Liu, M.-H. Li, S. Ragy, S.-R. Zhao, B. Bai, Y. Liu, P. J. Brown, J. Zhang, R. Colbeck, J. Fan, Q. Zhang, and J.-W. Pan, Device-independent randomness expansion against quantum side information, Nat. Phys. 17
2021
Closest in time.
C. Portmann and R. Renner, Security in Quantum Cryptography, arXiv:2102.00021 (2021)
2021
Closest in time.
J. Schupp, V. Krcmarsky, V. Krutyanskiy, M. Meraner, T. Northup, and B. Lanyon, Interface between Trapped-Ion Qubits and Traveling Photons with Close-to-Optimal Efficiency, PRX Quantum 2
2021
Closest in time.
S. Bourdeauducq et al. , m-labs/artiq: 6.0 (Version 6.0) (2021)
2021
Closest in time.
C. Portmann and R. Renner, Security in Quantum Cryptography, arXiv:2102.00021 (2021)
2021
Closest in time.
W.-Z. Liu, M.-H. Li, S. Ragy, S.-R. Zhao, B. Bai, Y. Liu, P. J. Brown, J. Zhang, R. Colbeck, J. Fan, Q. Zhang, and J.-W. Pan, Device-independent randomness expansion against quantum side information, Nat. Phys. 17
2021
Closest in time.