{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:28:08Z","timestamp":1725514088721},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540716761"},{"type":"electronic","value":"9783540716778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71677-8_4","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T14:05:58Z","timestamp":1182348358000},"page":"43-60","source":"Crossref","is-referenced-by-count":8,"title":["On the Generic and Efficient Constructions of Secure Designated Confirmer Signatures"],"prefix":"10.1007","author":[{"given":"Guilin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joonsang","family":"Baek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duncan S.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Bao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BFb0054156","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"N. Asokan","year":"1998","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic Fair Exchange of Digital Signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 591\u2013606. Springer, Heidelberg (1998)"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/49.839935","volume":"18","author":"N. Asokan","year":"2000","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic Fair Exchange of Digital Signatures. IEEE Journal on Selected Areas in Communications\u00a018(4), 591\u2013606 (2000)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1145\/319709.319728","volume-title":"Proc. of ACM Conference on Computer and Communications Security (CCS \u201999)","author":"G. Ateniese","year":"1999","unstructured":"Ateniese, G.: Efficient Verifiable Encryption (and Fair Exchange) of Digital Signature. In: Proc. of ACM Conference on Computer and Communications Security (CCS \u201999), pp. 138\u2013146. ACM Press, New York (1999)"},{"key":"4_CR4","first-page":"77","volume-title":"Proc. of IEEE Symposium on Security and Privacy","author":"F. Bao","year":"1998","unstructured":"Bao, F., Deng, R.H., Mao, W.: Efficient and Practical Fair Exchange Protocols with Off-line TTP. In: Proc. of IEEE Symposium on Security and Privacy, pp. 77\u201385. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"Proc. of the 1st ACM Conf. on Computer and Communications Security (CCS \u201993)","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols. In: Proc. of the 1st ACM Conf. on Computer and Communications Security (CCS \u201993), pp. 62\u201373. ACM Press, New York (1993)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient Proofs that a Committed Number Lies in an Interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"4_CR7","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., Damgard, I., Pedersen, T.: Convertible Undeniable Signatures. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 189\u2013208. Springer, Heidelberg (1991)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-49649-1_22","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"C. Boyd","year":"1998","unstructured":"Boyd, C., Foo, E.: Off-line Fair Payment Protocols Using Convertible Signatures. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 271\u2013285. Springer, Heidelberg (1998)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J. Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: 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":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/3-540-45539-6_17","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"J. Camenisch","year":"2000","unstructured":"Camenisch, J., Michels, M.: Confirmer Signature Schemes Secure against Adaptive Adversaries. In: Deransart, P., Ma\u0142uszy\u0144ski, J. (eds.) Analysis and Visualization Tools for Constraint Programming. LNCS, vol.\u00a01870, pp. 243\u2013258. Springer, Heidelberg (2000)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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), \n                    \n                      http:\/\/shoup.net\/papers\/"},{"key":"4_CR12","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":"4_CR13","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":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-49649-1_23","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"L. Chen","year":"1998","unstructured":"Chen, L.: Efficient Fair Exchange with Verifiable Confirmation of Signatures. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 286\u2013299. Springer, Heidelberg (1998)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of Partial Knowledge and Simplied Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/319709.319716","volume-title":"Proc. of the 6th ACM Conf. on Computer and Communications Security (CCS \u201999)","author":"R. Cramer","year":"1999","unstructured":"Cramer, R., Shoup, V.: Signature Schemes based on the Strong RSA Assumption. In: Proc. of the 6th ACM Conf. on Computer and Communications Security (CCS \u201999), pp. 46\u201351. ACM Press, New York (1999)"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/978-3-540-46588-1_24","volume-title":"Public Key Cryptography","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., MacKenzie, P.: Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 354\u2013373. Springer, Heidelberg (2000)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"I. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.: Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 418\u2013430. Springer, Heidelberg (2000)"},{"issue":"2","key":"4_CR20","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, D., Naor, N.: Non-meallleable cryptography. SIAM Journal on Computing\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR21","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":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/3-540-48405-1_29","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J. Garay","year":"1999","unstructured":"Garay, J., Jakobsson, M., MacKenzie, P.: Abuse-free Optimistic Contract Signing. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 449\u2013466. Springer, Heidelberg (1999)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Gennaro","year":"1999","unstructured":"Gennaro, R., Halevi, S., Rabin, T.: Secure Hash-and-Sign Signatures without the Random Oracle. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 123\u2013139. Springer, Heidelberg (1999)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-540-28628-8_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"R. Gennaro","year":"2004","unstructured":"Gennaro, R.: Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 220\u2013236. Springer, Heidelberg (2004)"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/11593447_36","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"C. Gentry","year":"2005","unstructured":"Gentry, C., Molnar, D., Ramzan, Z.: Efficient Designated Confirmer Signatures without Random Oracles or General Zero-knowledge Proofs. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 662\u2013681. Springer, Heidelberg (2005)"},{"issue":"3","key":"4_CR26","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to Construct Constant-Round Zeroknowledge Proof Systems for NP. Journal of Cryptology\u00a09(3), 167\u2013189 (1996)","journal-title":"Journal of Cryptology"},{"issue":"2","key":"4_CR27","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 Adaptive Chosen-message Attack. SIAM Journal of Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM Journal of Computing"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-540-24638-1_5","volume-title":"Theory of Cryptography","author":"S. Goldwasser","year":"2004","unstructured":"Goldwasser, S., Waisbard, E.: Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 77\u2013100. Springer, Heidelberg (2004)"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/11426639_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"K. Kurosawa","year":"2005","unstructured":"Kurosawa, K., Heng, S.-H.: 3-Move Undeniable Signature Scheme. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 181\u2013197. Springer, Heidelberg (2005)"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/BFb0054142","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Michels","year":"1998","unstructured":"Michels, M., Stadler, M.: Generic Constructions for Secure and Efficient Confirmer Signature Schemes. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 406\u2013421. Springer, Heidelberg (1998)"},{"key":"4_CR31","unstructured":"Michels, M., Stadler, M.: Efficient Convertible Undeniable Signature Schemes. In: Proc. of 4th Annual Workshop on Selected Areas in Cryptography (SAC \u201997), pp. 231\u2013244 (1997)"},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/11556992_12","volume-title":"Information Security","author":"J. Monnerat","year":"2005","unstructured":"Monnerat, J., Vaudenay, S.: Chaum\u2019s Designated Confirmer Signature Revisited. In: Zhou, J., Lopez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol.\u00a03650, pp. 164\u2013178. Springer, Heidelberg (2005)"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-48658-5_8","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"T. Okamoto","year":"1994","unstructured":"Okamoto, T.: Designated Confirmer Signatures and Public Key Encryption Are Equivalent. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 61\u201374. Springer, Heidelberg (1994)"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public Key Cryptosystems based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"4_CR35","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 \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and Information-theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"issue":"3","key":"4_CR36","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. Journal of Cryptology\u00a04(3), 161\u2013174 (1991)","journal-title":"Journal of Cryptology"},{"key":"4_CR37","unstructured":"Wang, G., Baek, J., Wong, D.S., Bao, F.: On the Generic and Efficient Constructions of Secure Designated Confirmer Signatures. Full version of this paper is available from the authors or Cryptology ePrint Archive"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71677-8_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:24:43Z","timestamp":1605745483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71677-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540716761","9783540716778"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71677-8_4","relation":{},"subject":[]}}