{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:24:12Z","timestamp":1778153052548,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705826","type":"print"},{"value":"9783540705833","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_43","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"524-535","source":"Crossref","is-referenced-by-count":15,"title":["Universally Composable Undeniable Signature"],"prefix":"10.1007","author":[{"given":"Kaoru","family":"Kurosawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Furukawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-38424-3_14","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"J. Boyar","year":"1991","unstructured":"Boyar, J., Chaum, D., Damg\u00e5rd, I., Pedersen, T.: Convertible undeniable signatures. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 189\u2013208. Springer, Heidelberg (1991)"},{"issue":"2","key":"43_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/B:DESI.0000012439.20075.16","volume":"31","author":"I. Biehl","year":"2004","unstructured":"Biehl, I., Paulus, S., Takagi, T.: Efficient undeniable signature schemes based on ideal arithmetic in quadratic orders. Designs, Codes and Cryptography\u00a031(2), 99\u2013123 (2004)","journal-title":"Designs, Codes and Cryptography"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols, Revision 1 of ECCC Report TR01-016 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"43_CR4","unstructured":"Canetti, R.: Universally Composable Signatures, Certification and Authentication, IACR ePrint 2003\/239"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols, IACR ePrint 2000\/067 (2005)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally Composable Commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC 2002, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"43_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/3-540-46877-3_41","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"D. Chaum","year":"1991","unstructured":"Chaum, D.: Zero-knowledge undeniable signatures. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 458\u2013464. Springer, Heidelberg (1991)"},{"key":"43_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/0-387-34805-0_20","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., van Antwerpen, H.: Undeniable signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 212\u2013216. Springer, Heidelberg (1990)"},{"key":"43_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/3-540-68339-9_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"I. Damg\u00e5rd","year":"1996","unstructured":"Damg\u00e5rd, I., Pedersen, T.: New convertible undeniable signature schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 372\u2013386. Springer, Heidelberg (1996)"},{"key":"43_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-36563-X_6","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"S. Galbraith","year":"2003","unstructured":"Galbraith, S., Mao, W.: Invisibility and anonymity of undeniable and confirmer signatures. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 80\u201397. Springer, Heidelberg (2003)"},{"key":"43_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45760-7_14","volume-title":"Topics in Cryptology - CT-RSA 2002","author":"S. Galbraith","year":"2002","unstructured":"Galbraith, S., Mao, W., Paterson, K.G.: RSA-based undeniable signatures for general moduli. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.\u00a02271, pp. 200\u2013217. Springer, Heidelberg (2002)"},{"issue":"4","key":"43_CR13","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s001450010001","volume":"13","author":"R. Gennaro","year":"2000","unstructured":"Gennaro, R., Rabin, T., Krawczyk, H.: RSA-based undeniable signatures. Journal of Cryptology\u00a013(4), 397\u2013416 (2000)","journal-title":"Journal of Cryptology"},{"key":"43_CR14","unstructured":"Kurosawa, K., Furukawa, J.: Universally Composable Undeniable Signature, Cryptology ePrint Archive, Report 2008\/094 (2008), http:\/\/eprint.iacr.org\/"},{"key":"43_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/11832072_3","volume-title":"Security and Cryptography for Networks","author":"K. Kurosawa","year":"2006","unstructured":"Kurosawa, K., Heng, S.: Relations among security notions for undeniable signature schemes. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 34\u201348. Springer, Heidelberg (2006)"},{"key":"43_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/11935230_28","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"K. Kurosawa","year":"2006","unstructured":"Kurosawa, K., Takagi, T.: New Approach for Selectively Convertible Undeniable Signature Schemes. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 428\u2013443. Springer, Heidelberg (2006)"},{"key":"43_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-540-24660-2_9","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"B. Libert","year":"2004","unstructured":"Libert, B., Quisquater, J.-J.: Identity based undeniable signatures. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 112\u2013125. Springer, Heidelberg (2004)"},{"key":"43_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11596219_23","volume-title":"Progress in Cryptology - INDOCRYPT 2005","author":"F. Laguillaumie","year":"2005","unstructured":"Laguillaumie, F., Vergnaud, D.: Short undeniable signatures without random oracles: The Missing Link. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol.\u00a03797, pp. 283\u2013296. Springer, Heidelberg (2005)"},{"key":"43_CR19","first-page":"231","volume-title":"SAC 1997","author":"M. Michels","year":"1997","unstructured":"Michels, M., Stadler, M.: Efficient convertible undeniable signature schemes. In: SAC 1997, pp. 231\u2013244. Springer, Heidelberg (1997)"},{"key":"43_CR20","series-title":"Lecture Notes in Computer Science","first-page":"361","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"J. Monnerat","year":"2004","unstructured":"Monnerat, J., Vaudenay, S.: Undeniable signatures based on characters: how to sign with one bit. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 361\u2013396. Springer, Heidelberg (2004)"},{"key":"43_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/978-3-540-30539-2_25","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"J. Monnerat","year":"2004","unstructured":"Monnerat, J., Vaudenay, S.: Generic homomorphic undeniable signatures. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 354\u2013371. Springer, Heidelberg (2004)"},{"issue":"5","key":"43_CR22","doi-asserted-by":"publisher","first-page":"2006","DOI":"10.1109\/TIT.2006.872853","volume":"52","author":"W. Ogata","year":"2006","unstructured":"Ogata, W., Kurosawa, K., Heng, S.: The security of the FDH variant of Chaum\u2019s undeniable signature scheme. IEEE Transactions on Information Theory\u00a052(5), 2006\u20132017 (2006)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:01Z","timestamp":1605762481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}