{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:00:14Z","timestamp":1777964414838,"version":"3.51.4"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319446172","type":"print"},{"value":"9783319446189","type":"electronic"}],"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-44618-9_19","type":"book-chapter","created":{"date-parts":[[2016,8,10]],"date-time":"2016-08-10T01:10:01Z","timestamp":1470791401000},"page":"353-371","source":"Crossref","is-referenced-by-count":23,"title":["Virtual Smart Cards: How to Sign with a Password and a Server"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anja","family":"Lehmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Neven","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Samelin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,11]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J Algesheimer","year":"2002","unstructured":"Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 417\u2013432. Springer, Heidelberg (2002)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/11761679_35","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"JF 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. 4004, pp. 593\u2013611. Springer, Heidelberg (2006)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/3-540-47555-9_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"D Beaver","year":"1993","unstructured":"Beaver, D., Haber, S.: Cryptographic protocols provably secure against dynamic adversaries. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 307\u2013323. Springer, Heidelberg (1993)"},{"issue":"3","key":"19_CR4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s00145-002-0120-1","volume":"16","author":"M Bellare","year":"2003","unstructured":"Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The one-more-rsa-inversion problems and the security of Chaum\u2019s blind signature scheme. J. Cryptol. 16(3), 185\u2013215 (2003)","journal-title":"J. Cryptol."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: CCS 1993, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"19_CR6","unstructured":"Bellare, M., Sandhu, R.S.: The security of practical two-party RSA signature schemes. ePrint Report 2001\/060 (2001)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","first-page":"31","volume-title":"Public Key Cryptography - PKC 2003","author":"A Boldyreva","year":"2002","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-diffie-hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2002)"},{"key":"19_CR8","unstructured":"Boyd, C.: Digital multisignatures. In: Cryptography and Coding 1989, pp. 241\u2013246 (1989)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Enderlein, R.R., Neven, G.: Two-server password-authenticated secret sharing UC-secure against transient corruptions. ePrint Report 2015\/006 (2015)","DOI":"10.1007\/978-3-662-46447-2_13"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-40203-6_2","volume-title":"Computer Security \u2013 ESORICS 2013","author":"J Camenisch","year":"2013","unstructured":"Camenisch, J., Enderlein, R.R., Shoup, V.: Practical and employable protocols for UC-secure circuit evaluation over $$\\mathbb{Z}$$ $$_\\text{ n }$$ . In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 19\u201337. Springer, Heidelberg (2013)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lehmann, A., Neven, G., Samelin, K.: Virtual smart cards: how to sign with a password and a server. ePrint Report 2015\/1101 (2015)","DOI":"10.1007\/978-3-319-44618-9_19"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. ePrint Report 2000\/067 (2000)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: CSFW 2004, pp. 219\u2013233 (2004)","DOI":"10.1109\/CSFW.2004.1310743"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 3494, pp. 404\u2013421. Springer, Heidelberg (2005)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J-S Coron","year":"2000","unstructured":"Coron, J.-S.: On the exact security of full domain hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 229\u2013235. Springer, Heidelberg (2000)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-642-00468-1_16","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"I Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Mikkelsen, G.L.: On the theory and practice of personal digital signatures. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 277\u2013296. Springer, Heidelberg (2009)"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology - CRYPTO 1989","author":"YG Desmedt","year":"1990","unstructured":"Desmedt, Y.G., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307\u2013315. Springer, Heidelberg (1990)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/978-3-642-13190-5_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S Fehr","year":"2010","unstructured":"Fehr, S., Hofheinz, D., Kiltz, E., Wee, H.: Encryption schemes secure against chosen-ciphertext selective opening attacks. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 381\u2013402. Springer, Heidelberg (2010)"},{"key":"19_CR19","unstructured":"Ganesan, R.: Yaksha: augmenting kerberos with PKC. In: NDSS 1995, pp. 132\u2013143 (1995)"},{"issue":"2","key":"19_CR20","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s001459910011","volume":"13","author":"R Gennaro","year":"2000","unstructured":"Gennaro, R., Rabin, T., Jarecki, S., Krawczyk, H.: Robust and efficient sharing of RSA functions. J. Cryptol. 13(2), 273\u2013300 (2000)","journal-title":"J. Cryptol."},{"key":"19_CR21","unstructured":"Gj\u00f8steen, K.: Partially blind password-based signatures using elliptic curves. ePrint Report 2013\/472 (2013)"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-642-29804-2_2","volume-title":"Public Key Infrastructures, Services and Applications","author":"K Gj\u00f8steen","year":"2012","unstructured":"Gj\u00f8steen, K., Thuen, \u00d8.: Password-based signatures. In: Petkova-Nikova, S., Pashalidis, A., Pernul, G. (eds.) EuroPKI 2011. LNCS, vol. 7163, pp. 17\u201333. Springer, Heidelberg (2012)"},{"key":"19_CR23","unstructured":"Gosney, J.M.: Password cracking HPC. In: Passwords $$\\hat{~}$$ 12 Conference (2012)"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-642-27954-6_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"C Hazay","year":"2012","unstructured":"Hazay, C., Mikkelsen, G.L., Rabin, T., Toft, T.: Efficient RSA key generation and threshold paillier in the two-party setting. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 313\u2013331. Springer, Heidelberg (2012)"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Hazay, C., Patra, A., Warinschi, B.: Selective opening security for receivers. ePrint Report 2015\/860 (2015)","DOI":"10.1007\/978-3-662-48797-6_19"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"He, Y.-Z., Wu, C.-K., Feng, D.-G.: Server-aided digital signature protocol based on password. In: CCST 2005, pp. 89\u201392 (2005)","DOI":"10.1109\/CCST.2005.1594836"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/978-3-540-24638-1_4","volume-title":"Theory of Cryptography","author":"D Hofheinz","year":"2004","unstructured":"Hofheinz, D., M\u00fcller-Quade, J.: Universally composable commitments using random oracles. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 58\u201376. Springer, Heidelberg (2004)"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/978-3-540-78524-8_19","volume-title":"Theory of Cryptography","author":"A Kiayias","year":"2008","unstructured":"Kiayias, A., Zhou, H.-S.: Equivocal blind signatures and adaptive UC-security. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 340\u2013355. Springer, Heidelberg (2008)"},{"key":"19_CR29","unstructured":"K\u00f6mmerling, O., Kuhn, M.G.: Design principles for tamper-resistant smartcard processors. In: WOST 1999 (1999)"},{"issue":"1","key":"19_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10207-003-0022-8","volume":"2","author":"PD MacKenzie","year":"2003","unstructured":"MacKenzie, P.D., Reiter, M.K.: Networked cryptographic devices resilient to capture. Int. J. Inf. Sec. 2(1), 1\u201320 (2003)","journal-title":"Int. J. Inf. Sec."},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Mannan, M., van Oorschot, P.C.: Using a personal device to strengthen password authentication from an untrusted computer. In: FC 2007, pp. 88\u2013103 (2007)","DOI":"10.1007\/978-3-540-77366-5_11"},{"key":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"JB Nielsen","year":"2002","unstructured":"Nielsen, J.B.: Separating random oracle proofs from complexity theoretic proofs: the non-committing encryption case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 111\u2013126. Springer, Heidelberg (2002)"},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"T Rabin","year":"1998","unstructured":"Rabin, T.: A simplified approach to threshold and proactive RSA. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 89\u2013104. Springer, Heidelberg (1998)"},{"key":"19_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/978-3-319-10879-7_26","volume-title":"Security and Cryptography for Networks","author":"M Venkitasubramaniam","year":"2014","unstructured":"Venkitasubramaniam, M.: On adaptively secure protocols. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 455\u2013475. Springer, Heidelberg (2014)"},{"key":"19_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-36563-X_25","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"S Xu","year":"2003","unstructured":"Xu, S., Sandhu, R.: Two efficient and provably secure schemes for server-assisted threshold signatures. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 355\u2013372. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44618-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T16:38:59Z","timestamp":1749055139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44618-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319446172","9783319446189"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44618-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}