{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T08:10:04Z","timestamp":1785831004149,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540140399","type":"print"},{"value":"9783540392002","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-39200-9_32","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:35:32Z","timestamp":1187249732000},"page":"507-523","source":"Crossref","is-referenced-by-count":44,"title":["Provably Secure Threshold Password-Authenticated Key Exchange"],"prefix":"10.1007","author":[{"given":"Mario","family":"Di Raimondo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"32_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-48405-1_9","volume-title":"CRYPTO\u2019 99","author":"M. Abe","year":"1999","unstructured":"M. Abe, Robust distributed multiplication without interaction. In CRYPTO\u2019 99, Springer LNCS 1666, pp. 130\u2013147, 1999."},{"key":"32_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-45539-6_11","volume-title":"EUROCRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"M. Bellare, D. Pointcheval and P. Rogaway, Authenticated key exchange secure against dictionary attacks. In EUROCRYPT 2000, Springer LNCS 1807, pp. 139\u2013155, 2000."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"S. M. Bellovin and M. Merritt, Encrypted Key Exchange: Password based protocols secure against dictionary attacks. In 1992 IEEE Symposium on Research in Security and Privacy, IEEE Press, pp. 72\u201384, 1992.","DOI":"10.1109\/RISP.1992.213269"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. In 20 th Annual Symposium on the Theory of Computing, ACM Press, pp. 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"32_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Third Algorithmic Number Theory Symposium","author":"D. Boneh","year":"1998","unstructured":"D. Boneh, The Decision Diffie-Hellman Problem. In Third Algorithmic Number Theory Symposium, Springer LNCS 1423, pp. 48\u201363, 1998."},{"key":"32_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-45539-6_12","volume-title":"EUROCRYPT 2000","author":"V. Boyko","year":"2000","unstructured":"V. Boyko, P. D. MacKenzie, and S. Patel, Provably secure password-authenticated key exchange using Diffie-Hellman. In EUROCRYPT 2000, Springer LNCS 1807, pp. 156\u2013171, 2000."},{"key":"32_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/3-540-48405-1_7","volume-title":"CRYPTO\u2019 99","author":"R. Canetti","year":"1999","unstructured":"R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, Adaptive Security for Threshold Cryptosystems. In CRYPTO\u2019 99, Springer LNCS 1666, pp. 98\u2013115, 1999."},{"issue":"4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y. G. Desmedt","year":"1994","unstructured":"Y. G. Desmedt, Threshold cryptography. European Transactions on Telecommunications, 5(4):449\u2013457, July 1994.","journal-title":"European Transactions on Telecommunications"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"P. Feldman, A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In 28 th IEEE Symposium on Foundation of Computer Science (FOCS), IEEE, pp. 427\u2013437, 1987.","DOI":"10.1109\/SFCS.1987.4"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"W. Ford and B. Kaliski, Server-assisted generation of a strong secret from a password. In 5 th IEEE International Workshop on Enterprise Security, 2000.","DOI":"10.1109\/ENABL.2000.883724"},{"key":"32_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/3-540-48481-7_2","volume-title":"European Symposium on Algorithms (ESA\u2019 99)","author":"Y. Frankel","year":"1999","unstructured":"Y. Frankel, P. MacKenzie and M. Yung, Adaptively-Secure Distributed Public-Key Systems. In European Symposium on Algorithms (ESA\u2019 99), Springer LNCS 1643, pp. 4\u201327, 1999."},{"key":"32_CR12","unstructured":"P. Gemmell, An Introduction to Threshold Cryptography. RSA Laboratories\u2019 CRYPTOBYTES, vol. 2, n. 3, Winter 1997."},{"key":"32_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-48910-X_21","volume-title":"EUROCRYPT\u2019 99","author":"R. Gennaro","year":"1999","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, The (in)security of distributed key generation in dlog-based cryptosystems. In EUROCRYPT\u2019 99, Springer LNCS 1592, pp. 295\u2013310, 1999."},{"key":"32_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/3-540-44647-8_24","volume-title":"CRYPTO 2001","author":"O. Goldreich","year":"2001","unstructured":"O. Goldreich and Y. Lindell, Session Key Generation using Human Passwords Only. In CRYPTO 2001, Springer LNCS 2139, pp. 408\u2013432, 2001."},{"issue":"5","key":"32_CR15","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1109\/49.223865","volume":"11","author":"L. Gong","year":"1993","unstructured":"L. Gong, T. M. A. Lomas, R. M. Needham and J. H. Saltzer, Protecting poorly chosen secrets from guessing attacks. IEEE Journal on Selected Areas in Communications, 11(5):648\u2013656, 1993.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"3","key":"32_CR16","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/322510.322514","volume":"2","author":"S. Halevi","year":"1999","unstructured":"S. Halevi and H. Krawczyk, Public-key cryptography and password protocols. ACM Transactions on Information and System Security, 2(3):230\u2013268, 1999.","journal-title":"ACM Transactions on Information and System Security"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung. Proactive public key and signature systems. In 4 th ACM Conference on Computers and Communication Security, ACM Press, pp. 100\u2013110, 1997.","DOI":"10.1145\/266420.266442"},{"key":"32_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"CRYPTO\u2019 95","author":"A. Herzberg","year":"1995","unstructured":"A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, Proactive secret sharing, or: How to cope with perpetual leakage. In CRYPTO\u2019 95, Springer LNCS 963, pp. 339\u2013352, 1995."},{"issue":"5","key":"32_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/242896.242897","volume":"26","author":"D. P. Jablon","year":"1996","unstructured":"D. P. Jablon, Strong password-only authenticated key exchange. ACM Computer Communication Review, ACM SIGCOMM, 26(5):5\u201326, October 1996.","journal-title":"ACM Computer Communication Review"},{"key":"32_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/3-540-45353-9_26","volume-title":"RSA Security Conference 2001","author":"D. P. Jablon","year":"2001","unstructured":"D. P. Jablon, Password authentication using multiple servers. In RSA Security Conference 2001, Springer LNCS 2020, pp. 344\u2013360, 2001."},{"key":"32_CR21","series-title":"Lect Notes Comput Sci","first-page":"385","volume-title":"CRYPTO 2002","author":"M. Jakobsson","year":"2002","unstructured":"M. Jakobsson, P. MacKenzie and T. Shrimpton, Threshold Password-Authenticated Key Exchange. In CRYPTO 2002, Springer LNCS 2442, pp. 385\u2013400, 2002."},{"key":"32_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-45539-6_16","volume-title":"EUROCRYPT 2000","author":"S. Jarecki","year":"2000","unstructured":"S. Jarecki and A. Lysyanskaya, Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures. In EUROCRYPT 2000, Springer LNCS 1807, pp. 221\u2013242, 2000."},{"key":"32_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/3-540-44987-6_29","volume-title":"EUROCRYPT 2001","author":"J. Katz","year":"2001","unstructured":"J. Katz, R. Ostrovsky and M. Yung, Efficient password-authenticated key exchange using human-memorable passwords. In EUROCRYPT 2001, Springer LNCS 2045, pp. 475\u2013494, 2001."},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and M. Yung, How to Withstand Mobile Virus Attacks. In 10 th ACM Conference on Principles of Distributed Systems, ACM Press, pages 51\u201359, 1991.","DOI":"10.1145\/112600.112605"},{"key":"32_CR25","series-title":"Lect Notes Comput Sci","first-page":"129","volume-title":"CRYPTO\u2019 91","author":"T. Pedersen","year":"1991","unstructured":"T. Pedersen, Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO\u2019 91, Springer LNCS 576, pp. 129\u2013140, 1991."},{"key":"32_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"CRYPTO\u2019 98","author":"T. Rabin","year":"1998","unstructured":"T. Rabin, A simplified Approach to Threshold and Proactive RSA. In CRYPTO\u2019 98, Springer LNCS 1462, pp. 89\u2013104, 1998."},{"issue":"11","key":"32_CR27","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to Share a Secret. Communications of the ACM, 22(11):612\u2013613, 1979.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39200-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:09:11Z","timestamp":1556770151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39200-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540140399","9783540392002"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-39200-9_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}