{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:06:11Z","timestamp":1725494771262},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540769682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76969-9_2","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T06:32:49Z","timestamp":1195021969000},"page":"15-33","source":"Crossref","is-referenced-by-count":1,"title":["A Generic Construction for Universally-Convertible Undeniable Signatures"],"prefix":"10.1007","author":[{"given":"Xinyi","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","first-page":"382","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short Signatures without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 382\u2013400. Springer, Heidelberg (2004)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11745853_15","volume-title":"Public Key Cryptography - PKC 2006","author":"D. Boneh","year":"2006","unstructured":"Boneh, D., Shen, E., Waters, B.: Strongly Unforgeable Signatures based on Computational Diffie-Hellman. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 229\u2013240. Springer, Heidelberg (2006)"},{"key":"2_CR3","first-page":"99","volume-title":"Designs, Codes and Cryptography","author":"I. Biehl","year":"2004","unstructured":"Biehl, I., Paulus, S., Takagi, T.: Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders. In: Designs, Codes and Cryptography, vol.\u00a031(2), pp. 99\u2013123. Springer, Netherlands (2004)"},{"key":"2_CR4","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.B., Pedersen, T.P.: Convertible Undeniable Signatures. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 189\u2013205. Springer, Heidelberg (1991)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BFb0053427","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"D. Chaum","year":"1995","unstructured":"Chaum, D.: Designated Confirmer Signatures. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 86\u201391. Springer, Heidelberg (1995)"},{"key":"2_CR6","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":"2_CR7","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 (Extended Abstract). In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 458\u2013464. Springer, Heidelberg (1991)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE IT\u00a022, 644\u2013654 (1976)","journal-title":"IEEE IT"},{"key":"2_CR9","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.B. Damg\u00e5rd","year":"1996","unstructured":"Damg\u00e5rd, I.B., Pedersen, T.P.: New Convertible Undeniable Signature Schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 372\u2013386. Springer, Heidelberg (1996)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/3-540-46416-6_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"Y. Desmedt","year":"1991","unstructured":"Desmedt, Y., Yung, M.: Weaknesses of Undeniable Signature Schemes (Extended Abstract). In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 205\u2013220. Springer, Heidelberg (1991)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/3-540-46416-6_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"A. Fujioka","year":"1991","unstructured":"Fujioka, A., Okamotoa, T., Ohta, K.: Interactive Bi-Proof Systems and Undeniable Signature Schemes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 243\u2013256. Springer, Heidelberg (1991)"},{"key":"2_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography, Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, Basic Applications, vol.\u00a0II. Cambridge University Press, Cambridge (2004)"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.: A Digital signature scheme secure against adaptively chosen message attacks. SIAM Journal on Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR14","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.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D., 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)"},{"key":"2_CR15","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.D. Galbraith","year":"2003","unstructured":"Galbraith, S.D., 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":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0052232","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"R. Gennaro","year":"1997","unstructured":"Gennaro, R., Krawczyk, H., Rabin, T.: RSA-Based Undeniable Signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 132\u2013149. Springer, Heidelberg (1997)"},{"issue":"4","key":"2_CR17","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":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-73489-5_21","volume-title":"Pairing 2007","author":"X. Huang","year":"2007","unstructured":"Huang, X., Mu, Y., Susilo, W., Wu, W.: Provably Secure Pairing-based Convertible Undeniable Signature with Short Signature Length. In: Pairing 2007. LNCS, vol.\u00a04575, pp. 367\u2013391. Springer, Heidelberg (2007)"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Jakobsson","year":"1996","unstructured":"Jakobsson, M., Sako, K., Impagliazzo, R.: Designated Verifier Proofs and Their Applications. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 143\u2013154. Springer, Heidelberg (1996)"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-45325-3_36","volume-title":"Cryptography and Coding","author":"L. Jongkook","year":"2001","unstructured":"Jongkook, L., Shiryong, R., Jeungseop, K., Keeyoung, Y.: A New Undeniable Signature Scheme Using Smart Cards. In: Honary, B. (ed.) Cryptography and Coding. LNCS, vol.\u00a02260, pp. 387\u2013394. Springer, Heidelberg (2001)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BFb0053457","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Jakobsson","year":"1995","unstructured":"Jakobsson, M.: Blackmailing Using Undeniable Signatures. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 425\u2013427. Springer, Heidelberg (1995)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11787006_5","volume-title":"Automata, Languages and Programming","author":"J. Furukawa","year":"2006","unstructured":"Furukawa, J., Kurosawa, K., Imai, H.: An Efficient Compiler from \u03a3-Protocol to 2-Move Deniable Zero-Knowledge. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 46\u201357. Springer, Heidelberg (2006)"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/11586821_10","volume-title":"Cryptography and Coding","author":"C. Kudla","year":"2005","unstructured":"Kudla, C., Paterson, K.G.: Non-interactive Designated Verifier Proofs and Undeniable Signatures. In: Smart, N.P. (ed.) Cryptography and Coding. LNCS, vol.\u00a03796, pp. 136\u2013154. Springer, Heidelberg (2005)"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/11496618_15","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"S. Kim","year":"2005","unstructured":"Kim, S., Won, D.: Threshold Entrusted Undeniable Signature. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 195\u2013203. Springer, Heidelberg (2005)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/11426639_11","volume-title":"Advances in XML Information Retrieval","author":"K. Kurosawa","year":"2005","unstructured":"Kurosawa, K., Heng, S-H.: 3-Move Undeniable Signature Scheme. In: Fuhr, N., Lalmas, M., Malik, S., Szl\u00e1vik, Z. (eds.) INEX 2004. LNCS, vol.\u00a03493, pp. 181\u2013197. Springer, Heidelberg (2005)"},{"key":"2_CR26","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":"2_CR27","doi-asserted-by":"crossref","unstructured":"Huang, Q., Wong, D.S., Zhao, Y.: Generic Transformation to Strongly Unforgeable Signatures. ACNS 2007, Available online http:\/\/eprint.iacr.org\/2006\/346","DOI":"10.1007\/978-3-540-72738-5_1"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/11593447_37","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"F. Laguillaumie","year":"2005","unstructured":"Laguillaumie, F., Paillier, P., Vergnaud, D.: Universally Convertible Directed Signatures. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 682\u2013701. Springer, Heidelberg (2005)"},{"key":"2_CR29","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":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-36552-4_4","volume-title":"Information Security and Cryptology - ICISC 2002","author":"Y.-D. Lyuu","year":"2003","unstructured":"Lyuu, Y.-D., Wu, M.-L.: Convertible Group Undeniable Signatures. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 48\u201361. Springer, Heidelberg (2003)"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/978-3-540-30574-3_12","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"F. Laguillaumie","year":"2005","unstructured":"Laguillaumie, F., Vergnaud, D.: Time-Selective Convertible Undeniable Signatures. In: Menezes, A.J. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 154\u2013171. Springer, Heidelberg (2005)"},{"key":"2_CR32","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., Madhavan, C.E.V., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol.\u00a03797, pp. 283\u2013296. Springer, Heidelberg (2005)"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45247-8_11","volume-title":"Information Security and Cryptology - ICISC 2000","author":"T. Miyazaki","year":"2001","unstructured":"Miyazaki, T.: An Improved Scheme of the Gennaro-Krawczyk-Rabin Undeniable Signature System Based on RSA. In: Won, D. (ed.) ICISC 2000. LNCS, vol.\u00a02015, pp. 135\u2013149. Springer, Heidelberg (2001)"},{"key":"2_CR34","first-page":"148","volume-title":"Third ACM Conference on Computer and Communications Security","author":"M. Michels","year":"1996","unstructured":"Michels, M., Petersen, H., Horster, P.: Breaking and Repairing a Convertible Undeniable Signature Scheme. In: Third ACM Conference on Computer and Communications Security, pp. 148\u2013152. ACM Press, New York (1996)"},{"key":"2_CR35","unstructured":"Michels, M., Stadler, M.: Efficient Convertible Undeniable Signature Schemes. In: SAC 1997. The 4th International Workshop on Selected Areas in Cryptography, pp. 231\u2013244 (1997)"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-540-24632-9_6","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. 69\u201385. Springer, Heidelberg (2004)"},{"key":"2_CR37","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)"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11554868_14","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"J. Monnerat","year":"2005","unstructured":"Monnerat, J., Vaudenay, S.: Optimization of the MOVA Undeniable Signature Scheme. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 196\u2013209. Springer, Heidelberg (2005)"},{"key":"2_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11958239_2","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"J. Monnerat","year":"2006","unstructured":"Monnerat, J., Vaudenay, S.: Short 2-Move Undeniable Signatures. In: Nguyen, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 19\u201336. Springer, Heidelberg (2006)"},{"key":"2_CR40","unstructured":"National Institute of Standards and Technology (NIST). Digital Signature Standard (DSS). Federal Information Processing Standards Publication 186-2 (January 2000)"},{"key":"2_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/978-3-540-30580-4_23","volume-title":"Public Key Cryptography - PKC 2005","author":"W. Ogata","year":"2005","unstructured":"Ogata, W., Kurosawa, K., Heng, S.-H.: The Security of the FDH Variant of Chaum\u2019s Undeniable Signature Scheme. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 328\u2013345. Springer, Heidelberg (2005)"},{"key":"2_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-44586-2_8","volume-title":"Public Key Cryptography","author":"T. Okamoto","year":"2001","unstructured":"Okamoto, T., Pointcheval, D.: The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 104\u2013118. Springer, Heidelberg (2001)"},{"key":"2_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45472-1_18","volume-title":"Financial Cryptography","author":"D. Pointcheval","year":"2001","unstructured":"Pointcheval, D.: Self-Scrambling Anonymizers. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, pp. 259\u2013275. Springer, Heidelberg (2001)"},{"issue":"3","key":"2_CR44","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology\u00a013(3), 361\u2013396 (2000)","journal-title":"Journal of Cryptology"},{"key":"2_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/11967668_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"R. Steinfeld","year":"2006","unstructured":"Steinfeld, R., Pieprzyk, J., Wang, H.: How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol.\u00a04377, pp. 357\u2013371. Springer, Heidelberg (2006)"},{"key":"2_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11941378_14","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"I. Teranishi","year":"2006","unstructured":"Teranishi, I., Oyama, T., Ogata, W.: General Conversion for Obtaining Strongly Existentially Unforgeable Signatures. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, pp. 191\u2013205. Springer, Heidelberg (2006)"},{"key":"2_CR47","unstructured":"Wang, G.: An Attack on Not-interactive Designated Verifier Proofs for Undeniable Signatures, Available online http:\/\/eprint.iacr.org\/2003\/243"},{"key":"2_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-45600-7_25","volume-title":"Information and Communications Security","author":"G. Wang","year":"2001","unstructured":"Wang, G., Qing, S., Wang, M., Zhou, Z.: Threshold Undeniable RSA Signature Scheme. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol.\u00a02229, pp. 221\u2013232. Springer, Heidelberg (2001)"},{"key":"2_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/978-3-540-30079-3_30","volume-title":"Trust and Privacy in Digital Business","author":"G. Wang","year":"2004","unstructured":"Wang, G., Zhou, J., Deng, R.H.: On the Security of the Lee-Hwang Group-Oriented Undeniable Signature schemes. In: Katsikas, S.K., Lopez, J., Pernul, G. (eds.) TrustBus 2004. LNCS, vol.\u00a03184, pp. 289\u2013298. Springer, Heidelberg (2004), Avaliable online http:\/\/eprint.iacr.org\/2002\/150"},{"key":"2_CR50","unstructured":"Zhang, F., Safavi-Naini, R., Susilo, W.: Attack on Han et al.\u2019s ID-based Confirmer (Undeniable) Signature at ACM-EC 2003, Avalibale online http:\/\/eprint.iacr.org\/2003\/129"},{"key":"2_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-540-24632-9_20","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"F. Zhang","year":"2004","unstructured":"Zhang, F., Safavi-Naini, R., Susilo, W.: An Efficient Signature Scheme from Bilinear Pairings and Its Application. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 277\u2013290. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76969-9_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:08:35Z","timestamp":1606183715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76969-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540769682"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76969-9_2","relation":{},"subject":[]}}