{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:15:29Z","timestamp":1748751329563,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":68,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_1","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T15:47:27Z","timestamp":1452181647000},"page":"3-16","source":"Crossref","is-referenced-by-count":1,"title":["Cryptography in a Quantum World"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Brassard","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"key":"1_CR1","unstructured":"Kahn, D.: The Codebreakers: the Comprehensive History of Secret Communication from Ancient Times to the Internet, 2nd revised edn. Scribner, New York (1996)"},{"key":"1_CR2","volume-title":"The Code Book: the Science of Secrecy from Ancient Egypt to Quantum Cryptography","author":"S Singh","year":"2000","unstructured":"Singh, S.: The Code Book: the Science of Secrecy from Ancient Egypt to Quantum Cryptography. Anchor Books, New York (2000)"},{"key":"1_CR3","unstructured":"http:\/\/tumblr.radarq.net\/post\/16344039232\/big-brother-is-watching-you-in-the-plaza-de-george . Accessed 8 October 2015"},{"key":"1_CR4","doi-asserted-by":"publisher","DOI":"10.1515\/9781400844975","volume-title":"Alan Turing: the Enigma","author":"A Hodges","year":"2012","unstructured":"Hodges, A.: Alan Turing: the Enigma. Random House, London (2012)"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/MAHC.1981.10033","volume":"3","author":"M Rejewski","year":"1981","unstructured":"Rejewski, M.: How Polish mathematicians broke the Enigma cipher. Ann. Hist. Comput. 3(3), 213\u2013234 (1981)","journal-title":"Ann. Hist. Comput."},{"key":"1_CR6","unstructured":"Tyldum, M., Moore, G.: The imitation game (2014)"},{"key":"1_CR7","unstructured":"https:\/\/en.wikipedia.org\/wiki\/W._T._Tutte . Accessed 8 October 2015"},{"key":"1_CR8","unstructured":"Tutte, W.T.: FISH and I. http:\/\/www.usna.edu\/Users\/math\/wdj\/_files\/documents\/papers\/cryptoday\/tutte_fish.pdf . Transcript of a lecture given at the University of Waterloo, 19 June 1998"},{"key":"1_CR9","unstructured":"QCrypt2015. http:\/\/2015.qcrypt.net . Accessed 8 October 2015"},{"issue":"1","key":"1_CR10","first-page":"33","volume":"XIX","author":"EA Poe","year":"1841","unstructured":"Poe, E.A.: A few words on secret writing. Graham\u2019s Lady\u2019s Gentleman\u2019s Mag. XIX(1), 33\u201338 (1841)","journal-title":"Graham\u2019s Lady\u2019s Gentleman\u2019s Mag."},{"key":"1_CR11","volume-title":"The Gold-Bug","author":"EA Poe","year":"1843","unstructured":"Poe, E.A.: The Gold-Bug. Philadelphia Dollar Newspaper, Philadelphia (1843)"},{"key":"1_CR12","volume-title":"The Cryptographic Imagination: Secret Writing from Edgar Poe to the Internet","author":"SJ Rosenheim","year":"1997","unstructured":"Rosenheim, S.J.: The Cryptographic Imagination: Secret Writing from Edgar Poe to the Internet. Johns Hopkins University Press, Baltimore (1997)"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656\u2013715 (1949)","journal-title":"Bell Syst. Tech. J."},{"key":"1_CR15","unstructured":"Colossus Computer. https:\/\/en.wikipedia.org\/wiki\/Colossus_computer . Accessed 8 October 2015"},{"key":"1_CR16","unstructured":"Vernam, G.: Secret signaling system, U.S. Patent 1,310,719 (1919)"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1080\/01611194.2011.583711","volume":"35","author":"SM Bellovin","year":"2011","unstructured":"Bellovin, S.M.: Frank Miller: inventor of the one-time pad. Cryptologia 35(3), 203\u2013222 (2011)","journal-title":"Cryptologia"},{"key":"1_CR18","unstructured":"Moscow-Washington Hotline. https:\/\/en.wikipedia.org\/wiki\/Moscow-Washington_hotline . Accessed 8 October 2015"},{"key":"1_CR19","volume-title":"Ch\u00e9 Guevara: a Biography","author":"D James","year":"1970","unstructured":"James, D.: Ch\u00e9 Guevara: a Biography. Rowman & Littlefield, Lanham (1970)"},{"key":"1_CR20","unstructured":"Merkle, R.C.: C.S. 244 project proposal. http:\/\/www.merkle.com\/1974 (1974). Accessed 8 October 2015"},{"issue":"4","key":"1_CR21","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1145\/359460.359473","volume":"21","author":"RC Merkle","year":"1978","unstructured":"Merkle, R.C.: Secure communications over insecure channels. Commun. ACM 21(4), 294\u2013299 (1978)","journal-title":"Commun. ACM"},{"issue":"6","key":"1_CR22","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"1_CR24","unstructured":"Wayner, P.: British document outlines early encryption discovery. http:\/\/www.nytimes.com\/library\/cyber\/week\/122497encrypt.html (1997). Accessed 8 October 2015"},{"issue":"44","key":"1_CR25","first-page":"114","volume":"42","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42(44), 114\u2013116 (1978)","journal-title":"DSN Prog. Rep."},{"issue":"177","key":"1_CR26","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"issue":"6\/7","key":"1_CR28","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman, R.P.: Simulating physics with computers. Int. J. Theor. Phys. 21(6\/7), 467\u2013488 (1982)","journal-title":"Int. J. Theor. Phys."},{"issue":"2","key":"1_CR29","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1364\/ON.11.2.000011","volume":"11","author":"RP Feynman","year":"1985","unstructured":"Feynman, R.P.: Quantum mechanical computers. Opt. News 11(2), 11\u201320 (1985)","journal-title":"Opt. News"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D Deutsch","year":"1985","unstructured":"Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. London A 400, 97\u2013117 (1985)","journal-title":"Proc. R. Soc. London A"},{"issue":"5","key":"1_CR31","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"1_CR32","unstructured":"Kitaev, A.Y.: Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph\/9511026 (1995)"},{"volume-title":"Post-Quantum Cryptography","year":"2009","key":"1_CR33","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.): Post-Quantum Cryptography. Springer Science & Business Media, Berlin (2009)"},{"key":"1_CR34","unstructured":"Bernstein, D.J., Lange, T.: Post-quantum cryptography. http:\/\/pqcrypto.org\/ . Accessed 8 October 2015"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography, pp. 147\u2013191. In: [33] (2009)","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"1_CR36","unstructured":"Wolchover, N.: A tricky path to quantum-safe encryption. Quanta Magazine. https:\/\/www.quantamagazine.org\/20150908-quantum-safe-encryption\/ . Accessed 8 October 2015"},{"key":"1_CR37","unstructured":"Campbell, P., Groves, M., Shepherd, D.: Soliloquy: a cautionary tale. https:\/\/docbox.etsi.org\/Workshop\/2014\/201410_CRYPTO\/S07_Systems_and_Attacks\/S07_Groves_Annex.pdf . Accessed 8 October 2015"},{"key":"1_CR38","unstructured":"Biasse, J.F., Song, F.: A note on the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in $$\\mathbb{Q}(\\zeta _{p^n})$$ . http:\/\/cacr.uwaterloo.ca\/techreports\/2015\/cacr2015-12.pdf . Accessed 8 October 2015"},{"key":"1_CR39","unstructured":"National Security Agency: Cryptography Today. https:\/\/www.nsa.gov\/ia\/programs\/suiteb_cryptography\/ . Accessed 8 October 2015"},{"issue":"2","key":"1_CR40","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"LK Grover","year":"1997","unstructured":"Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325\u2013328 (1997)","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"1_CR41","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Brassard, G., Salvail, L.: Quantum Merkle puzzles. In: Second International Conference on Quantum, Nano and Micro Technologies, pp. 76\u201379 (2008)","DOI":"10.1109\/ICQNM.2008.16"},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-22792-9_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Brassard","year":"2011","unstructured":"Brassard, G., H\u00f8yer, P., Kalach, K., Kaplan, M., Laplante, S., Salvail, L.: Merkle puzzles in a quantum world. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 391\u2013410. Springer, Heidelberg (2011)"},{"issue":"4&5","key":"1_CR44","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys. 46(4&5), 493\u2013505 (1998)","journal-title":"Fortschr. Phys."},{"issue":"5886","key":"1_CR45","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"Wootters, W.K., \u017burek, W.H.: A single quantum cannot be cloned. Nature 299(5886), 802\u2013803 (1982)","journal-title":"Nature"},{"issue":"1","key":"1_CR46","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. ACM Sigact News 15(1), 78\u201388 (1983). Original manuscript written in 1968","journal-title":"ACM Sigact News"},{"issue":"4","key":"1_CR47","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s11047-014-9453-6","volume":"13","author":"CH Bennett","year":"2014","unstructured":"Bennett, C.H., Brassard, G., Breidbart, S.: Quantum cryptography II: how to re-use a one-time pad safely even if P=NP. Nat. Comput. 13(4), 453\u2013458 (2014). Original manuscript written in 1982","journal-title":"Nat. Comput."},{"key":"1_CR48","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography and its application to provably secure key expansion, public-key distribution, and coin-tossing. In: Proceedings of IEEE International Symposium on Information Theory, p. 91, September 1983"},{"key":"1_CR49","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proceedings of International Conference on Computers, Systems and Signal Processing, pp. 175\u2013179, December 1984"},{"issue":"Part 1","key":"1_CR50","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.tcs.2014.05.025","volume":"560","author":"CH Bennett","year":"2014","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. Theor. Comput. Sci. 560(Part 1), 7\u201311 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Brassard, G.: Brief history of quantum cryptography: a personal perspective. In: Proceedings of IEEE Information Theory Workshop on Theory and Practice in Information Theoretic Security, pp. 19\u201323, October 2005. arxiv.org\/abs\/quant-ph\/0604072","DOI":"10.1109\/ITWTPI.2005.1543949"},{"issue":"1","key":"1_CR52","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00191318","volume":"5","author":"CH Bennett","year":"1992","unstructured":"Bennett, C.H., Bessette, F., Brassard, G., Salvail, L., Smolin, J.: Experimental quantum cryptography. J. Cryptology 5(1), 3\u201328 (1992)","journal-title":"J. Cryptology"},{"key":"1_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3-540-44750-4_10","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"D Mayers","year":"1995","unstructured":"Mayers, D.: On the security of the quantum oblivious transfer and key distribution protocols. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 124\u2013135. Springer, Heidelberg (1995)"},{"key":"1_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-30576-7_22","volume-title":"Theory of Cryptography","author":"R Renner","year":"2005","unstructured":"Renner, R., K\u00f6nig, R.: Universally composable privacy amplification against quantum adversaries. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 407\u2013425. Springer, Heidelberg (2005)"},{"issue":"14","key":"1_CR55","doi-asserted-by":"publisher","first-page":"140502","DOI":"10.1103\/PhysRevLett.98.140502","volume":"98","author":"R K\u00f6nig","year":"2007","unstructured":"K\u00f6nig, R., Renner, R., Bariska, A., Maurer, U.: Small accessible quantum information does not imply security. Phys. Rev. Lett. 98(14), 140502 (2007)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"1_CR56","doi-asserted-by":"publisher","first-page":"012332","DOI":"10.1103\/PhysRevA.72.012332","volume":"72","author":"R Renner","year":"2005","unstructured":"Renner, R., Gisin, N., Kraus, B.: Information-theoretic security proof for quantum-key-distribution protocols. Phys. Rev. A 72(1), 012332 (2005)","journal-title":"Phys. Rev. A"},{"issue":"4","key":"1_CR57","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1038\/scientificamerican1092-50","volume":"267","author":"CH Bennett","year":"1992","unstructured":"Bennett, C.H., Brassard, G., Ekert, A.K.: Quantum cryptography. Sci. Am. 267(4), 50\u201357 (1992)","journal-title":"Sci. Am."},{"key":"1_CR58","unstructured":"ID Quantique. http:\/\/www.idquantique.com"},{"key":"1_CR59","unstructured":"Fadilpa\u0161i\u0107, S.: China\u2019s quantum communications network almost ready. http:\/\/www.itproportal.com\/2015\/08\/31\/chinas-quantum-communications-network-almost-ready\/ . Accessed 9 October 2015"},{"key":"1_CR60","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1038\/ncomms1348","volume":"2","author":"I Gerhardt","year":"2011","unstructured":"Gerhardt, I., Liu, Q., Lamas-Linares, A., Skaar, J., Kurtsiefer, C., Makarov, V.: Full-field implementation of a perfect eavesdropper on a quantum cryptography system. Nat. Commun. 2, 349 (2011)","journal-title":"Nat. Commun."},{"key":"1_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-40084-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Unruh","year":"2013","unstructured":"Unruh, D.: Everlasting multi-party computation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 380\u2013397. Springer, Heidelberg (2013)"},{"issue":"6","key":"1_CR62","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1103\/PhysRevLett.67.661","volume":"67","author":"AK Ekert","year":"1991","unstructured":"Ekert, A.K.: Quantum cryptography based on Bell\u2019s theorem. Phys. Rev. Lett. 67(6), 661\u2013663 (1991)","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"1_CR63","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1103\/PhysRevLett.68.557","volume":"68","author":"CH Bennett","year":"1992","unstructured":"Bennett, C.H., Brassard, G., Mermin, N.D.: Quantum cryptography without Bell\u2019s theorem. Phys. Rev. Lett. 68(5), 557\u2013559 (1992)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"1_CR64","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1103\/PhysicsPhysiqueFizika.1.195","volume":"1","author":"JS Bell","year":"1964","unstructured":"Bell, J.S.: On the Einstein-Podolsky-Rosen paradox. Physics 1(3), 195\u2013200 (1964)","journal-title":"Physics"},{"issue":"10","key":"1_CR65","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1103\/PhysRev.47.777","volume":"47","author":"A Einstein","year":"1935","unstructured":"Einstein, A., Podolsky, B., Rosen, N.: Can quantum-mechanical description of physical reality be considered complete? Phys. Rev. 47(10), 777\u2013780 (1935)","journal-title":"Phys. Rev."},{"issue":"7493","key":"1_CR66","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1038\/nature13132","volume":"507","author":"A Ekert","year":"2014","unstructured":"Ekert, A., Renner, R.: The ultimate physical limits of privacy. Nature 507(7493), 443\u2013447 (2014)","journal-title":"Nature"},{"issue":"7575","key":"1_CR67","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1038\/nature15759","volume":"526","author":"B Hensen","year":"2015","unstructured":"Hensen, B., Bernien, H., Dr\u00e9au, A.E., Reiserer, A., Kalb, N., Blok, M.S., Ruitenberg, J., Vermeulen, R.F.L., Schouten, R.N., Abell\u00e1n, C., Amaya, W., Pruneri, V., Mitchell, M.W., Markham, M., Twitchen, D.J., Elkouss, D., Wehner, S., Taminiau, T.H., Hanson, R.: Loophole-free Bell inequality violation using electron spins separated by 1.3 kilometres. Nature 526(7575), 682\u2013686 (2015)","journal-title":"Nature"},{"key":"1_CR68","unstructured":"Johnston, H.: Physicists claim \u2018loophole-free\u2019 Bell-violation experiment. Physics World (2015). http:\/\/physicsworld.com\/cws\/article\/news\/2015\/sep\/02\/physicists-claim-loophole-free-bell-violation-experiment"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:19:23Z","timestamp":1748744363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":68,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}