{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T10:44:12Z","timestamp":1761129852160,"version":"3.37.3"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"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":["Quantum Inf Process"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s11128-021-03164-3","type":"journal-article","created":{"date-parts":[[2021,7,3]],"date-time":"2021-07-03T05:08:49Z","timestamp":1625288929000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3301-0232","authenticated-orcid":false,"given":"Khodakhast","family":"Bibak","sequence":"first","affiliation":[]},{"given":"Robert","family":"Ritchie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,3]]},"reference":[{"key":"3164_CR1","doi-asserted-by":"crossref","unstructured":"All\u00e9aume, R., Branciard, C., Bouda, J., Debuisschert, T., Dianati, M., Gisin, N., Godfrey, M., Grangier, P., L\u00e4nger, T., L\u00fctkenhaus, N., Monyk, C., Painchault, P., Peev, M., Poppe, A., Pornin, T., Rarity, J., Renner, R., Ribordy, G., Riguidel, M., Salvail, L., Shields, A., Weinfurter, H., Zeilinger, A.: Using quantum key distribution for cryptographic purposes: a survey. Theor. Comput. Sci. 560, 62\u201381 (2014). Theoretical Aspects of Quantum Cryptography - celebrating 30 years of BB84","DOI":"10.1016\/j.tcs.2014.09.018"},{"key":"3164_CR2","doi-asserted-by":"crossref","unstructured":"Stebila, D., Mosca, M., L\u00fctkenhaus, N.: The case for quantum key distribution. In: Sergienko, A., Pascazio, S., Villoresi, P. (eds.) Quantum Communication and Quantum Networking, pp.\u00a0283\u2013296. Springer, Berlin, Heidelberg (2010)","DOI":"10.1007\/978-3-642-11731-2_35"},{"key":"3164_CR3","doi-asserted-by":"crossref","unstructured":"Unruh, D.: Everlasting multi-party computation. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology\u2014CRYPTO 2013, pp.\u00a0380\u2013397 (2013)","DOI":"10.1007\/978-3-642-40084-1_22"},{"key":"3164_CR4","doi-asserted-by":"crossref","unstructured":"Sasaki, M.: Quantum key distribution and its applications. IEEE Secur. Priv. 16(5), 42\u201348 (2018)","DOI":"10.1109\/MSP.2018.3761713"},{"key":"3164_CR5","doi-asserted-by":"crossref","unstructured":"Peev, M., N\u00f6lle, M., Maurhart, O., Lor\u00fcnser, T., Suda, M., Poppe, A., Ursin, R., Fedrizzi, A., Zeilinger, A.: A novel protocol-authentication algorithm ruling out a man-in-the-middle attack in quantum cryptography. Int. J. Quantum Inf. 03, 225\u2013231 (2005)","DOI":"10.1142\/S0219749905000797"},{"key":"3164_CR6","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1142\/S0219749909005754","volume":"07","author":"A Abidin","year":"2009","unstructured":"Abidin, A., Larsson, J.-\u00c5.: Vulnerability of \u2018a novel protocol-authentication algorithm ruling out a man-in-the-middle attack in quantum cryptography\u2019. Int. J. Quantum Inf. 07, 1047\u20131052 (2009)","journal-title":"Int. J. Quantum Inf."},{"key":"3164_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s11128-015-1160-4","volume":"15","author":"C Pacher","year":"2016","unstructured":"Pacher, C., Abidin, A., Lor\u00fcnser, T., Peev, M., Ursin, R., Zeilinger, A., Larsson, J.-\u00c5.: Attacks on quantum key distribution protocols that employ non-ITS authentication. Quantum Inf. Process. 15, 327\u2013362 (2016)","journal-title":"Quantum Inf. Process."},{"key":"3164_CR8","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1140\/epjqt\/s40507-020-00084-6","volume":"7","author":"A Price","year":"2020","unstructured":"Price, A., Rarity, J., Erven, C.: A quantum key distribution protocol for rapid denial of service detection. EPJ Quantum Technol. 7, 8 (2020)","journal-title":"EPJ Quantum Technol."},{"issue":"11","key":"3164_CR9","doi-asserted-by":"publisher","first-page":"10387","DOI":"10.1364\/OE.19.010387","volume":"19","author":"M Sasaki","year":"2011","unstructured":"Sasaki, M., Fujiwara, M., Ishizuka, H., Klaus, W., Wakui, K., Takeoka, M., Miki, S., Yamashita, T., Wang, Z., Tanaka, A., Yoshino, K., Nambu, Y., Takahashi, S., Tajima, A., Tomita, A., Domeki, T., Hasegawa, T., Sakai, Y., Kobayashi, H., Asai, T., Shimizu, K., Tokura, T., Tsurumaru, T., Matsui, M., Honjo, T., Tamaki, K., Takesue, H., Tokura, Y., Dynes, J.F., Dixon, A.R., Sharpe, A.W., Yuan, Z.L., Shields, A.J., Uchikoga, S., Legr\u00e9, M., Robyr, S., Trinkler, P., Monat, L., Page, J.-B., Ribordy, G., Poppe, A., Allacher, A., Maurhart, O., L\u00e4nger, T., Peev, M., Zeilinger, A.: Field test of quantum key distribution in the Tokyo QKD network. Opt. Express 19(11), 10387\u201310409 (2011)","journal-title":"Opt. Express"},{"issue":"12","key":"3164_CR10","doi-asserted-by":"publisher","first-page":"123001","DOI":"10.1088\/1367-2630\/13\/12\/123001","volume":"13","author":"D Stucki","year":"2011","unstructured":"Stucki, D., Legr\u00e9, M., Buntschu, F., Clausen, B., Felber, N., Gisin, N., Henzen, L., Junod, P., Litzistorf, G., Monbaron, P., Monat, L., Page, J.-B., Perroud, D., Ribordy, G., Rochas, A., Robyr, S., Tavares, J., Thew, R., Trinkler, P., Ventura, S., Voirol, R., Walenta, N., Zbinden, H.: Long-term performance of the SwissQuantum quantum key distribution network in a field environment. New J. Phys. 13(12), 123001 (2011)","journal-title":"New J. Phys."},{"key":"3164_CR11","doi-asserted-by":"crossref","unstructured":"Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: fast and secure message authentication. In: Advances in Cryptology\u2014CRYPTO\u201999, vol.\u00a01666 of Lecture Notes in Computer Science, pp.\u00a0216\u2013233 (1999)","DOI":"10.1007\/3-540-48405-1_14"},{"issue":"2","key":"3164_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"JL Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"3164_CR13","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, 7\u201311 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"3164_CR14","doi-asserted-by":"publisher","first-page":"4383","DOI":"10.1109\/TIT.2014.2317312","volume":"60","author":"C Portmann","year":"2014","unstructured":"Portmann, C.: Key recycling in authentication. IEEE Trans. Inf. Theory 60(7), 4383\u20134396 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3164_CR15","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Advances in Cryptology\u2014EUROCRYPT 2004, vol.\u00a03027 of Lecture Notes in Computer Science, pp.\u00a0523\u2013540 (2004)","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"3164_CR16","doi-asserted-by":"crossref","unstructured":"Halevi, S., Krawczyk, H.: MMH: software message authentication in the Gbit\/second rates. In: Biham, E. (Ed.) Fast Software Encryption\u2014FSE\u201997, vol.\u00a01267 of Lecture Notes in Computer Science, pp.\u00a0172\u2013189 (1997)","DOI":"10.1007\/BFb0052345"},{"issue":"3","key":"3164_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53","author":"EN Gilbert","year":"1974","unstructured":"Gilbert, E.N., Macwilliams, F.J., Sloane, N.J.A.: Codes which detect deception. Bell Syst. Tech. J. 53(3), 405\u2013424 (1974)","journal-title":"Bell Syst. Tech. J."},{"key":"3164_CR18","doi-asserted-by":"crossref","unstructured":"Handschuh, H., Preneel, B.: Key-recovery attacks on universal hash function based MAC algorithms. In: Wagner, D. (ed.) Advances in Cryptology\u2014CRYPTO\u201908, Lecture Notes in Computer Science, pp.\u00a0144\u2013161 (2008)","DOI":"10.1007\/978-3-540-85174-5_9"},{"issue":"4","key":"3164_CR19","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1109\/TIT.2006.871040","volume":"52","author":"M Hayashi","year":"2006","unstructured":"Hayashi, M.: General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel. IEEE Trans. Inf. Theory 52(4), 1562\u20131575 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"3164_CR20","doi-asserted-by":"publisher","first-page":"3989","DOI":"10.1109\/TIT.2011.2110950","volume":"57","author":"M Hayashi","year":"2011","unstructured":"Hayashi, M.: Exponential decreasing rate of leaked information in universal random privacy amplification. IEEE Trans. Inf. Theory 57(6), 3989\u20134001 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3164_CR21","doi-asserted-by":"crossref","unstructured":"Renner, R., Wolf, S.: Simple and tight bounds for information reconciliation and privacy amplification. In: Advances in Cryptology\u2014ASIACRYPT 2005, Lecture Notes in Computer Science, pp.\u00a0199\u2013216 (2005)","DOI":"10.1007\/11593447_11"},{"key":"3164_CR22","doi-asserted-by":"crossref","unstructured":"Rogaway, P.: Bucket hashing and its application to fast message authentication. In: Coppersmith, D. (ed.) Advances in Cryptology\u2014CRYPTO\u2019 95, vol.\u00a012 of Lecture Notes in Computer Science, pp.\u00a029\u201342 (1995)","DOI":"10.1007\/3-540-44750-4_3"},{"issue":"10","key":"3164_CR23","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1109\/JPROC.2015.2462774","volume":"103","author":"H Tyagi","year":"2015","unstructured":"Tyagi, H., Vardy, A.: Universal hashing for information-theoretic security. Proc. IEEE 103(10), 1781\u20131795 (2015)","journal-title":"Proc. IEEE"},{"key":"3164_CR24","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I.B., D\u00f6ttling, N., Fehr, S., Spini, G.: Linear secret sharing schemes from error correcting codes and universal hash functions. In: Oswald, E., Fischlin, M. (Eds.) Advances in Cryptology\u2014EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II, vol.\u00a09057 of Lecture Notes in Computer Science, pp.\u00a0313\u2013336. Springer (2015)","DOI":"10.1007\/978-3-662-46803-6_11"},{"key":"3164_CR25","first-page":"7","volume":"114","author":"DR Stinson","year":"1996","unstructured":"Stinson, D.R.: On the connections between universal hashing, combinatorial designs and error-correcting codes. Congr. Numer. 114, 7\u201327 (1996)","journal-title":"Congr. Numer."},{"issue":"4","key":"3164_CR26","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"3164_CR27","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF01305237","volume":"12","author":"N Nisan","year":"1992","unstructured":"Nisan, N.: Pseudorandom generators for space-bounded computations. Combinatorica 12(4), 449\u2013461 (1992)","journal-title":"Combinatorica"},{"key":"3164_CR28","doi-asserted-by":"publisher","DOI":"10.1090\/pcms\/010","volume-title":"Computational Complexity Theory, vol.\u00a010 of IAS\/Park City Mathematics Series","author":"S Rudich","year":"2004","unstructured":"Rudich, S., Wigderson, A.: Computational Complexity Theory, vol.\u00a010 of IAS\/Park City Mathematics Series. American Mathematical Society, Philadelphia (2004)"},{"key":"3164_CR29","doi-asserted-by":"crossref","unstructured":"Sipser, M.: A complexity theoretic approach to randomness. In: ACM Symposium on Theory of Computing\u2014STOC\u201983, STOC \u201983, pp.\u00a0330\u2013335 (1983)","DOI":"10.1145\/800061.808762"},{"key":"3164_CR30","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: Symposium on Foundations of Computer Science\u2014SFCS\u201989, pp.\u00a0248\u2013253 (1989)","DOI":"10.1109\/SFCS.1989.63486"},{"key":"3164_CR31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"1","key":"3164_CR32","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1137\/060658400","volume":"38","author":"A Pagh","year":"2008","unstructured":"Pagh, A., Pagh, R.: Uniform hashing in constant time and optimal space. SIAM J. Comput. 38(1), 85\u201396 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"3164_CR33","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0097539701386216","volume":"33","author":"A Siegel","year":"2004","unstructured":"Siegel, A.: On universal classes of extremely random constant-time hash functions. SIAM J. Comput. 33(3), 505\u2013543 (2004)","journal-title":"SIAM J. Comput."},{"key":"3164_CR34","doi-asserted-by":"crossref","unstructured":"Karloff, H., Suri, S., Vassilvitskii, S.: A model of computation for mapreduce. In: ACM-SIAM Symposium on Discrete Algorithms\u2014SODA \u201910, pp.\u00a0938\u2013948 (2010)","DOI":"10.1137\/1.9781611973075.76"},{"key":"3164_CR35","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E., Schardl, T.B., Sukha, J.: Deterministic parallel random-number generation for dynamic-multithreading platforms. In: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming\u2014PPoPP\u201912, pp.\u00a0193\u2013204 (2012)","DOI":"10.1145\/2370036.2145841"},{"key":"3164_CR36","doi-asserted-by":"crossref","unstructured":"Ritchie, R., Bibak, K.: SQUAREMIX: a faster pseudorandom number generator for dynamic-multithreading platforms. In: 2020 Data Compression Conference (DCC), p.\u00a0391 (2020)","DOI":"10.1109\/DCC47342.2020.00061"},{"key":"3164_CR37","doi-asserted-by":"publisher","unstructured":"Ritchie, R., Bibak, K.: DOTMIX-Pro: faster and more efficient variants of DOTMIX for dynamic-multithreading platforms. J. Supercomput. (2021). https:\/\/doi.org\/10.1007\/s11227-021-03904-3","DOI":"10.1007\/s11227-021-03904-3"},{"key":"3164_CR38","doi-asserted-by":"crossref","unstructured":"Krawczyk, H.: LFSR-based hashing and authentication. In: Desmedt, Y.G. (ed.) Advances in Cryptology\u2014CRYPTO \u201994, Lecture Notes in Computer Science, pp.\u00a0129\u2013139 (1994)","DOI":"10.1007\/3-540-48658-5_15"},{"issue":"3","key":"3164_CR39","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"DR Stinson","year":"1994","unstructured":"Stinson, D.R.: Universal hashing and authentication codes. Des. Codes Cryptogr. 4(3), 369\u2013380 (1994)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"3164_CR40","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"MN Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, J.L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"3164_CR41","doi-asserted-by":"crossref","unstructured":"Boesgaard, M., Christensen, T., Zenner, E.: Badger\u2014a fast and provably secure MAC. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) Applied Cryptography and Network Security, pp.\u00a0176\u2013191. Springer, Berlin, Heidelberg (2005)","DOI":"10.1007\/11496137_13"},{"key":"3164_CR42","doi-asserted-by":"crossref","unstructured":"Minematsu, K., Tsunoo, Y.: Provably secure MACs from differentially-uniform permutations and AES-based implementations. In: Robshaw, M. (ed.) Fast Software Encryption\u2014FSE\u201906, Lecture Notes in Computer Science, pp.\u00a0226\u2013241 (2006)","DOI":"10.1007\/11799313_15"},{"key":"3164_CR43","doi-asserted-by":"crossref","unstructured":"Duval, S., Leurent, G.: Lightweight MACs from universal hash functions. In: Smart Card Research and Advanced Applications, vol.\u00a011833 of Lecture Notes in Computer Science, pp.\u00a0195\u2013215 (2020)","DOI":"10.1007\/978-3-030-42068-0_12"},{"key":"3164_CR44","unstructured":"ISO\/IEC 9797-1:2011: Information technology\u2014security techniques\u2014message authentication codes (MACs)\u2014part 1: mechanisms using a block cipher (2011)"},{"key":"3164_CR45","doi-asserted-by":"crossref","unstructured":"Black, J., Rogaway, P.: CBC MACs for arbitrary-length messages: the three-key constructions. In: Advances in Cryptology\u2014CRYPTO\u201900, vol.\u00a01880 of Lecture Notes in Computer Science, pp.\u00a0197\u2013215 (2000)","DOI":"10.1007\/3-540-44598-6_12"},{"key":"3164_CR46","doi-asserted-by":"crossref","unstructured":"Iwata, T., Kurosawa, K.: OMAC: one-key CBC MAC. In: Johansson, T. (ed.) Fast Software Encryption\u2014FSE\u201903, vol.\u00a02887 of Lecture Notes in Computer Science, pp.\u00a0129\u2013153 (2003)","DOI":"10.1007\/978-3-540-39887-5_11"},{"key":"3164_CR47","doi-asserted-by":"crossref","unstructured":"Iwata, T., Kurosawa, K.: OMAC: one-key CBC MAC\u2014addendum (2003)","DOI":"10.1007\/978-3-540-39887-5_11"},{"key":"3164_CR48","doi-asserted-by":"crossref","unstructured":"Black, J., Rogaway, P.: A block-cipher mode of operation for parallelizable message authentication. In: Advances in Cryptology\u2014EUROCRYPT\u201902, vol.\u00a02332 of Lecture Notes in Computer Science, pp.\u00a0384\u2013397 (2002)","DOI":"10.1007\/3-540-46035-7_25"},{"key":"3164_CR49","doi-asserted-by":"crossref","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying hash functions for message authentication. In: Koblitz, N. (ed.) Advances in Cryptology\u2014CRYPTO \u201996, Lecture Notes in Computer Science, pp.\u00a01-15 (1996)","DOI":"10.1007\/3-540-68697-5_1"},{"key":"3164_CR50","doi-asserted-by":"crossref","unstructured":"McGrew, D.A., Viega, J.: The security and performance of the Galois\/Counter mode (GCM) of operation. In: Canteaut, A., Viswanathan, K. (eds.) Progress in Cryptology\u2014INDOCRYPT 2004, Lecture Notes in Computer Science, pp.\u00a0343\u2013355 (2005)","DOI":"10.1007\/978-3-540-30556-9_27"},{"key":"3164_CR51","doi-asserted-by":"crossref","unstructured":"Bernstein, D.: The Poly1305-AES message-authentication code. In: Fast Software Encryption\u2014FSE\u201905, vol.\u00a03557 of Lecture Notes in Computer Science, pp.\u00a032\u201349 (2005)","DOI":"10.1007\/11502760_3"},{"key":"3164_CR52","unstructured":"Boneh, D., Shoup, V.: A Graduate Course in Applied Cryptography, 0.5 ed. (2020)"},{"key":"3164_CR53","unstructured":"Brassard, G.: On computationally secure authentication tags requiring short secret shared keys. In: Advances in Cryptology\u2014CRYPTO \u201982"},{"key":"3164_CR54","doi-asserted-by":"crossref","unstructured":"Shoup, V.: On fast and provably secure message authentication based on universal hashing. In: Koblitz, N. (ed.) Advances in Cryptology\u2014CRYPTO \u201996, Lecture Notes in Computer Science, pp. 313\u2013328 (1996)","DOI":"10.1007\/3-540-68697-5_24"},{"key":"3164_CR55","unstructured":"Joux, A.: Authentication failures in NIST version of GCM. Comments submitted to NIST Modes of Operation Process (2006)"},{"key":"3164_CR56","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-34159-5_7","volume-title":"Research in Cryptology","author":"A Abidin","year":"2012","unstructured":"Abidin, A., Larsson, J.-\u00c5.: New universal hash functions. In: Armknecht, F., Lucks, S. (eds.) Research in Cryptology, pp. 99\u2013108. Springer, Berlin (2012)"},{"issue":"3","key":"3164_CR57","first-page":"181","volume":"5","author":"T Beth","year":"2005","unstructured":"Beth, T., M\u00fcller-Quade, J., Steinwandt, R.: Cryptanalysis of a practical quantum key distribution with polarization-entangled photons. Quantum Inf. Comput. 5(3), 181\u2013186 (2005)","journal-title":"Quantum Inf. Comput."},{"issue":"4","key":"3164_CR58","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF00264615","volume":"21","author":"K Mehlhorn","year":"1984","unstructured":"Mehlhorn, K., Vishkin, U.: Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Inform. 21(4), 339\u2013374 (1984)","journal-title":"Acta Inform."},{"key":"3164_CR59","first-page":"1","volume-title":"Advances in Cryptology\u2014EUROCRYPT \u201993, (Berlin, Heidelberg)","author":"T Johansson","year":"1994","unstructured":"Johansson, T., Kabatianskii, G., Smeets, B.: On the relation between a-codes and codes correcting independent errors. In: Helleseth, T. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201993, (Berlin, Heidelberg), pp. 1\u201311. Springer, Berlin (1994)"},{"issue":"2","key":"3164_CR60","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/18.485725","volume":"42","author":"GA Kabatianskii","year":"1996","unstructured":"Kabatianskii, G.A., Smeets, B., Johansson, T.: On the cardinality of systematic authentication codes via error-correcting codes. IEEE Trans. Inf. Theory 42(2), 566\u2013578 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3164_CR61","unstructured":"Krovetz, T.D.: Software-optimized universal hashing and message authentication. Ph.D thesis, University of California, Davis (2000)"},{"key":"3164_CR62","doi-asserted-by":"crossref","unstructured":"Black, J., Cochran, M.: MAC reforgeability. In: Fast Software Encryption\u2014FSE\u201909, vol.\u00a05665 of Lecture Notes in Computer Science, pp.\u00a0345\u2013362 (2009)","DOI":"10.1007\/978-3-642-03317-9_21"},{"issue":"3 & 4","key":"3164_CR63","first-page":"181","volume":"21","author":"K Bibak","year":"2021","unstructured":"Bibak, K., Ritchie, R., Zolfaghari, B.: Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash. Quantum Inf. Comput. 21(3 & 4), 181\u2013202 (2021)","journal-title":"Quantum Inf. Comput."},{"key":"3164_CR64","unstructured":"Thorup, M.: High speed hashing for integers and strings. arXiv:1504.06804 (2020)"},{"key":"3164_CR65","volume-title":"Software-optimized universal hashing and message authentication","author":"TD Krovetz","year":"2000","unstructured":"Krovetz, T.D., Rogaway, P.: Software-optimized universal hashing and message authentication. University of California, Davis (2000)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03164-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-021-03164-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03164-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T08:23:59Z","timestamp":1628065439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-021-03164-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":65,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["3164"],"URL":"https:\/\/doi.org\/10.1007\/s11128-021-03164-3","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2021,7]]},"assertion":[{"value":"18 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"228"}}