{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T15:49:24Z","timestamp":1783007364634,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662443804","type":"print"},{"value":"9783662443811","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-44381-1_15","type":"book-chapter","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:27:09Z","timestamp":1405297629000},"page":"256-275","source":"Crossref","is-referenced-by-count":34,"title":["Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anja","family":"Lehmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gregory","family":"Neven","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-28628-8_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M. Abe","year":"2004","unstructured":"Abe, M., Fehr, S.: Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 317\u2013334. Springer, Heidelberg (2004)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/11761679_35","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J.F. Almansa","year":"2006","unstructured":"Almansa, J.F., Damg\u00e5rd, I.B., Nielsen, J.B.: Simplified Threshold RSA with Adaptive and Proactive Security. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 593\u2013611. Springer, Heidelberg (2006)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bagherzandi, A., Jarecki, S., Saxena, N., Lu, Y.: Password-protected secret sharing. In: ACM CCS 2011 (2011)","DOI":"10.1145\/2046707.2046758"},{"key":"15_CR4","unstructured":"Barak, B., Lindell, Y., Rabin, T.: Protocol initialization for the framework of universal composability. Cryptology ePrint Archive, Report 2004\/006 (2004)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM CCS 1993(1993)","DOI":"10.1145\/168588.168596"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: STOC 1993 (1993)","DOI":"10.1145\/167088.167109"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Boyen, X.: Hidden credential retrieval from a reusable password. In: ASIACCS 2009 (2009)","DOI":"10.1145\/1533057.1533089"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Burr, W.E., Dodson, D.F., Newton, E.M., Perlner, R.A., Polk, W.T., Gupta, S., Nabbus, E.A.: Electronic authentication guideline. NIST Special Publication 800-63-1 (2011)","DOI":"10.6028\/NIST.SP.800-63-1"},{"key":"15_CR9","unstructured":"Brainard, J., Juels, A., Kaliski Jr., B.S., Szydlo, M.: A new two-server approach for authentication with short secrets. In: USENIX 2003 (2003)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-642-01001-9_25","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Kiayias, A., Yung, M.: On the portability of generalized Schnorr proofs. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 425\u2013442. Springer, Heidelberg (2009)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-25385-0_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"J. Camenisch","year":"2011","unstructured":"Camenisch, J., Krenn, S., Shoup, V.: A framework for practical universally composable zero-knowledge protocols. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 449\u2013467. Springer, Heidelberg (2011)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lehmann, A., Lysyanskaya, A., Neven, G.: Memento: How to reconstruct your secrets from a single password in a hostile environment. Cryptology ePrint Archive, Report 2014\/429 (2014)","DOI":"10.1007\/978-3-662-44381-1_15"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A., Neven, G.: Practical yet universally composable two-server password-authenticated secret sharing. In: ACM CCS 2012 (2012)","DOI":"10.1145\/2382196.2382252"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Camenisch","year":"2003","unstructured":"Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 126\u2013144. Springer, Heidelberg (2003)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J. Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.A.: Efficient group signature schemes for large groups (extended abstract). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 410\u2013424. Springer, Heidelberg (1997)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"15_CR17","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: 17th Computer Security Foundations Workshop. IEEE Computer Society (2004)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/11426639_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"R. Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Katz, J., Lindell, Y., MacKenzie, P.: Universally composable password-based key exchange. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 404\u2013421. Springer, Heidelberg (2005)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-45146-4_16","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R. Canetti","year":"2003","unstructured":"Canetti, R., Rabin, T.: Universal composition with joint state. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 265\u2013281. Springer, Heidelberg (2003)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013300. Springer, Heidelberg (2001)"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Chor, B., Moscovici, L.: Solvability in asynchronous environments. In: FOCS 1989 (1989)","DOI":"10.1109\/SFCS.1989.63513"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40203-6_1","volume-title":"Computer Security \u2013 ESORICS 2013","author":"I. Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority\u2014or: Breaking the SPDZ limits. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol.\u00a08134, pp. 1\u201318. Springer, Heidelberg (2013)"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-45146-4_15","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"I.B. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I.B., Nielsen, J.B.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 247\u2013264. Springer, Heidelberg (2003)"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I. Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 643\u2013662. Springer, Heidelberg (2012)"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) Advances in Cryptology - CRYPTO 1989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, Heidelberg (1990)","DOI":"10.1007\/0-387-34805-0_28"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/3-540-39200-9_32","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"M. Raimondo Di","year":"2003","unstructured":"Di Raimondo, M., Gennaro, R.: Provably secure threshold password-authenticated key exchange. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 507\u2013523. Springer, Heidelberg (2003)"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) Advances in Cryptology - CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)","DOI":"10.1007\/3-540-39568-7_2"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) Advances in Cryptology - CRYPT0 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"15_CR29","unstructured":"Ford, W., Kaliski Jr., B.S.: Server-assisted generation of a strong secret from a password. WETICE 2000. In: IEEE Computer Society 2000 (2000)"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"E. Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 537\u2013554. Springer, Heidelberg (1999)"},{"key":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-39200-9_11","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"J.A. Garay","year":"2003","unstructured":"Garay, J.A., MacKenzie, P.D., Yang, K.: Strengthening zero-knowledge protocols using signatures. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 177\u2013194. Springer, Heidelberg (2003)"},{"key":"15_CR32","unstructured":"Goodin, D.: Why passwords have never been weaker\u2014and crackers have never been stronger. Ars Technica (2012)"},{"key":"15_CR33","unstructured":"Gosney, J.: Password Cracking HPC. In: Passwords 2012 Conference (2012)"},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"Herley, C., van Oorschot, P.C.: A research agenda acknowledging the persistence of passwords. IEEE Security & Privacy (2012)","DOI":"10.1109\/MSP.2011.150"},{"key":"15_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-03549-4_14","volume-title":"Financial Cryptography and Data Security","author":"C. Herley","year":"2009","unstructured":"Herley, C., van Oorschot, P.C., Patrick, A.S.: Passwords: If we\u2019re so smart, why are we still using them? In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 230\u2013237. Springer, Heidelberg (2009)"},{"key":"15_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-45353-9_26","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"D.P. Jablon","year":"2001","unstructured":"Jablon, D.P.: Password authentication using multiple servers. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 344\u2013360. Springer, Heidelberg (2001)"},{"key":"15_CR37","doi-asserted-by":"crossref","unstructured":"Kaliski, B.: PKCS #5: Password-Based Cryptography Specification. IETF RFC\u00a02898 (2000)","DOI":"10.17487\/rfc2898"},{"key":"15_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Taban, G., Gligor, V.: Two-server password-only authenticated key exchange. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"15_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-36594-2_27","volume-title":"Theory of Cryptography","author":"J. Katz","year":"2013","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally Composable Synchronous Computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 477\u2013498. Springer, Heidelberg (2013)"},{"key":"15_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-45708-9_25","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"P. MacKenzie","year":"2002","unstructured":"MacKenzie, P., Shrimpton, T., Jakobsson, M.: Threshold password-authenticated key exchange. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 385\u2013400. Springer, Heidelberg (2002)"},{"key":"15_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-24676-3_23","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"P. MacKenzie","year":"2004","unstructured":"MacKenzie, P., Yang, K.: On simulation-sound trapdoor commitments. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 382\u2013400. Springer, Heidelberg (2004)"},{"key":"15_CR42","doi-asserted-by":"crossref","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U.M. (ed.) Advances in Cryptology - EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 387\u2013398. Springer, Heidelberg (1996)","DOI":"10.1007\/3-540-68339-9_33"},{"key":"15_CR43","unstructured":"Provos, N., Mazi\u00e8res, D.: A Future-Adaptable Password Scheme. In: USENIX 1999 (1999)"},{"key":"15_CR44","unstructured":"RSA, The Security Division of EMC. New RSA innovation helps thwart \u201csmash-and-grab\u201d credential theft. Press release (2012)"},{"key":"15_CR45","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: FOCS 1999 (1999)"},{"issue":"3","key":"15_CR46","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.-P. Schnorr","year":"1991","unstructured":"Schnorr, C.-P.: Efficient signature generation by smart cards. J.\u00a0Cryptol.\u00a04(3), 161\u2013174 (1991)","journal-title":"J.\u00a0Cryptol."},{"key":"15_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a03376, pp. 227\u2013244. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44381-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T05:11:08Z","timestamp":1558933868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44381-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662443804","9783662443811"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44381-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}