{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:24:41Z","timestamp":1766049881017},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T00:00:00Z","timestamp":1643068800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T00:00:00Z","timestamp":1643068800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00145-021-09418-8","type":"journal-article","created":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T18:02:22Z","timestamp":1643133742000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Semi-quantum Money"],"prefix":"10.1007","volume":"35","author":[{"given":"Roy","family":"Radian","sequence":"first","affiliation":[]},{"given":"Or","family":"Sattath","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,25]]},"reference":[{"key":"9418_CR1","doi-asserted-by":"publisher","unstructured":"S.\u00a0Aaronson, Quantum copy-protection and quantum money, in Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15\u201318 July 2009 (IEEE Computer Society, 2009), pp. 229\u2013242. arXiv:1110.5353. https:\/\/doi.org\/10.1109\/CCC.2009.42","DOI":"10.1109\/CCC.2009.42"},{"key":"9418_CR2","doi-asserted-by":"publisher","unstructured":"S.\u00a0Aaronson, Shadow tomography of quantum states, in I.\u00a0Diakonikolas, D.\u00a0Kempe, M.\u00a0Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25\u201329, 2018 (ACM, 2018), pp. 325\u2013338. arXiv:1711.01053. https:\/\/doi.org\/10.1145\/3188745.3188802","DOI":"10.1145\/3188745.3188802"},{"key":"9418_CR3","doi-asserted-by":"publisher","unstructured":"S.\u00a0Aaronson, P.\u00a0Christiano, Quantum money from hidden subspaces. Theory of Comput. 9, 349\u2013401 (2013). arXiv:1203.4740. https:\/\/doi.org\/10.4086\/toc.2013.v009a009","DOI":"10.4086\/toc.2013.v009a009"},{"key":"9418_CR4","doi-asserted-by":"crossref","unstructured":"G.\u00a0Alagic, A.M. Childs, A.B. Grilo, S.-H. Hung, Non-interactive classical verification of quantum computation (2019). arXiv:1911.08101","DOI":"10.1007\/978-3-030-64381-2_6"},{"key":"9418_CR5","doi-asserted-by":"publisher","unstructured":"G.\u00a0Alagic, C.\u00a0Majenz, A.\u00a0Russell, Efficient simulation of random states and random unitaries, in A.\u00a0Canteaut, Y.\u00a0Ishai, editors, Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, Part III, volume 12107 of Lecture Notes in Computer Science (Springer, 2020), pp. 759\u2013787. https:\/\/doi.org\/10.1007\/978-3-030-45727-3_26. arXiv:1910.05729","DOI":"10.1007\/978-3-030-45727-3_26"},{"key":"9418_CR6","doi-asserted-by":"publisher","unstructured":"R.\u00a0Amiri, J.M. Arrazola, Quantum money with nearly optimal error tolerance. Phys. Rev. A, 95(6) (2017). https:\/\/doi.org\/10.1103\/physreva.95.062334","DOI":"10.1103\/physreva.95.062334"},{"key":"9418_CR7","doi-asserted-by":"publisher","unstructured":"R.\u00a0Amos, M.\u00a0Georgiou, A.\u00a0Kiayias, M.\u00a0Zhandry, One-shot signatures and applications to hybrid quantum\/classical authentication, in K.\u00a0Makarychev, Y.\u00a0Makarychev, M.\u00a0Tulsiani, G.\u00a0Kamath, J.\u00a0Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22\u201326, 2020 (ACM, 2020), pp. 255\u2013268. https:\/\/doi.org\/10.1145\/3357713.3384304","DOI":"10.1145\/3357713.3384304"},{"key":"9418_CR8","doi-asserted-by":"crossref","unstructured":"C.\u00a0Badertscher, A.\u00a0Cojocaru, L.\u00a0Colisson, E.\u00a0Kashefi, D.\u00a0Leichtle, A.\u00a0Mantri, P.\u00a0Wallden, Security limitations of classical-client delegated quantum computing (2020). arXiv:2007.01668","DOI":"10.1007\/978-3-030-64834-3_23"},{"key":"9418_CR9","doi-asserted-by":"publisher","unstructured":"A.\u00a0Banerjee, C.\u00a0Peikert, A.\u00a0Rosen, Pseudorandom functions and lattices, in D.\u00a0Pointcheval and T.\u00a0Johansson, editors, Advances in Cryptology - EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15\u201319, 2012. Proceedings, volume 7237 of Lecture Notes in Computer Science (Springer, 2012), pp. 719\u2013737. https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"9418_CR10","doi-asserted-by":"publisher","unstructured":"M.\u00a0Bellare, R.\u00a0Impagliazzo, M.\u00a0Naor, Does parallel repetition lower the error in computationally sound protocols? In 38th Annual Symposium on Foundations of Computer Science, FOCS \u201997, Miami Beach, Florida, USA, October 19\u201322, 1997 (IEEE Computer Society, 1997), pp. 374\u2013383. https:\/\/doi.org\/10.1109\/SFCS.1997.646126","DOI":"10.1109\/SFCS.1997.646126"},{"key":"9418_CR11","unstructured":"S.\u00a0Ben-David, O.\u00a0Sattath, Quantum tokens for digital signatures (2016). arXiv:1609.09047"},{"key":"9418_CR12","doi-asserted-by":"publisher","unstructured":"D.\u00a0Boneh, M.\u00a0Zhandry, Quantum-secure message authentication codes, in T.\u00a0Johansson, P.Q. Nguyen, editors, Advances in Cryptology - EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26\u201330, 2013. Proceedings, volume 7881 of Lecture Notes in Computer Science (Springer, 2013), pp. 592\u2013608. https:\/\/doi.org\/10.1007\/978-3-642-38348-9_35","DOI":"10.1007\/978-3-642-38348-9_35"},{"key":"9418_CR13","doi-asserted-by":"publisher","unstructured":"Z.\u00a0Brakerski, P.\u00a0Christiano, U.\u00a0Mahadev, U.V. Vazirani, T.\u00a0Vidick. A cryptographic test of quantumness and certifiable randomness from a single quantum device, in M.\u00a0Thorup, editor, 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7\u20139, 2018 (IEEE Computer Society, 2018), pp. 320\u2013331. arXiv:1804.00640. https:\/\/doi.org\/10.1109\/FOCS.2018.00038","DOI":"10.1109\/FOCS.2018.00038"},{"key":"9418_CR14","doi-asserted-by":"publisher","unstructured":"A.\u00a0Broadbent, C.\u00a0Schaffner, Quantum cryptography beyond quantum key distribution. Des. Codes Cryptogr. 78(1), 351\u2013382 (2016). https:\/\/doi.org\/10.1007\/s10623-015-0157-4. arXiv:1510.06120","DOI":"10.1007\/s10623-015-0157-4"},{"key":"9418_CR15","doi-asserted-by":"publisher","unstructured":"R.\u00a0Canetti, S.\u00a0Halevi, M.\u00a0Steiner, Hardness amplification of weakly verifiable puzzles, in J.\u00a0Kilian, editor, Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10\u201312, 2005, Proceedings, volume 3378 of Lecture Notes in Computer Science (Springer, 2005), pp. 17\u201333. https:\/\/doi.org\/10.1007\/978-3-540-30576-7_2","DOI":"10.1007\/978-3-540-30576-7_2"},{"key":"9418_CR16","doi-asserted-by":"publisher","unstructured":"A.\u00a0Cojocaru, L.\u00a0Colisson, E.\u00a0Kashefi, P.\u00a0Wallden, Qfactory: Classically-instructed remote secret qubits preparation, in S.D. Galbraith and S.\u00a0Moriai, editors, Advances in Cryptology - ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8\u201312, 2019, Proceedings, Part I, volume 11921 of Lecture Notes in Computer Science (Springer, 2019), pp. 615\u2013645. arXiv:1904.06303. https:\/\/doi.org\/10.1007\/978-3-030-34578-5_22","DOI":"10.1007\/978-3-030-34578-5_22"},{"key":"9418_CR17","unstructured":"A.\u00a0Coladangelo, Smart contracts meet quantum cryptography (2019). arXiv:1902.05214"},{"key":"9418_CR18","doi-asserted-by":"publisher","unstructured":"A.\u00a0Coladangelo, O.\u00a0Sattath, A quantum money solution to the blockchain scalability problem. Quantum 4, 297 (2020). https:\/\/doi.org\/10.22331\/q-2020-07-16-297","DOI":"10.22331\/q-2020-07-16-297"},{"issue":"6","key":"9418_CR19","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0375-9601(82)90084-6","volume":"92","author":"D Dieks","year":"1982","unstructured":"D.\u00a0Dieks, Communication by EPR devices. Phys. Lett. A 92(6), 271\u2013272 (1982). https:\/\/doi.org\/10.1016\/0375-9601(82)90084-6","journal-title":"Phys. Lett. A"},{"key":"9418_CR20","unstructured":"V.\u00a0Dunjko, E.\u00a0Kashefi, Blind quantum computing with two almost identical states (2016). arXiv:1604.01586"},{"key":"9418_CR21","doi-asserted-by":"publisher","unstructured":"E.\u00a0Farhi, D.\u00a0Gosset, A.\u00a0Hassidim, A.\u00a0Lutomirski, P.W. Shor, Quantum money from knots, in S.\u00a0Goldwasser, editor, Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8\u201310, 2012 (ACM, 2012), pp. 276\u2013289. arXiv:1004.5127. https:\/\/doi.org\/10.1145\/2090236.2090260","DOI":"10.1145\/2090236.2090260"},{"key":"9418_CR22","doi-asserted-by":"publisher","unstructured":"R.A. Friedman, R.\u00a0Renner, T.\u00a0Vidick, Simple and tight device-independent security proofs. SIAM J. Comput. 48(1), 181\u2013225 (2019). arXiv:1607.01797. https:\/\/doi.org\/10.1137\/18M1174726","DOI":"10.1137\/18M1174726"},{"key":"9418_CR23","doi-asserted-by":"publisher","unstructured":"T.\u00a0Gagliardoni, A.\u00a0H\u00fclsing, C.\u00a0Schaffner, Semantic security and indistinguishability in the quantum world, in M.\u00a0Robshaw and J.\u00a0Katz, editors, Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2016, Proceedings, Part III, volume 9816 of Lecture Notes in Computer Science (Springer, 2016), pp. 60\u201389. arXiv:1504.05255. https:\/\/doi.org\/10.1007\/978-3-662-53015-3_3","DOI":"10.1007\/978-3-662-53015-3_3"},{"key":"9418_CR24","doi-asserted-by":"publisher","unstructured":"D.\u00a0Gavinsky, Quantum money with classical verification, in Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26\u201329, 2012 (IEEE Computer Society, 2012), pp. 42\u201352. arXiv:1109.0372. https:\/\/doi.org\/10.1109\/CCC.2012.10","DOI":"10.1109\/CCC.2012.10"},{"key":"9418_CR25","doi-asserted-by":"publisher","unstructured":"M.\u00a0Georgiou, I.\u00a0Kerenidis, New constructions for quantum money, in 10th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2015, May 20\u201322, 2015, Brussels, Belgium (Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015), pp. 92\u2013110. https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2015.92","DOI":"10.4230\/LIPIcs.TQC.2015.92"},{"key":"9418_CR26","doi-asserted-by":"crossref","unstructured":"A.\u00a0Gheorghiu, T.\u00a0Vidick, Computationally-secure and composable remote state preparation (2019). arXiv:1904.06320","DOI":"10.1109\/FOCS.2019.00066"},{"key":"9418_CR27","doi-asserted-by":"publisher","unstructured":"O.\u00a0Goldreich, The Foundations of Cryptography - Volume 1, Basic Techniques (Cambridge University Press, 2001). https:\/\/doi.org\/10.1017\/CBO9780511546891","DOI":"10.1017\/CBO9780511546891"},{"key":"9418_CR28","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, The Foundations of Cryptography - Vol. 2, Basic Applications (Cambridge University Press, 2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"9418_CR29","doi-asserted-by":"publisher","unstructured":"K.\u00a0Horodecki, M.\u00a0Stankiewicz, Semi-device-independent quantum money. New J. Phys. 22(2), 023007 (2020). arXiv:1811.10552. https:\/\/doi.org\/10.1088\/1367-2630\/ab6872","DOI":"10.1088\/1367-2630\/ab6872"},{"key":"9418_CR30","doi-asserted-by":"publisher","unstructured":"Z.\u00a0Ji, Y.\u00a0Liu, F.\u00a0Song, Pseudorandom quantum states, in H.\u00a0Shacham and A.\u00a0Boldyreva, editors, Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part III, volume 10993 of Lecture Notes in Computer Science (Springer, 2018), pp. 126\u2013152. arXiv:1711.00385. https:\/\/doi.org\/10.1007\/978-3-319-96878-0_5","DOI":"10.1007\/978-3-319-96878-0_5"},{"key":"9418_CR31","doi-asserted-by":"crossref","unstructured":"J.\u00a0Katz, Y.\u00a0Lindell, Introduction to Modern Cryptography, Second Edition (CRC Press, 2014)","DOI":"10.1201\/b17668"},{"key":"9418_CR32","unstructured":"A.\u00a0Lutomirski, An online attack against Wiesner\u2019s quantum money (2010). arXiv:1010.0256"},{"key":"9418_CR33","unstructured":"A.\u00a0Lutomirski, Component mixers and a hardness result for counterfeiting quantum money (2011). arXiv:1107.0321"},{"key":"9418_CR34","unstructured":"A.\u00a0Lutomirski, S.\u00a0Aaronson, E.\u00a0Farhi, D.\u00a0Gosset, J.A. Kelner, A.\u00a0Hassidim, P.W. Shor, Breaking and making quantum money: Toward a new quantum cryptographic protocol, in A.C. Yao, editor, Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 5\u20137, 2010. Proceedings (Tsinghua University Press, 2010), pp. 20\u201331. http:\/\/conference.iiis.tsinghua.edu.cn\/ICS2010\/content\/papers\/2.html. arXiv:0912.3825"},{"key":"9418_CR35","doi-asserted-by":"publisher","unstructured":"U.\u00a0Mahadev, Classical homomorphic encryption for quantum circuits, in M.\u00a0Thorup, editor, 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7\u20139, 2018 (IEEE Computer Society, 2018), pp. 332\u2013338. arXiv:1708.02130. https:\/\/doi.org\/10.1109\/FOCS.2018.00039","DOI":"10.1109\/FOCS.2018.00039"},{"key":"9418_CR36","doi-asserted-by":"publisher","unstructured":"U.\u00a0Mahadev, Classical verification of quantum computations, in M.\u00a0Thorup, editor, 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7\u20139, 2018 (IEEE Computer Society, 2018), pp. 259\u2013267. arXiv:1804.01082. https:\/\/doi.org\/10.1109\/FOCS.2018.00033","DOI":"10.1109\/FOCS.2018.00033"},{"key":"9418_CR37","doi-asserted-by":"crossref","unstructured":"A.\u00a0Molina, T.\u00a0Vidick, J.\u00a0Watrous, Optimal counterfeiting attacks and generalizations for Wiesner\u2019s quantum money, in Theory of Quantum Computation, Communication, and Cryptography (Springer, 2013), pp. 45\u201364. arXiv:1202.4010","DOI":"10.1007\/978-3-642-35656-8_4"},{"key":"9418_CR38","doi-asserted-by":"publisher","unstructured":"M.\u00a0Mosca, D.\u00a0Stebila, Quantum Coins, volume 523 of Contemp. Math. (Amer. Math. Soc., 2010), pp. 35\u201347. arXiv:0911.1295. https:\/\/doi.org\/10.1090\/conm\/523\/10311","DOI":"10.1090\/conm\/523\/10311"},{"key":"9418_CR39","doi-asserted-by":"crossref","unstructured":"D.\u00a0Nagaj, O.\u00a0Sattath, A.\u00a0Brodutch, D.\u00a0Unruh, An adaptive attack on Wiesner\u2019s quantum money. Quantum Inf. Comput., 16(11&12), 1048\u20131070 (2016). http:\/\/www.rintonpress.com\/xxqic16\/qic-16-1112\/1048-1070.pdf, arXiv:1404.1507","DOI":"10.26421\/QIC16.11-12-7"},{"key":"9418_CR40","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"MA Nielsen","year":"2011","unstructured":"M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edition (Cambridge University Press, New York, 2011)","edition":"10"},{"issue":"1","key":"9418_CR41","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00708652","volume":"1","author":"JL Park","year":"1970","unstructured":"J.L. Park, The concept of transition in quantum mechanics. Found. Phys. 1(1), 23\u201333 (1970). https:\/\/doi.org\/10.1007\/BF00708652","journal-title":"Found. Phys."},{"key":"9418_CR42","doi-asserted-by":"publisher","unstructured":"F.\u00a0Pastawski, N.Y. Yao, L.\u00a0Jiang, M.D. Lukin, J.I. Cirac, Unforgeable noise-tolerant quantum tokens. Proc. Natl. Acad. Sci. 109(40), 16079\u201316082 (2012). arXiv:1112.5456. https:\/\/doi.org\/10.1073\/pnas.1203552109","DOI":"10.1073\/pnas.1203552109"},{"issue":"4","key":"9418_CR43","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1049\/iet-ifs.2018.5307","volume":"13","author":"MC Pena","year":"2019","unstructured":"M.C. Pena, R.D. D\u00edaz, J.Faug\u00e8re, L.H. Encinas, L.\u00a0Perret, Non-quantum cryptanalysis of the noisy version of Aaronson-Christiano\u2019s quantum money scheme. IET Inf. Secur. 13(4):362\u2013366 (2019). https:\/\/doi.org\/10.1049\/iet-ifs.2018.5307","journal-title":"IET Inf. Secur."},{"issue":"3","key":"9418_CR44","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R Raz","year":"1998","unstructured":"R.\u00a0Raz, A parallel repetition theorem. SIAM J. Comput. 27(3), 763\u2013803 (1998). https:\/\/doi.org\/10.1137\/S0097539795280895","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9418_CR45","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1137\/090747270","volume":"40","author":"R Raz","year":"2011","unstructured":"R.\u00a0Raz, A counterexample to strong parallel repetition. SIAM J. Comput. 40(3), 771\u2013777 (2011). https:\/\/doi.org\/10.1137\/090747270","journal-title":"SIAM J. Comput."},{"key":"9418_CR46","unstructured":"B.\u00a0Roberts, Toward Secure Quantum Money. PhD thesis, Princeton University (2019). http:\/\/people.eecs.berkeley.edu\/~bhaskarr\/documents\/Thesis_RZ19.pdf"},{"key":"9418_CR47","unstructured":"V.\u00a0Shoup, Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004\/332 (2004). https:\/\/eprint.iacr.org\/2004\/332"},{"key":"9418_CR48","unstructured":"Y.\u00a0Tokunaga, T.\u00a0Okamoto, N.\u00a0Imoto, Anonymous quantum cash (2003). http:\/\/qci.is.s.u-tokyo.ac.jp\/qci\/eqis03\/program\/papers\/O09-Tokunaga.ps.gz"},{"key":"9418_CR49","doi-asserted-by":"publisher","unstructured":"U.V. Vazirani, T.\u00a0Vidick, Fully device independent quantum key distribution. Commun. ACM 62(4), 133 (2019). arXiv:1210.1810. https:\/\/doi.org\/10.1145\/3310974","DOI":"10.1145\/3310974"},{"issue":"1","key":"9418_CR50","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S Wiesner","year":"1983","unstructured":"S.\u00a0Wiesner, Conjugate coding. ACM Sigact News 15(1), 78\u201388 (1983). https:\/\/doi.org\/10.1145\/1008908.1008920","journal-title":"Conjugate coding. ACM Sigact News"},{"issue":"5886","key":"9418_CR51","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"W.K. Wootters, W.H. Zurek, A single quantum cannot be cloned. Nature 299(5886), 802\u2013803 (1982). https:\/\/doi.org\/10.1038\/299802a0","journal-title":"Nature"},{"key":"9418_CR52","doi-asserted-by":"publisher","unstructured":"M.\u00a0Zhandry, How to construct quantum random functions, in 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20\u201323, 2012 (IEEE Computer Society, 2012), pp. 679\u2013687. https:\/\/doi.org\/10.1109\/FOCS.2012.37","DOI":"10.1109\/FOCS.2012.37"},{"key":"9418_CR53","doi-asserted-by":"publisher","unstructured":"M.\u00a0Zhandry, Quantum lightning never strikes the same state twice, in Y.\u00a0Ishai, V.\u00a0Rijmen, editors, Advances in Cryptology - EUROCRYPT 2019 - Germany, May 19\u201323, 2019, Proceedings, Part III, volume 11478 of Lecture Notes in Computer Science (Springer, 2019), pp. 408\u2013438. arXiv:1711.02276. https:\/\/doi.org\/10.1007\/978-3-030-17659-4_14","DOI":"10.1007\/978-3-030-17659-4_14"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09418-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-021-09418-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09418-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T18:06:41Z","timestamp":1650910001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-021-09418-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,25]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9418"],"URL":"https:\/\/doi.org\/10.1007\/s00145-021-09418-8","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,25]]},"assertion":[{"value":"27 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"8"}}