{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T08:08:52Z","timestamp":1774339732291,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030500252","type":"print"},{"value":"9783030500269","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_1","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5592-3211","authenticated-orcid":false,"given":"Farid","family":"Ablayev","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3164-2850","authenticated-orcid":false,"given":"Marat","family":"Ablayev","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3024-4236","authenticated-orcid":false,"given":"Alexander","family":"Vasiliev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"1_CR1","unstructured":"Ablayev, F., Ablayev, M.: On the concept of cryptographic quantum hashing. Laser Phys. Lett. 12(12), 125204 (2015). \nhttp:\/\/stacks.iop.org\/1612-202X\/12\/i=12\/a=125204"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Ablayev, F., Ablayev, M.: Quantum hashing via $$\\epsilon $$-universal hashing constructions and classical fingerprinting. Lobachevskii J. Math. 36(2), 89\u201396 (2015). \nhttps:\/\/doi.org\/10.1134\/S199508021502002X","DOI":"10.1134\/S199508021502002X"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Ablayev, F., Gainutdinova, A., Karpinski, M.: On computational power of quantum branching programs. In: Freivalds, R. (ed.) FCT, vol. 2138, pp. 59\u201370. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44669-9_8\n\n, \nhttp:\/\/arxiv.org\/abs\/quant-ph\/0302022","DOI":"10.1007\/3-540-44669-9_8"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Ablayev, F., Vasiliev, A.: Algorithms for quantum branching programs based on fingerprinting. Electron. Proc. Theoret. Comput. Sci. 9, 1\u201311 (2009). \nhttps:\/\/doi.org\/10.4204\/EPTCS.9.1\n\n, \nhttp:\/\/arxiv.org\/abs\/0911.2317","DOI":"10.4204\/EPTCS.9.1"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-23178-0_1","volume-title":"Parallel Computing Technologies","author":"F Ablayev","year":"2011","unstructured":"Ablayev, F., Vasiliev, A.: Classical and quantum parallelism in the quantum fingerprinting method. In: Malyshkin, V. (ed.) PaCT 2011. LNCS, vol. 6873, pp. 1\u201312. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-23178-0_1"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Ablayev, F., Vasiliev, A.: On computational power of quantum read-once branching programs. Electron. Proc. Theoret. Comput. Sci. 52, 1\u201312 (2011). \nhttps:\/\/doi.org\/10.4204\/EPTCS.52.1","DOI":"10.4204\/EPTCS.52.1"},{"key":"1_CR7","unstructured":"Ablayev, F., Vasiliev, A.: Cryptographic quantum hashing. Laser Phys. Lett. 11(2), 025202 (2014). \nhttp:\/\/stacks.iop.org\/1612-202X\/11\/i=2\/a=025202"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Alon, N., Roichman, Y.: Random Cayley graphs and expanders. Random Struct. Algorithms 5(2), 271\u2013284 (1994). \nhttps:\/\/doi.org\/10.1002\/rsa.3240050203","DOI":"10.1002\/rsa.3240050203"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: Proceeding of the 39th IEEE Conference on Foundation of Computer Science, FOCS 1998, pp. 332\u2013342. IEEE Computer Society, Washington, DC (1998). \nhttps:\/\/doi.org\/10.1109\/SFCS.1998.743469\n\n, \nhttp:\/\/arxiv.org\/abs\/quant-ph\/9802062","DOI":"10.1109\/SFCS.1998.743469"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Nahimovs, N.: Improved constructions of quantum automata. In: Kawano, Y., Mosca, M. (eds.) Theory of Quantum Computation, Communication, and Cryptography. LNCS, vol. 5106, pp. 47\u201356. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-89304-2_5\n\n, \nhttp:\/\/arxiv.org\/abs\/0805.1686","DOI":"10.1007\/978-3-540-89304-2_5"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Ben-Aroya, A., Ta-Shma, A.: Constructing small-bias sets from algebraic-geometric codes. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 191\u2013197, October 2009. \nhttps:\/\/doi.org\/10.1109\/FOCS.2009.44","DOI":"10.1109\/FOCS.2009.44"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Sudan, M., Vadhan, S., Wigderson, A.: Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In: Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 612\u2013621. ACM, New York (2003). \nhttps:\/\/doi.org\/10.1145\/780542.780631","DOI":"10.1145\/780542.780631"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de\u00a0Wolf, R.: Quantum fingerprinting. Phys. Rev. Lett. 87(16), 167902 (2001). \nhttps:\/\/doi.org\/10.1103\/PhysRevLett.87.167902\n\n, \nwww.arXiv.org\/quant-ph\/0102001v1","DOI":"10.1103\/PhysRevLett.87.167902"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Chen, S., Moore, C., Russell, A.: Small-bias sets for nonabelian groups. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. LNCS, vol. 8096, pp. 436\u2013451. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40328-6_31","DOI":"10.1007\/978-3-642-40328-6_31"},{"key":"1_CR15","unstructured":"Freivalds, R.: Probabilistic machines can use less running time. In: IFIP Congress, vol. 839, p. 842 (1977)"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Freivalds, R.: Fast probabilistic algorithms. In: Becvar, J. (ed.) Mathematical Foundations of Computer Science. LNCS, vol. 74, pp. 57\u201369. Springer, Heidelberg (1979). \nhttps:\/\/doi.org\/10.1007\/3-540-09526-8_5","DOI":"10.1007\/3-540-09526-8_5"},{"key":"1_CR17","unstructured":"Gavinsky, D., Ito, T.: Quantum fingerprints that keep secrets. Technical report. Cornell University Library \narXiv:quant-ph\/1010.5342\n\n (2010)"},{"key":"1_CR18","unstructured":"Gottesman, D., Chuang, I.: Quantum digital signatures. Technical report. Cornell University Library \narXiv:quant-ph\/0105032\n\n (2001)"},{"key":"1_CR19","unstructured":"Holevo, A.S.: Some estimates of the information transmitted by quantum communication channel (Russian). Probl. Pered. Inform. [Probl. Inf. Transm.] 9(3), 3\u201311 (1973)"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Li, D., Zhang, J., Guo, F.Z., Huang, W., Wen, Q.Y., Chen, H.: Discrete-time interacting quantum walks and quantum hash schemes. Quantum Inf. Process. 12(3), 1501\u20131513 (2013). \nhttps:\/\/doi.org\/10.1007\/s11128-012-0421-8","DOI":"10.1007\/s11128-012-0421-8"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Li, D., Zhang, J., Ma, X.W., Zhang, W.W., Wen, Q.Y.: Analysis of the two-particle controlled interacting quantum walks. Quantum Inf. Process. 12(6), 2167\u20132176 (2013). \nhttps:\/\/doi.org\/10.1007\/s11128-012-0516-2","DOI":"10.1007\/s11128-012-0516-2"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC 1990, pp. 213\u2013223. ACM, New York (1990). \nhttps:\/\/doi.org\/10.1145\/100216.100244","DOI":"10.1145\/100216.100244"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In: 40th Annual Symposium on Foundations of Computer Science, pp. 369\u2013376 (1999). \nhttps:\/\/doi.org\/10.1109\/SFFCS.1999.814608","DOI":"10.1109\/SFFCS.1999.814608"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, 1 edn. Cambridge University Press, Cambridge (2000). \nhttps:\/\/doi.org\/10.2277\/0521635039","DOI":"10.2277\/0521635039"},{"issue":"6","key":"1_CR26","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1134\/S1995080216060184","volume":"37","author":"A Vasiliev","year":"2016","unstructured":"Vasiliev, A.: Quantum hashing for finite abelian groups. Lobachevskii J. Math. 37(6), 753\u2013757 (2016). \nhttps:\/\/doi.org\/10.1134\/S1995080216060184","journal-title":"Lobachevskii J. Math."},{"key":"1_CR27","unstructured":"de Wolf, R.: Quantum computing and communication complexity. Ph.D. thesis, University of Amsterdam (2001)"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Yang, Y.G., Xu, P., Yang, R., Zhou, Y.H., Shi, W.M.: Quantum hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption. Sci. Rep. 6, 19788 (2016). \nhttps:\/\/doi.org\/10.1038\/srep19788","DOI":"10.1038\/srep19788"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:04:01Z","timestamp":1592780641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":">= 3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}