{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:41:05Z","timestamp":1725864065818},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319458700"},{"type":"electronic","value":"9783319458717"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45871-7_7","type":"book-chapter","created":{"date-parts":[[2016,8,25]],"date-time":"2016-08-25T08:25:24Z","timestamp":1472113524000},"page":"95-114","source":"Crossref","is-referenced-by-count":5,"title":["Blind Password Registration for Two-Server Password Authenticated Key Exchange and Secret Sharing Protocols"],"prefix":"10.1007","author":[{"given":"Franziskus","family":"Kiefer","sequence":"first","affiliation":[]},{"given":"Mark","family":"Manulis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,26]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s13389-013-0057-3","volume":"3","author":"JA Akinyele","year":"2013","unstructured":"Akinyele, J.A., Garman, C., Miers, I., Pagano, M.W., Rushanan, M., Green, M., Rubin, A.D.: Charm: a framework for rapidly prototyping cryptosystems. J. Crypt. Eng. 3(2), 111\u2013128 (2013)","journal-title":"J. Crypt. Eng."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Bagherzandi, A., Jarecki, S., Saxena, N., Lu, Y.: Password-protected secret sharing. In: CCS 2011, pp. 433\u2013444. ACM (2011)","DOI":"10.1145\/2046707.2046758"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bonneau, J.: The science of guessing: analyzing an anonymized corpus of 70 million passwords. In: IEEE S&P, pp. 538\u2013552. IEEE Computer Society (2012)","DOI":"10.1109\/SP.2012.49"},{"key":"7_CR4","unstructured":"Brainard, J.G., Juels, A., Kaliski, B., Szydlo, M.: A new two-server approach for authentication with short secrets. In: USENIX Security Symposium, USENIX Association (2003)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/978-3-662-44381-1_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"J Camenisch","year":"2014","unstructured":"Camenisch, J., Lehmann, A., Lysyanskaya, A., Neven, G.: Memento: how to reconstruct your secrets from a single password in a hostile environment. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 256\u2013275. Springer, Heidelberg (2014)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A., Neven,G.: Practical yet universally composable two-server password-authenticated secret sharing. In: CCS 2012, pp. 525\u2013536. ACM (2012)","DOI":"10.1145\/2382196.2382252"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"IB Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.B.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 418\u2013430. Springer, Heidelberg (2000)"},{"key":"7_CR8","unstructured":"Goodin, D., Hack of cupid media dating website exposes 42 million plaintext passwords. http:\/\/goo.gl\/ImLE1C . Accessed 01 Apr 2015"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Dell\u2019Amico, M., Michiardi, P., Roudier, Y.: Password strength: an empirical analysis. In: INFOCOM, pp. 983\u2013991. IEEE (2010)","DOI":"10.1109\/INFCOM.2010.5461951"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Dierks, T., Rescorla, E.: The Transport Layer Security (TLS) protocol version 1.2. RFC 5246 (proposed standard), updated by RFCs 5746, 5878, 6176, 7465, August 2008","DOI":"10.17487\/rfc5246"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"D\u00fcrmuth, M., Kranz, T.: On password guessing with GPUs and FPGAs. In: PASSWORDS 2014, pp. 19\u201338 (2014)","DOI":"10.1007\/978-3-319-24192-0_2"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Ford, W., Kaliski, Jr. B.S.: Server-assisted generation of a strong secret from a password. In: WETICE, pp. 176\u2013180. IEEE (2000)","DOI":"10.1109\/ENABL.2000.883724"},{"issue":"1","key":"7_CR13","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1093\/ietfec\/E88-A.1.172","volume":"88\u2013A","author":"J Furukawa","year":"2005","unstructured":"Furukawa, J.: Efficient and verifiable shuffling and shuffle-decryption. IEICE Trans. 88\u2013A(1), 172\u2013188 (2005)","journal-title":"IEICE Trans."},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"J Furukawa","year":"2001","unstructured":"Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 368\u2013387. Springer, Heidelberg (2001)"},{"key":"7_CR15","unstructured":"hashcat: hashcat - advanced password recovery. http:\/\/hashcat.net\/ . Accessed 01 Apr 2015"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-642-32009-5_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"T Jager","year":"2012","unstructured":"Jager, T., Kohlar, F., Sch\u00e4ge, S., Schwenk, J.: On the security of TLS-DHE in the standard model. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 273\u2013293. Springer, Heidelberg (2012)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-662-45608-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"S Jarecki","year":"2014","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H.: Round-optimal password-protected secret sharing and T-PAKE in the password-only model. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part II. LNCS, vol. 8874, pp. 233\u2013253. Springer, Heidelberg (2014)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-45539-6_16","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"S Jarecki","year":"2000","unstructured":"Jarecki, S., Lysyanskaya, A.: Adaptively secure threshold cryptography: introducing concurrency, removing erasures (extended abstract). In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, p. 221. Springer, Heidelberg (2000)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/978-3-540-77048-0_4","volume-title":"Information and Communications Security","author":"H Jin","year":"2007","unstructured":"Jin, H., Wong, D.S., Xu, Y.: An efficient password-only two-server authenticated key exchange system. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol. 4861, pp. 44\u201356. Springer, Heidelberg (2007)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/11496137_1","volume-title":"Applied Cryptography and Network Security","author":"J Katz","year":"2005","unstructured":"Katz, J., MacKenzie, P.D., Taban, G., Gligor, V.D.: Two-server password-only authenticated key exchange. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-319-07536-5_13","volume-title":"Applied Cryptography and Network Security","author":"F Kiefer","year":"2014","unstructured":"Kiefer, F., Manulis, M.: Distributed smooth projective hashing and its application to two-server password authenticated key exchange. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 199\u2013216. Springer, Heidelberg (2014)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/978-3-319-11212-1_17","volume-title":"Computer Security - ESORICS 2014","author":"F Kiefer","year":"2014","unstructured":"Kiefer, F., Manulis, M.: Zero-knowledge password policy checks and verifier-based PAKE. In: Kuty\u0142owski, M., Vaidya, J. (eds.) ICAIS 2014, Part II. LNCS, vol. 8713, pp. 295\u2013312. Springer, Heidelberg (2014)"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/978-3-642-40041-4_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"H Krawczyk","year":"2013","unstructured":"Krawczyk, H., Paterson, K.G., Wee, H.: On the security of the TLS protocol: a systematic analysis. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 429\u2013448. Springer, Heidelberg (2013)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Ma, J., Yang, W., Luo, M., Li, N.: A study of probabilistic password models. In: IEEE S&P, pp. 689\u2013704 (2014)","DOI":"10.1109\/SP.2014.50"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-45708-9_25","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"PD MacKenzie","year":"2002","unstructured":"MacKenzie, P.D., Shrimpton, T., Jakobsson, M.: Threshold password-authenticated key exchange. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 385\u2013400. Springer, Heidelberg (2002)"},{"key":"7_CR26","unstructured":"Cubrilovic, N., Hack, R.: From bad to worse (2014). http:\/\/goo.gl\/AF5ZDM . Accessed 01 Apr 2015"},{"key":"7_CR27","unstructured":"NIST: National Institute of Standards and Technology. Recommended elliptic curves for federal government use (1999). http:\/\/goo.gl\/M1q10h"},{"key":"7_CR28","unstructured":"Openwall: John the Ripper password cracker. http:\/\/www.openwall.com\/john\/ . Accessed 01 Apr 2015"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO 1991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"7_CR30","unstructured":"Pryvalov, I., Kate, A.: Introducing fault tolerance into threshold password-authenticated key exchange. Cryptology ePrint Archive, report 2014\/247 (2014)"},{"key":"7_CR31","unstructured":"Reuters: Trove of Adobe user data found on web after breach: security firm (2014). http:\/\/goo.gl\/IC4lu8 . Accessed 01 Apr 2015"},{"key":"7_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/978-3-540-30574-3_16","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M Szydlo","year":"2005","unstructured":"Szydlo, M., Kaliski, B.: Proofs for two-server password authentication. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 227\u2013244. Springer, Heidelberg (2005)"},{"key":"7_CR33","unstructured":"Reuters, T.: Microsoft India store down after hackers take user data. http:\/\/goo.gl\/T7puD1 . Accessed 01 Apr 2015"},{"issue":"2","key":"7_CR34","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/TDSC.2006.16","volume":"3","author":"Y Yang","year":"2006","unstructured":"Yang, Y., Deng, R.H., Bao, F.: A practical password-based two-server authentication and key exchange system. IEEE Trans. Dependable Sec. Comput. 3(2), 105\u2013114 (2006)","journal-title":"IEEE Trans. Dependable Sec. Comput."}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45871-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T23:15:24Z","timestamp":1568330124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45871-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458700","9783319458717"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45871-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}