{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:48:13Z","timestamp":1767340093095,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030925475"},{"type":"electronic","value":"9783030925482"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92548-2_22","type":"book-chapter","created":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T08:18:55Z","timestamp":1638951535000},"page":"412-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Towards Quantum Large-Scale Password Guessing on\u00a0Real-World Distributions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5048-3723","authenticated-orcid":false,"given":"Markus","family":"D\u00fcrmuth","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2204-2132","authenticated-orcid":false,"given":"Maximilian","family":"Golla","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9232-4496","authenticated-orcid":false,"given":"Philipp","family":"Markert","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5965-5675","authenticated-orcid":false,"given":"Alexander","family":"May","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4870-1012","authenticated-orcid":false,"given":"Lars","family":"Schlieper","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,9]]},"reference":[{"issue":"4","key":"22_CR1","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1137\/S0097539799359385","volume":"38","author":"D Aharonov","year":"2008","unstructured":"Aharonov, D., Ben-Or, M.: Fault-tolerant quantum computation with constant error rate. SIAM J. Comput. 38(4), 1207\u20131282 (2008)","journal-title":"SIAM J. Comput."},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-319-10879-7_13","volume-title":"Security and Cryptography for Networks","author":"DV Bailey","year":"2014","unstructured":"Bailey, D.V., D\u00fcrmuth, M., Paar, C.: Statistics on password re-use and adaptive strength for financial accounts. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 218\u2013235. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_13"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Biryukov, A., Dinu, D., Khovratovich, D., Josefsson, S.: Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications. RFC 9106, RFC Editor, September 2021. https:\/\/tools.ietf.org\/html\/rfc9106","DOI":"10.17487\/RFC9106"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Blocki, J., Harsha, B., Zhou, S.: On the economics of offline password cracking. In: IEEE Symposium on Security and Privacy. SP 2018, pp. 35\u201353. IEEE, San Francisco, California, USA, May 2018","DOI":"10.1109\/SP.2018.00009"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-53887-6_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Boneh","year":"2016","unstructured":"Boneh, D., Corrigan-Gibbs, H., Schechter, S.: Balloon hashing: a memory-hard function providing provable protection against sequential attacks. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 220\u2013248. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_8"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Bonneau, J.: The Science of guessing: analyzing an anonymized corpus of 70 million passwords. In: IEEE Symposium on Security and Privacy. SP 2012, pp. 538\u2013552. IEEE, San Jose, California, USA, May 2012","DOI":"10.1109\/SP.2012.49"},{"key":"22_CR7","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. In: Workshop on Physics and Computation. PhysComp 1996, pp. 493\u2013506, Elsevier, Boston, Massachusetts, USA, November 1996"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemporary Math. 305, 53\u201374 (2002)","journal-title":"Contemporary Math."},{"key":"22_CR9","unstructured":"Brewster, T.: Why You Shouldn\u2019t Panic About Dropbox Leaking 68 Million Passwords, August 2016. https:\/\/www.forbes.com\/sites\/thomasbrewster\/2016\/08\/31\/dropbox-hacked-but-its-not-that-bad\/, as of 2021\/11\/20 18:59:40"},{"issue":"7671","key":"22_CR10","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1038\/nature23460","volume":"549","author":"ET Campbell","year":"2017","unstructured":"Campbell, E.T., Terhal, B.M., Vuillot, C.: Roads towards fault-tolerant universal quantum computation. Nature 549(7671), 172\u2013179 (2017)","journal-title":"Nature"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Cho, A.: IBM Promises 1000-Qubit Quantum Computer by 2023, September 2020. https:\/\/www.sciencemag.org\/news\/2020\/09\/ibm-promises-1000-qubit-quantum-computer-milestone-2023, as of 2021\/11\/20 18:59:40","DOI":"10.1126\/science.abe8122"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Wu, D.J., Boneh, D.: Quantum operating systems. In: Workshop on Hot Topics in Operating Systems. HotOS 2017, pp. 76\u201381. ACM, Vancouver, British Columbia, Canada, May 2017","DOI":"10.1145\/3102980.3102993"},{"key":"22_CR13","unstructured":"Crawford, H., Atkin, S.: Quantum authentication: current and future research directions. In: Who Are You?! Adventures in Authentication Workshop. WAY 2019, pp. 1\u20135, USENIX, Santa Clara, California, USA, August 2019"},{"key":"22_CR14","unstructured":"Croley (\u201cChick3nman\u201d), S.: Abusing Password Reuse at Scale: Bcrypt and Beyond, August 2018. https:\/\/www.youtube.com\/watch?v=5su3_Py8iMQ, as of 2021\/11\/20 18:59:40"},{"key":"22_CR15","unstructured":"Croley (\u201cChick3nman\u201d), S.: NVIDIA GeForce RTX 3090 Hashcat Benchmarks, November 2020. https:\/\/gist.github.com\/Chick3nman\/e4fcee00cb6d82874dace72106d73fef, as of 2021\/11\/20 18:59:40"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Das, A., Bonneau, J., Caesar, M., Borisov, N., Wang, X.: The tangled web of password reuse. In: Symposium on Network and Distributed System Security. NDSS 2014, ISOC, San Diego, California, USA, February 2014","DOI":"10.14722\/ndss.2014.23357"},{"key":"22_CR17","unstructured":"Digital Shadows Ltd: From Exposure to Takeover: The 15 Billion Stolen Credentials Allowing Account Takeover, July 2020. https:\/\/resources.digitalshadows.com\/whitepapers-and-reports\/from-exposure-to-takeover, as of 2021\/11\/20 18:59:40"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Flor\u00eancio, D., Herley, C.: A large-scale study of web password habits. In: The World Wide Web Conference. WWW 2007, pp. 657\u2013666. ACM, Banff, Alberta, Canada, May 2007","DOI":"10.1145\/1242572.1242661"},{"key":"22_CR19","unstructured":"Flor\u00eancio, D., Herley, C., Van Oorschot, P.C.: An administrator\u2019s guide to internet password research. In: Large Installation System Administration Conference, pp. 44\u201361. LISA 2014, USENIX, Seattle, Washington, USA, November 2014"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Golla, M., D\u00fcrmuth, M.: On the accuracy of password strength meters. In: ACM Conference on Computer and Communications Security. CCS 2018, pp. 1567\u20131582. ACM, Toronto, Ontario, Canada, October 2018","DOI":"10.1145\/3243734.3243769"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Golla, M., et al.: What was that site doing with my Facebook password? Designing password-reuse notifications. In: ACM Conference on Computer and Communications Security, pp. 1549\u20131566. ACM. CCS 2018, Toronto, Ontario, Canada, October 2018","DOI":"10.1145\/3243734.3243767"},{"key":"22_CR22","unstructured":"Goodin, D.: Once Seen as Bulletproof, 11 Million+ Ashley Madison Passwords Already Cracked, September 2015. https:\/\/arstechnica.com\/information-technology\/2015\/09\/once-seen-as-bulletproof-11-million-ashley-madison-passwords-already-cracked\/, as of 2021\/11\/20 18:59:40"},{"key":"22_CR23","unstructured":"Gosney (\u201cepixoip\u201d), J.M.: How LinkedIn\u2019s Password Sloppiness Hurts Us All, June 2016. https:\/\/arstechnica.com\/information-technology\/2016\/06\/how-linkedins-password-sloppiness-hurts-us-all\/, as of 2021\/11\/20 18:59:40"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Grassi, P.A., Fenton, J.L., Burr, W.E.: Digital Identity Guidelines - Authentication and Lifecycle Management: NIST Special Publication 800\u201363B, Jun 2017","DOI":"10.6028\/NIST.SP.800-63b"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: ACM Symposium on Theory of Computing. STOC 1996, pp. 212\u2013219. ACM, Philadelphia, Pennsylvania, USA, May 1996","DOI":"10.1145\/237814.237866"},{"issue":"7\u20138","key":"22_CR26","first-page":"673","volume":"17","author":"T H\u00e4ner","year":"2017","unstructured":"H\u00e4ner, T., Roetteler, M., Svore, K.M.: Factoring using $$2n+2$$ qubits with Toffoli based modular multiplication. Quantum Inf. Comput. 17(7\u20138), 673\u2013684 (2017)","journal-title":"Quantum Inf. Comput."},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"22_CR28","unstructured":"Huh, J.H., Kim, H., Bobba, R.B., Bashir, M.N., Beznosov, K.: On the memorability of system-generated PINs: can chunking help? In: Symposium on Usable Privacy and Security, pp. 197\u2013209. SOUPS 2015, USENIX, Ottawa, Canada, July 2015"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-662-53008-5_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Kaplan","year":"2016","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., Naya-Plasencia, M.: Breaking symmetric cryptosystems using\u00a0quantum\u00a0period finding. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 207\u2013237. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_8"},{"key":"22_CR30","unstructured":"Kedem, G., Ishihara, Y.: Brute force attack on UNIX passwords with SIMD computer. In: USENIX Security Symposium. SSYM 1999, pp. 93\u201398, USENIX, Washington, District of Columbia, USA, August 1999"},{"issue":"1969","key":"22_CR31","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1098\/rspa.1998.0166","volume":"454","author":"E Knill","year":"1998","unstructured":"Knill, E., Laflamme, R., Zurek, W.H.: Resilient quantum computation: error models and thresholds. Proc. Royal Soc. A: Math. Phys. Eng. Sci. 454(1969), 365\u2013384 (1998)","journal-title":"Proc. Royal Soc. A: Math. Phys. Eng. Sci."},{"key":"22_CR32","unstructured":"Kuwakado, H., Morii, M.: Security on the quantum-type even-Mansour cipher. In: International Symposium on Information Theory and Its Applications. ISITA 2012, pp. 312\u2013316. IEEE, Honolulu, Hawaii, USA, October 2012"},{"key":"22_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-70697-9_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"G Leander","year":"2017","unstructured":"Leander, G., May, A.: Grover meets Simon \u2013 quantumly attacking the FX-construction. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 161\u2013178. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_6"},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"Liu, E., Nakanishi, A., Golla, M., Cash, D., Ur, B.: reasoning analytically about password-cracking software. In: IEEE Symposium on Security and Privacy. SP 2019, pp. 380\u2013397. IEEE, San Francisco, California, USA, May 2019","DOI":"10.1109\/SP.2019.00070"},{"key":"22_CR35","doi-asserted-by":"crossref","unstructured":"Malone, D., Maher, K.: Investigating the distribution of password choices. In: The World Wide Web Conference. WWW 2012, pp. 301\u2013310. ACM, Lyon, France, April 2012","DOI":"10.1145\/2187836.2187878"},{"key":"22_CR36","doi-asserted-by":"crossref","unstructured":"Mirian, A., DeBlasio, J., Savage, S., Voelker, G.M., Thomas, K.: Hack for hire: exploring the emerging market for account hijacking. In: The World Wide Web Conference. WWW 2019, pp. 1279\u20131289. ACM, San Francisco, California, USA, May 2019","DOI":"10.1145\/3308558.3313489"},{"key":"22_CR37","doi-asserted-by":"crossref","unstructured":"Pal, B., Daniel, T., Chatterjee, R., Ristenpart, T.: Beyond credential stuffing: password similarity models using neural networks. In: IEEE Symposium on Security and Privacy. SP 2019, pp. 866\u2013883. IEEE, San Francisco, California, USA, May 2019","DOI":"10.1109\/SP.2019.00056"},{"key":"22_CR38","doi-asserted-by":"crossref","unstructured":"Pearman, S., et al.: Let\u2019s go in for a closer look: observing passwords in their natural habitat. In: ACM Conference on Computer and Communications Security. CCS 2017, pp. 295\u2013310. ACM, Dallas, Texas, USA, Oct 2017","DOI":"10.1145\/3133956.3133973"},{"key":"22_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-70697-9_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"M Roetteler","year":"2017","unstructured":"Roetteler, M., Naehrig, M., Svore, K.M., Lauter, K.: Quantum resource estimates for computing elliptic curve discrete logarithms. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 241\u2013270. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_9"},{"issue":"5","key":"22_CR40","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MSP.2018.3761710","volume":"16","author":"M Roetteler","year":"2018","unstructured":"Roetteler, M., Svore, K.M.: Quantum computing: codebreaking and beyond. IEEE Secur. Privacy 16(5), 22\u201336 (2018)","journal-title":"IEEE Secur. Privacy"},{"key":"22_CR41","doi-asserted-by":"crossref","unstructured":"Shay, R., et al.: A spoonful of sugar?: The impact of guidance and feedback on password-creation behavior. In: ACM Conference on Human Factors in Computing Systems. CHI 2015, pp. 2903\u20132912. ACM, Seoul, Republic of Korea, April 2015","DOI":"10.1145\/2702123.2702586"},{"key":"22_CR42","doi-asserted-by":"crossref","unstructured":"Shay, R., et al.: Can long passwords be secure and usable? In: ACM Conference on Human Factors in Computing Systems. CHI 2014, pp. 2927\u20132936. ACM, Toronto, Ontario, Canada, April 2014","DOI":"10.1145\/2556288.2557377"},{"key":"22_CR43","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: IEEE Annual Symposium on Foundations of Computer Science. FOCS 1994, pp. 124\u2013134. IEEE, Santa Fe, New Mexico, USA, November 1994"},{"key":"22_CR44","doi-asserted-by":"crossref","unstructured":"Tan, J., Bauer, L., Christin, N., Cranor, L.F.: Definitive recommendations for stronger, more usable passwords combining minimum-strength, minimum-length, and blacklist requirements. In: ACM Conference on Computer and Communications Security. CCS 2020, pp. 1407\u20131426. ACM, Virtual Event, USA, November 2020","DOI":"10.1145\/3372297.3417882"},{"key":"22_CR45","doi-asserted-by":"crossref","unstructured":"Ur, B., Bees, J., Segreti, S.M., Bauer, L., Christin, N., Cranor, L.F.: Do users\u2019 perceptions of password security match reality? In: ACM Conference on Human Factors in Computing Systems. CHI 2016, pp. 3748\u20133760. ACM, Santa Clara, California, USA, May 2016","DOI":"10.1145\/2858036.2858546"},{"key":"22_CR46","unstructured":"Ur, B., et al.: \u201cI Added \u2018!\u2019 at the end to make it secure\u201d: observing password creation in the lab. In: Symposium on Usable Privacy and Security, pp. 123\u2013140. SOUPS 2015, USENIX, Ottawa, Ontario, Canada, July 2015"},{"key":"22_CR47","doi-asserted-by":"crossref","unstructured":"Veras, R., Collins, C., Thorpe, J.: On the semantic patterns of passwords and their security impact. In: Symposium on Network and Distributed System Security. NDSS 2014, ISOC, San Diego, California, USA, February 2014","DOI":"10.14722\/ndss.2014.23103"},{"issue":"11","key":"22_CR48","doi-asserted-by":"publisher","first-page":"2776","DOI":"10.1109\/TIFS.2017.2721359","volume":"12","author":"D Wang","year":"2017","unstructured":"Wang, D., Cheng, H., Wang, P., Huang, X., Jian, G.: Zipf\u2019s law in passwords. IEEE Trans. Inf. Forensics Secur. 12(11), 2776\u20132791 (2017)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"22_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-45744-4_6","volume-title":"Computer Security \u2013 ESORICS 2016","author":"D Wang","year":"2016","unstructured":"Wang, D., Wang, P.: On the implications of Zipf\u2019s law in passwords. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9878, pp. 111\u2013131. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45744-4_6"},{"key":"22_CR50","doi-asserted-by":"crossref","unstructured":"Wang, D., Zhang, Z., Wang, P., Yan, J., Huang, X.: Targeted online password guessing: an underestimated threat. In: ACM Conference on Computer and Communications Security. CCS 2016, pp. 1242\u20131254. ACM, Vienna, Austria, October 2016","DOI":"10.1145\/2976749.2978339"},{"key":"22_CR51","unstructured":"Wash, R., Radar, E., Berman, R., Wellmer, Z.: Understanding password choices: how frequently entered passwords are re-used across websites. In: Symposium on Usable Privacy and Security, pp. 175\u2013188. SOUPS 2016, USENIX, Denver, Colorado, USA, July 2016"},{"issue":"5","key":"22_CR52","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/MSP.2004.81","volume":"2","author":"J Yan","year":"2004","unstructured":"Yan, J., Blackwell, A., Anderson, R., Grant, A.: Password memorability and security: empirical results. IEEE Secur. Privacy 2(5), 25\u201331 (2004)","journal-title":"IEEE Secur. Privacy"},{"key":"22_CR53","volume-title":"Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology","author":"GK Zipf","year":"1949","unstructured":"Zipf, G.K.: Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology. Addison-Wesley Press, Cambridge (1949)"},{"issue":"3","key":"22_CR54","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1093\/comjnl\/36.3.227","volume":"36","author":"M Zviran","year":"1993","unstructured":"Zviran, M., Haga, W.J.: A comparison of password techniques for multilevel authentication mechanisms. Comput. J. 36(3), 227\u2013237 (1993)","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92548-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:02:54Z","timestamp":1710356574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92548-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030925475","9783030925482"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92548-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cans2021.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"85","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":"3","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":"29% - 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":"2.5","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":"8.5","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 held virtually due to the COVID-19 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)"}}]}}