The DOI matches its Crossref record; 327 of the 327 references it cites were found in a registry or an index.
Security in quantum cryptography
Open accessAbstract
Secure communications is a vital need of the world, and the basic features of quantum mechanics seemingly offer fundamental new tools for achieving this security. But do these tools really work? This review gives due attention to the real-world problems with experimental quantum cryptography, but the heart of the review is an in-depth survey of the analyses developed to prove the security of the basic quantum techniques introduced by Wiesner, Ekert, Bennett, and Brassard. A broader set of cryptographic tasks have quantum aspects which are also discussed here.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Items 201–327 of 327
Unconditionally Secure Key Distribution Based on Two Nonorthogonal States
Tamaki, K., Koashi, M., & Imoto, N. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.167904 · Cited by 160
Time-shift attack in practical quantum cryptosystems
Qi, B., Fung, C.-H. F., Lo, H.-K., & Ma, F.-X. (2007) · Quantum Information and Computation · doi:10.26421/qic7.1-2-3 · Cited by 159
Toward a general theory of quantum games
Gutoski, G., & Watrous, J. (2006) · Cited by 156
Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
Maurer, U. M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-27375-9_3 · Cited by 155
Chandran, N., Goyal, V., Moriarty, R., & Ostrovsky, R. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03356-8_23 · Cited by 154
Advances in Cryptology — CRYPTO '97
Kaliski, B. S. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052223 · Cited by 154
Security of Quantum Cryptography against Collective Attacks
Biham, E., & Mor, T. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.2256 · Cited by 153
The ultimate physical limits of privacy
EKERT, A. K., & Renner, R. (2014) · Nature · doi:10.1038/nature13132 · Cited by 151
Self-citationTowards Quantum Gravity: A Framework for Probabilistic Theories with Non-Fixed Causal Structure
Hardy, L. (2006) · CERN Document Server (European Organization for Nuclear Research) · Cited by 150
Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
Kent, A. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.130501 · Cited by 148
Koashi, M. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.120501 · Cited by 146
Small Accessible Quantum Information Does Not Imply Security
König, R., Renner, R., Bariska, A., & Maurer, U. M. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.140502 · Cited by 144
Self-citationComposability in quantum cryptography
Müller-Quade, J., & Renner, R. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/8/085006 · Cited by 143
Self-citationCryptography from Noisy Storage
Wehner, S., Schaffner, C., & Terhal, B. M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.220502 · Cited by 141
Cryptography in the Bounded-Quantum-Storage Model
Damgård, I., Fehr, S., Salvail, L., & Schaffner, C. (2008) · SIAM Journal on Computing · doi:10.1137/060651343 · Cited by 139
Device-Independent Quantum Key Distribution with Local Bell Test
Lim, C. C. W., Portmann, C., Tomamichel, M., Renner, R., & Gisin, N. (2013) · Physical Review X · doi:10.1103/physrevx.3.031006 · Cited by 137
Self-citationAvoiding the blinding attack in QKD
Yuan, Z. L., Dynes, J. F., & Shields, A. J. (2010) · Nature Photonics · doi:10.1038/nphoton.2010.269 · Cited by 136
Fast and simple one-way Quantum Key Distribution
Stucki, D., Brunner, N., Gisin, N., Scarani, V., & Zbinden, H. (2005) · Archive ouverte UNIGE (University of Geneva) · Cited by 135
Rogaway, P. (2006) · Lecture notes in computer science · doi:10.1007/11958239_14 · Cited by 126
Broadbent, A., Gutoski, G., & Stebila, D. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40084-1_20 · Cited by 126
The combinatorics of authentication and secrecy codes
Stinson, D. R. (1990) · Journal of Cryptology · doi:10.1007/bf02252868 · Cited by 125
Information Gain vs. State Disturbance in Quantum Theory
Fuchs, C. A. (1998) · Fortschritte der Physik · doi:10.1002/(sici)1521-3978(199806)46:4/5<535::aid-prop535>3.0.co;2-0 · Cited by 125
Secure assisted quantum computation
Childs, A. M. (2005) · CERN Document Server (European Organization for Nuclear Research) · doi:10.5555/2011670.2011674 · Cited by 123
Composability in quantum cryptographyPreprint
Renner, R. (2016) · Cited by 122
Self-citationA General Composition Theorem for Secure Reactive Systems
Michael Backes, A., Pfitzmann, B., & Waidner, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24638-1_19 · Cited by 119
A Generic Security Proof for Quantum Key DistributionPreprint
Christandl, M., Renner, R., & EKERT, A. K. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0402131 · Cited by 114
Self-citationControlling passively quenched single photon detectors by bright light
Makarov, V. (2009) · NORA - Norwegian Open Research Archives · Cited by 114
On the Power of Quantum Memory
König, R., Maurer, U. M., & Renner, R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850087 · Cited by 113
Self-citationConcise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths
Hayashi, M., & Tsurumaru, T. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/9/093014 · Cited by 111
Advances in Cryptology – CRYPTO 2013
Canetti, R., & Garay, J. A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40084-1 · Cited by 110
Zuckerman, D. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89574 · Cited by 108
The reactive simulatability (RSIM) framework for asynchronous systems
Michael Backes, A., Pfitzmann, B., & Waidner, M. (2007) · Information and Computation · doi:10.1016/j.ic.2007.05.002 · Cited by 107
Unconditional Security of a Three State Quantum Key Distribution Protocol
Boileau, J.-C., Tamaki, K., Batuwantudawe, J., Laflamme, R., & Renes, J. M. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.040503 · Cited by 107
A proof of the security of quantum key distribution (extended abstract)
Biham, E., Boyer, M., Boykin, P. O., Mor, T., & Roychowdhury, V. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335406 · Cited by 103
Secure Multi-Party Computation with Identifiable Abort
Ishai, Y., Ostrovsky, R., & Zikas, V. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44381-1_21 · Cited by 102
Advances in Cryptology - EUROCRYPT 2006
Serge Vaudenay, B., & 2006, E. (2006) · Lecture notes in computer science · doi:10.1007/11761679 · Cited by 102
Finite-key security against coherent attacks in quantum key distribution
Sheridan, L., Le, T. P., & Scarani, V. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/12/123019 · Cited by 99
Composable Security of Delegated Quantum Computation
Dunjko, V., Fitzsimons, J. F., Portmann, C., & Renner, R. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45608-8_22 · Cited by 99
Self-citation(2014) · doi:10.1007/978-3-642-55220-5 · Cited by 97
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Mitchell, J. C., Ramanathan, A., Scedrov, A., & Teague, V. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.10.044 · Cited by 93
Causal Boxes: Quantum Information-Processing Systems Closed under Composition
Portmann, C., Matt, C., Maurer, U. M., Renner, R., & Tackmann, B. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2676805 · Cited by 93
Self-citationRealistic noise-tolerant randomness amplification using finite number of devices
Brandão, F. G. S. L., Ramanathan, R., Grudka, A., Horodecki, K., Horodecki, M., Horodecki, P., Szarek, T., & Wojewódka–Ściążko, H. (2016) · Nature Communications · doi:10.1038/ncomms11345 · Cited by 92
Renes, J. M., & Renner, R. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2177589 · Cited by 91
Self-citationSecure multiparty quantum computation with (only) a strict honest majority
Ben-Or, M., Crépeau, C., Gottesman, D., Hassidim, A., & Smith, A. (2008) · Cited by 91
Physical Randomness Extractors: Generating Random Numbers with Minimal AssumptionsPreprint
Chung, K.-M., Shi, Y., & Wu, X. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.4797 · Cited by 89
Miller, C. A., & Shi, Y. (2014) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2591796.2591843 · Cited by 88
Information reconciliation for QKD
Elkouss, D., Martínez-Mateo, J., & Martín, V. (2011) · Quantum Information and Computation · doi:10.26421/qic11.3-4-3 · Cited by 86
Private Quantum Channels and the Cost of Randomizing Quantum InformationPreprint
Mosca, M., Tapp, A., & de Wolf, R. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0003101 · Cited by 86
Security of Quantum Key Distribution against All Collective Attacks
Available, N., Available, N., Available, N., van de Graaf, & Available, N. (2002) · Algorithmica · doi:10.1007/s00453-002-0973-6 · Cited by 86
Computationally-Secure and Composable Remote State Preparation
Gheorghiu, A., & Vidick, T. (2019) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2019.00066 · Cited by 86
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Küsters, R. (2006) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2006.30 · Cited by 85
Key Recycling in Authentication
Portmann, C. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2317312 · Cited by 84
Self-citationUnifying Classical and Quantum Key Distillation
Christandl, M., EKERT, A. K., Horodecki, M., Horodecki, P., Oppenheim, J., & Renner, R. (2007) · Springer eBooks · doi:10.1007/978-3-540-70936-7_25 · Cited by 82
Self-citationUnconditionally secure key distillation from multiphotons
Tamaki, K., & Lo, H. (2006) · Physical Review A · doi:10.1103/physreva.73.010302 · Cited by 82
Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret
Renner, R., & Wolf, S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_5 · Cited by 82
Self-citationHorodecki, K., Horodecki, M., Horodecki, P., Leung, D., & Oppenheim, J. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921870 · Cited by 81
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
Vazirani, U., & Vidick, T. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2213984 · Cited by 80
GNUC: A new universal composability framework
Hofheinz, D., & Shoup, V. (2015) · Journal of Cryptology · doi:10.1007/s00145-013-9160-y · Cited by 80
The operator tensor formulation of quantum theory
Hardy, L. (2012) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2011.0326 · Cited by 79
Actively Secure Two-Party Evaluation of Any Quantum Operation
Dupuis, F., Nielsen, J. B., & Salvail, L. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32009-5_46 · Cited by 78
Differential phase-shift quantum key distribution
Inoue, K., Waks, E., & Yamamoto, Y. (2002) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.483037 · Cited by 77
Free variables and local causality
Bell, J. S. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511815676.014 · Cited by 72
A classical leash for a quantum system
Reichardt, B. W., Unger, F., & Vazirani, U. V. (2013) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2422436.2422473 · Cited by 72
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
Ambainis, A., & Smith, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27821-4_23 · Cited by 72
Device-Independent Quantum Key Distribution with Local Bell Test
Lim, C. C. W., Portmann, C., Tomamichel, M., Renner, R., & Gisin, N. (2013) · Archive ouverte UNIGE (University of Geneva) · doi:10.3929/ethz-b-000070652 · Cited by 72
Self-citationDevice-Independent Randomness Amplification and Privatization
Kessler, M., & Arnon-Friedman, R. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.3012498 · Cited by 71
Advantage Distillation for Device-Independent Quantum Key Distribution
Tan, E. Y.-Z., Lim, C. C. W., & Renner, R. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.020502 · Cited by 71
Self-citationCharacterization of Security Notions for Probabilistic Private-Key Encryption
Katz, J. I., & Yung, M. M. (2005) · Journal of Cryptology · doi:10.1007/s00145-005-0310-8 · Cited by 68
The Bounded-Storage Model in the Presence of a Quantum Adversary
Konig, R. T., & Terhal, B. M. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913245 · Cited by 65
Quantum Position Verification in the Random Oracle Model
Unruh, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44381-1_1 · Cited by 65
Everlasting Multi-party Computation
Unruh, D. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40084-1_22 · Cited by 64
Simulatable security for quantum protocolsPreprint
Unruh, D. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0409125 · Cited by 62
Advances in Cryptology – CRYPTO 2008
Hutchison, D., Weikum, G., Wagner, D., et al. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85174-5 · Cited by 61
On a measure of distance for quantum strategies
Gutoski, G. (2012) · Journal of Mathematical Physics · doi:10.1063/1.3693621 · Cited by 59
The operator tensor formulation of quantum theoryPreprint
Hardy, L. (2016) · Cited by 59
Renes, J. M., & Renner, R. (2016) · Cited by 58
Self-citationNielsen, J. B., & Coron, J.-S. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56620-7 · Cited by 56
Secure Identification and QKD in the Bounded-Quantum-Storage Model
Damgård, I., Fehr, S., Salvail, L., & Schaffner, C. (2007) · Springer eBooks · doi:10.1007/978-3-540-74143-5_19 · Cited by 54
Operational interpretation of coherence in quantum key distribution
Ma, J., Zhou, Y., Yuan, X., & Ma, X. (2019) · Physical Review A · doi:10.1103/physreva.99.062325 · Cited by 54
Nonmalleable encryption of quantum information
Ambainis, A., Bouda, J., & Winter, A. (2009) · Journal of Mathematical Physics · doi:10.1063/1.3094756 · Cited by 53
Method for decoupling error correction from privacy amplification
Lo, H. (2003) · New Journal of Physics · doi:10.1088/1367-2630/5/1/336 · Cited by 50
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
Canetti, R., Cheung, L., Kaynar, D., Liskov, M. D., Lynch, N., Pereira, O., & Segala, R. (2006) · Lecture notes in computer science · doi:10.1007/11864219_17 · Cited by 49
Task-structured probabilistic I/O automata
Canetti, R., Cheung, L., Kaynar, D., Liskov, M. D., Lynch, N., Pereira, O., & Segala, R. (2017) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2017.09.007 · Cited by 49
Quantum Authentication with Key Recycling
Portmann, C. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56617-7_12 · Cited by 49
Self-citationOn a measure of distance for quantum strategiesPreprint
Gutoski, G. (2016) · Cited by 49
Leftover Hashing against quantum side information
Tomamichel, M., Renner, R., Schaffner, C., & Smith, A. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513652 · Cited by 48
Self-citationGeneral Security Definition and Composability for Quantum & Classical ProtocolsPreprint
Ben-Or, M., & Mayers, D. (2004) · arXiv (Cornell University) · Cited by 46
"Circular type" quantum key distribution
Nishioka, T., Ishizuka, H., Hasegawa, T., & Abe, J. (2002) · IEEE Photonics Technology Letters · doi:10.1109/68.992616 · Cited by 46
Finite-key analysis for twin-field quantum key distribution with composable security
Yin, H.-L., & Chen, Z.-B. (2019) · Scientific Reports · doi:10.1038/s41598-019-53435-4 · Cited by 45
Robust cryptography in the noisy-quantum-storage model
Schaffner, C., Terhal, B. M., & Wehner, S. (2009) · Quantum Information and Computation · doi:10.26421/qic9.11-12-4 · Cited by 44
New Security Notions and Feasibility Results for Authentication of Quantum Data
Garg, S., Yuen, H., & Zhandry, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63715-0_12 · Cited by 44
Advances in Cryptology – CRYPTO 2019
(2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26954-8 · Cited by 44
Mennink, B. J. M., & Moriai, S. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64837-4 · Cited by 43
Unforgeable Quantum Encryption
Alagic, G., Gagliardoni, T., & Majenz, C. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78372-7_16 · Cited by 41
Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
Fehr, S., & Schaffner, C. (2008) · Springer eBooks · doi:10.1007/978-3-540-78524-8_26 · Cited by 40
Advances in Cryptology -- ASIACRYPT 2015
Iwata, T., & Cheon, J. H. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48797-6 · Cited by 37
Certifiable Quantum Dice - Or, testable exponential randomness expansionPreprint
Vazirani, U. V., & Vidick, T. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1111.6054 · Cited by 33
Approximate Randomization of Quantum States With Fewer Bits of Key
Dickinson, P. A., & Nayak, A. (2006) · AIP conference proceedings · doi:10.1063/1.2400876 · Cited by 32
Advances in Cryptology -- CRYPTO 2015
Gennaro, R., & Robshaw, M. J. B. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47989-6 · Cited by 32
Confidentiality and Integrity: A Constructive Perspective
Maurer, U. M., Rüedlinger, A., & Tackmann, B. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28914-9_12 · Cited by 30
Semi-device-independent quantum money with coherent states
Bozzio, M., Diamanti, E., & Grosshans, F. (2019) · Physical Review A · doi:10.1103/physreva.99.022336 · Cited by 30
Blind quantum computing with two almost identical statesPreprint
Dunjko, V., & Kashefi, E. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1604.01586 · Cited by 24
Semi-device-independent quantum money
Horodecki, K., & Stankiewicz, M. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab6872 · Cited by 24
A modular framework for randomness extraction based on Trevisan's construction
Mauerer, W., Portmann, C., & Scholz, V. B. (2012) · arXiv · doi:10.48550/arxiv.1212.0520 · Cited by 23
Self-citationAdvances in Cryptology – CRYPTO 2022
Dodis, Y., & Shrimpton, T. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15979-4 · Cited by 23
The device-independent outlook on quantum physics (lecture notes on the power of Bell's theorem)Preprint
Scarani, V. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1303.3081 · Cited by 22
Composable security in relativistic quantum cryptography
Vilasini, V., Portmann, C., & del Rio, L. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab0e3b · Cited by 22
Self-citationConstructing Confidential Channels from Authenticated Channels—Public-Key Encryption Revisited
Coretti, S., Maurer, U. M., & Tackmann, B. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42033-7_8 · Cited by 21
The Universal Composable Security of Quantum Message Authentication with Key RecylingPreprint
Hayden, P. M., Leung, D., & Mayers, D. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.09434 · Cited by 21
Multi-Source Randomness Extractors Against Quantum Side Information, and their ApplicationsPreprint
Chung, K.-M., Li, X., & Wu, X. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1411.2315 · Cited by 19
Weak Locking Capacity of Quantum Channels Can be Much Larger Than Private Capacity
Winter, A. (2015) · Journal of Cryptology · doi:10.1007/s00145-015-9215-3 · Cited by 19
Secure multiparty quantum computation with few qubits
Lipińska, V., Ribeiro, J., & Wehner, S. (2020) · Physical Review A · doi:10.1103/physreva.102.022405 · Cited by 18
Efficient Simulation for Quantum Message Authentication
Wainewright, E. (2016) · uO Research (University of Ottawa) · doi:10.20381/ruor-171 · Cited by 18
Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort
Alon, B., Chung, H., Chung, K.-M., Huang, M.-Y., Lee, Y., & Shen, Y.-C. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84242-0_16 · Cited by 18
THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT
Renes, J. M. (2013) · International Journal of Quantum Information · doi:10.1142/s0219749913300027 · Cited by 16
Computational Notions of Quantum Min-EntropyPreprint
Chen, Y.-H., Chung, K.-M., Lai, C., Vadhan, S., & Wu, X. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.07309 · Cited by 15
Better short-seed quantum-proof extractors
Ben-Aroya, A., & Ta‐Shma, A. (2011) · Theoretical Computer Science · doi:10.1016/j.tcs.2011.11.036 · Cited by 13
Quantum-Proof Randomness Extractors via Operator Space Theory
Berta, M., Fawzi, O., & Scholz, V. B. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2627531 · Cited by 12
Trushechkin, A. S. (2020) · Quantum Electronics · doi:10.1070/qel17283 · Cited by 12
Reductions to IID in Device-independent Quantum Information Processing
Arnon-Friedman, R. (2018) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000298420 · Cited by 11
Quantum theory with bold operator tensors
Hardy, L. (2015) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2014.0239 · Cited by 8
Relativistic quantum cryptographyPreprint
Kaniewski, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.00602 · Cited by 7
Composable and Finite Computational Security of Quantum Message Transmission
Banfi, F., Maurer, U. M., Portmann, C., & Zhu, J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-36030-6_12 · Cited by 7
Self-citation(Quantum) Min-Entropy ResourcesPreprint
Portmann, C. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.10595 · Cited by 4
Self-citationAggarwal, D., Chung, K.-M., Lin, H.-H., & Vidick, T. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17656-3_16 · Cited by 4
Are quantum cryptographic security claims vacuous?Preprint
Renes, J. M., & Renner, R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.11961 · Cited by 3
Self-citationSecurity Definitions for Hash Functions: Combining UCE and Indifferentiability
Jost, D., & Maurer, U. M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-98113-0_5 · Cited by 2
Cited by
Quantum repeaters: From quantum networks to the quantum internet
Azuma, K., Economou, S. E., Elkouss, D., Hilaire, P., Jiang, L., Lo, H.-K., & Tzitrin, I. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045006 · Cited by 559
Colloquium : Quantum batteries
Campaioli, F., Gherardini, S., Quach, J. Q., Polini, M., & Andolina, G. M. (2024) · Reviews of Modern Physics · doi:10.1103/revmodphys.96.031001 · Cited by 268
A Comprehensive Review of Encryption and Protection Techniques for Healthcare Data
Nedunoori, V. (2025) · Information Systems Engineering and Management · doi:10.1007/978-3-031-84404-1_8 · Cited by 13
Metadata
- Authors
- Portmann, C., & Renner, R.
- Venue
- Reviews of Modern Physics
- Publisher
- American Physical Society (APS)
- Published
- 2022-06-29
- Volume
- 94
- Issue
- 2
- ISSN
- 0034-6861 (ISSN-L)
- 1539-0756
- OpenAlex
- W3128474234
- Cited by
- 390
- References
- 327
- FWCI
- 23.75
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.