{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T17:51:39Z","timestamp":1772041899595,"version":"3.50.1"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031171451","type":"print"},{"value":"9783031171468","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-17146-8_15","type":"book-chapter","created":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T23:35:39Z","timestamp":1663803339000},"page":"295-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Quantum-Resistant Password-Based Threshold Single-Sign-On Authentication with\u00a0Updatable Server Private Key"],"prefix":"10.1007","author":[{"given":"Jingwei","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Ding","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Guoyin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhiyuan","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,22]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Bonneau, J., Herley, C., Oorschot, P., Stajano, F.: The quest to replace passwords: a framework for comparative evaluation of web authentication schemes. In: Proceedings of the IEEE S &P 2012, pp. 553\u2013567 (2012)","DOI":"10.1109\/SP.2012.44"},{"issue":"7","key":"15_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2699390","volume":"58","author":"J Bonneau","year":"2015","unstructured":"Bonneau, J., Herley, C., van Oorschot, P., Stajano, F.: Passwords and the evolution of imperfect authentication. Commun. ACM 58(7), 78\u201387 (2015)","journal-title":"Commun. ACM"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Hanamsagar, A., Woo, S., Kanich, C., Mirkovic, J.: Leveraging semantic transformation to investigate password habits and their causes. In: Proceedings of the CHI, pp. 1\u201312 (2018)","DOI":"10.1145\/3173574.3174144"},{"key":"15_CR4","unstructured":"Spadafora, A.: Struggling with password overload? You\u2019re not alone (2020). https:\/\/www.techradar.com\/news\/most-people-have-25-more-passwords-than-at-the-start-of-the-pandemic. Accessed 21 Oct 2020"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Wang, D., Zhang, Z., Wang, P., Yan, J., Huang, X.: Targeted online password guessing: an underestimated threat. In Proceedings of the ACM CCS 2016, pp. 1242\u20131254 (2016)","DOI":"10.1145\/2976749.2978339"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Pal, B., Daniel, T., Chatterjee, R., Ristenpart, T.:. Beyond credential stuffing: password similarity models using neural networks. In Proceedings of the IEEE S &P, pp. 417\u2013434 (2019)","DOI":"10.1109\/SP.2019.00056"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Armando, A., Carbone, R., Compagna, L., Cuellar, J., Tobarra, L.: Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for google apps. In: Proceedings of the FMSE 2008, pp. 1\u201310 (2008)","DOI":"10.1145\/1456396.1456397"},{"issue":"9","key":"15_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/35.312841","volume":"32","author":"B Neuman","year":"1994","unstructured":"Neuman, B., Ts\u2019o, T.: Kerberos: an authentication service for computer networks. IEEE Commun. Mag. 32(9), 33\u201338 (1994)","journal-title":"IEEE Commun. Mag."},{"key":"15_CR9","unstructured":"Jones, M., Bradley, J., Sakimura, N.: JSON Web Tokens. https:\/\/jwt.io\/. Accessed 15 Dec 2021"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Wang, D., Wang, P.: Offline dictionary attack on password authentication schemes using smart cards. In: Proceedings of the ISC 2013, pp. 221\u2013237 (2013)","DOI":"10.1007\/978-3-319-27659-5_16"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Alwen, J., Chen, B., Pietrzak, K., Reyzin, L., Tessaro, S.: Scrypt is maximally memory-hard. In: Proceedings of the Eurocrypt 2017, pp. 33\u201362 (2017)","DOI":"10.1007\/978-3-319-56617-7_2"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Miao, P., Mohassel, P., Mukherjee, P.: PASTA: password-based threshold authentication. In: Proceedings of the ACM CCS 2018, pp. 2042\u20132059 (2018)","DOI":"10.1145\/3243734.3243839"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"MacKenzie, P., Shrimpton, T., Jakobsson, M.: Threshold password-authenticated key exchange. In: Proceedings of the CRYPTO 2002, pp. 385\u2013400 (2002)","DOI":"10.1007\/3-540-45708-9_25"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Rabin, T.: A simplified approach to threshold and proactive RSA. In: Proceedings of the CRYPTO 1998, pp. 89\u2013104 (1998)","DOI":"10.1007\/BFb0055722"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Bagherzandi, A., Jarecki, S., Saxena, N., Lu, Y.: Password-protected secret sharing. In: Proceedings of the ACM CCS 2011, pp. 433\u2013444 (2011)","DOI":"10.1145\/2046707.2046758"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H.: Round-optimal password-protected secret sharing and T-PAKE in the password-only model. In: Proceedings of the ASIACRYPT, pp. 233\u2013253 (2014)","DOI":"10.1007\/978-3-662-45608-8_13"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H., Xu, J.: TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF. In: Proceedings of the ACNS, pp. 39\u201358 (2017)","DOI":"10.1007\/978-3-319-61204-1_3"},{"issue":"6","key":"15_CR18","doi-asserted-by":"publisher","first-page":"2297","DOI":"10.1109\/TMC.2020.2975792","volume":"20","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Xu, C., Li, H., Yang, K., Cheng, N., Shen, X.: PROTECT: efficient password-based threshold single-sign-on authentication for mobile users against perpetual leakage. IEEE Trans. Mob. Comput. 20(6), 2297\u20132312 (2020)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Baum, C., Frederiksen, T., Hesse, J., Lehmann, A., Yanai, A.: PESTO: proactively secure distributed single sign-on, or how to trust a hacked server. In: Proceedings of the EuroS &P 2020, pp. 587\u2013606 (2020)","DOI":"10.1109\/EuroSP48549.2020.00044"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Rawat, R., Jhanwar, M.: PAS-TA-U: PASsword-based threshold authentication with password update. In: Proceedings of the SPACE 2020, pp. 25\u201345 (2020)","DOI":"10.1007\/978-3-030-66626-2_2"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: how to cope with perpetual leakage. In: Proceedings of the CRYPTO 1995, pp. 339\u2013352 (1995)","DOI":"10.1007\/3-540-44750-4_27"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Ladd, T., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., OBrien, J.: Quantum computers. Nature 464(7285), 45\u201353 (2010)","DOI":"10.1038\/nature08812"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Mavroeidis, V., Vishi, K., Zych, M., J\u00f8sang, A.: The impact of quantum computing on present cryptography. Int. J. Adv. Comput. Sci. Appl. 9(3), 405\u2013414 (2018). IEEE Trans. Mob. Comput. 20(6), 2297\u20132312 (2020)","DOI":"10.14569\/IJACSA.2018.090354"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the first round of the NIST post-quantum cryptography standardization process (2019). https:\/\/nvlpubs.nist.gov\/nistpubs\/ir\/2019\/NIST.IR.8240.pdf","DOI":"10.6028\/NIST.IR.8240"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the second round of the NIST post-quantum cryptography standardization process. Status Report on the Second Round of the NIST Post-quantum Cryptography Standardization Process. NIST, Tech. Rep. (2020)","DOI":"10.6028\/NIST.IR.8240"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Ding, J., Alsayigh, S., Lancrenon, J., Saraswathy, R., Snook, M.: Provably secure password authenticated key exchange based on RLWE for the post-quantum world. In: Proceedings of the CT-RSA 2017, pp. 183\u2013204 (2017)","DOI":"10.1007\/978-3-319-52153-4_11"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Li, Z., Wang, D.: Two-round PAKE protocol over lattices without NIZK. In: Proceedings of the INSCRYPT 2018, pp. 138\u2013159 (2018)","DOI":"10.1007\/978-3-030-14234-6_8"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Costello, C., Naehrig, M., Stebila, D.: Post-quantum key exchange for the TLS protocol from the ring learning with errors problem. In: Proceedings of the IEEE S &P 2015, pp. 553\u2013570 (2015)","DOI":"10.1109\/SP.2015.40"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, J., Zhang, Z., Ding, J., Snook, M., Dagdelen, O.: Authenticated key exchange from ideal lattices. In: Proceedings of the EUROCRYPT 2015, pp. 719\u2013751 (2015)","DOI":"10.1007\/978-3-662-46803-6_24"},{"issue":"1","key":"15_CR30","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C Schnorr","year":"1994","unstructured":"Schnorr, C., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(1), 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of the STOC 1996, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status Report on the Third Round of the NIST Post-Quantum Cryptography Standardization Process. National Institute of Standards and Technology, Gaithersburg (2022)","DOI":"10.6028\/NIST.IR.8413"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Proceedings of the ASIACRYPT 2001, pp. 514\u2013532 (2001)","DOI":"10.1007\/3-540-45682-1_30"},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Proceedings of the CRYPTO 2018, pp. 565\u2013596 (2018)","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Albrecht, M., Davidson, A., Deo, A., Smart, N.: Round-optimal verifiable oblivious pseudorandom functions from ideal lattices. In: Proceedings of the PKC 2021, pp. 261\u2013289 (2021)","DOI":"10.1007\/978-3-030-75248-4_10"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Bellare, M., Pointcheval, D., Rogaway, P.: Authenticated key exchange secure against dictionary attacks. In: Proceedings of the EUROCRYPT 2000, pp. 139\u2013155 (2000)","DOI":"10.1007\/3-540-45539-6_11"},{"issue":"6","key":"15_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM 60(6), 1\u201335 (2013)","journal-title":"J. ACM"},{"issue":"11","key":"15_CR38","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. ACM Commun. 22(11), 612\u2013613 (1979)","journal-title":"ACM Commun."},{"key":"15_CR39","doi-asserted-by":"crossref","unstructured":"Bendlin, R., Krehbiel, S., Peikert, C.: How to share a lattice trapdoor: threshold protocols for signatures and (H) IBE. In: Proceedings of the ACNS 2013, pp. 218\u2013236 (2013)","DOI":"10.1007\/978-3-642-38980-1_14"},{"issue":"1","key":"15_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/536527","volume":"2014","author":"Z Jing","year":"2014","unstructured":"Jing, Z.: An efficient homomorphic aggregate signature scheme based on lattice. Math. Probl. Eng. 2014(1), 1\u20139 (2014)","journal-title":"Math. Probl. Eng."},{"key":"15_CR41","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boyen, X., Vaikuntanathan, V., Voulgaris, P., Hoeteck, W.: Functional encryption for threshold functions (or fuzzy IBE) from lattices. In: Proceedings of the PKC 2012, pp. 280\u2013297 (2012)","DOI":"10.1007\/978-3-642-30057-8_17"},{"issue":"11","key":"15_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-012-4681-9","volume":"56","author":"FH Wang","year":"2012","unstructured":"Wang, F.H., Hu, Y.P., Wang, B.C.: Lattice-based linearly homomorphic signature scheme over binary field. Sci. China Inf. Sci. 56(11), 1\u20139 (2012). https:\/\/doi.org\/10.1007\/s11432-012-4681-9","journal-title":"Sci. China Inf. Sci."},{"key":"15_CR43","doi-asserted-by":"crossref","unstructured":"Banerjee, A., Peikert, C.: New and improved key-homomorphic pseudorandom functions. In: Proceedings of the CRYPTO 2014, pp. 353\u2013370 (2014)","DOI":"10.1007\/978-3-662-44371-2_20"},{"key":"15_CR44","doi-asserted-by":"crossref","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Proceedings of the ASIACRYPT 2011, pp. 41\u201369 (2011)","DOI":"10.1007\/978-3-642-25385-0_3"},{"issue":"11","key":"15_CR45","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. Foren. Sec. 12(11), 2776\u20132791 (2017)","journal-title":"IEEE Trans. Inf. Foren. Sec."},{"key":"15_CR46","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.ins.2018.11.004","volume":"501","author":"B Rajabi","year":"2019","unstructured":"Rajabi, B., Eslami, Z.: A verifiable threshold secret sharing scheme based on lattices. Inf. Sci. 501, 655\u2013661 (2019)","journal-title":"Inf. Sci."},{"key":"15_CR47","doi-asserted-by":"crossref","unstructured":"Alkim, E., Barreto, P., Bindel, N., Kr\u00e4mer, J., Longa, P., Ricardini, J.: The lattice-based digital signature scheme qTESLA. In: Proceedings of the ACNS 2020, pp. 441\u2013460 (2020)","DOI":"10.1007\/978-3-030-57808-4_22"},{"key":"15_CR48","unstructured":"Everspaugh, A., Chaterjee, R., Scott, S., Juels, A., Ristenpart, T.: The Pythia PRF service. In: Proceedings of the USENIX SEC 2015, pp. 547\u2013562 (2015)"},{"key":"15_CR49","doi-asserted-by":"crossref","unstructured":"Li, Z., Wang, D., Morais, E.: Quantum-safe round-optimal password authentication for mobile devices. IEEE Trans. Depend. Secur. Comput. 19(3), 1885\u20131899 (2020)","DOI":"10.1109\/TDSC.2020.3040776"},{"key":"15_CR50","unstructured":"Alkim, E., Ducas, L., Poppelmann, T., Schwabe, P.: Post-quantum key exchange a new hope. In: Proceedings of the USENIX SEC 2016, pp. 327\u2013343 (2016)"},{"issue":"3","key":"15_CR51","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. CRYPTOL 9(3), 169\u2013203 (2015)","journal-title":"J. CRYPTOL"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17146-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T10:33:57Z","timestamp":1701081237000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17146-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031171451","9783031171468"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17146-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"22 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2022.compute.dtu.dk\/","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":"562","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":"104","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":"6","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":"19% - 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.4","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":"12","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)"}}]}}