{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:40Z","timestamp":1772283640186,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540306849","type":"print"},{"value":"9783540322672","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11593447_36","type":"book-chapter","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T01:37:16Z","timestamp":1132018636000},"page":"662-681","source":"Crossref","is-referenced-by-count":22,"title":["Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs"],"prefix":"10.1007","author":[{"given":"Craig","family":"Gentry","sequence":"first","affiliation":[]},{"given":"David","family":"Molnar","sequence":"additional","affiliation":[]},{"given":"Zulfikar","family":"Ramzan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"36_CR1","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\u2013610 (2000)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"36_CR2","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":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 390\u2013420. Springer, Heidelberg (1993)"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-45539-6_17","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"J. Camenisch","year":"2000","unstructured":"Camenisch, J., Michels, M.: Confirmer Signature Schemes Secure Against Adaptive Adversaries. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 243. Springer, Heidelberg (2000)"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J. Camenisch","year":"2004","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature Schemes and Anonymous Credentials from Bilinear Maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 56\u201372. Springer, Heidelberg (2004)"},{"key":"#cr-split#-36_CR6.1","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Shoup, V.: Practical Verifable Encryption and Decryption of Discrete Logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.??2729, pp. 126???144. Springer, Heidelberg (2003);","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"#cr-split#-36_CR6.2","unstructured":"Full version available from www.shoup.net"},{"key":"36_CR7","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":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"D. Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet Databases with Observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 89\u2013105. Springer, Heidelberg (1993)"},{"key":"36_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":"36_CR10","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Signature Schemes Based on the Strong RSA Assumption. In: ACM CCS 1999 (1999)","DOI":"10.1145\/319709.319716"},{"key":"36_CR11","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. Damgard","year":"2000","unstructured":"Damgard, I.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 418. Springer, Heidelberg (2000)"},{"key":"36_CR12","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 Message Attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, p. 13. Springer, Heidelberg (1998)"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Damgard, I., Shoup, V.: 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":"36_CR14","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, p. 123. Springer, Heidelberg (1999)"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Kahan, A.: How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. Journal of Cryptology\u00a09(3), 167\u2013189","DOI":"10.1007\/s001459900010"},{"issue":"2","key":"36_CR16","doi-asserted-by":"crossref","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 Attacks. SICOMP\u00a017(2), 281\u2013308 (1988)","journal-title":"SICOMP"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"36_CR18","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":"36_CR19","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., Damgard, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC 1990 (1990)","DOI":"10.1145\/100216.100273"},{"key":"36_CR21","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":"36_CR22","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 residue classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 223. Springer, Heidelberg (1999)"},{"key":"36_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T.P. Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted third party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)"},{"key":"36_CR24","series-title":"Lecture Notes in Computer Science","first-page":"498","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.P. Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient Identification and Signatures for Smart Cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 498\u2013506. Springer, Heidelberg (1990)"},{"key":"36_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-44647-8_21","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. Shamir","year":"2001","unstructured":"Shamir, A., Tauman, Y.: Improved Online-Offline Signature Schemes. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, p. 355. Springer, Heidelberg (2001)"},{"key":"36_CR26","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":"36_CR27","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. Garay","year":"2003","unstructured":"Garay, J., MacKenzie, P., Yang, K.: Strengthening Zero-Knowledge Protocols Using Signatures. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 177\u2013194. Springer, Heidelberg (2003)"},{"key":"36_CR28","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)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11593447_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:51:50Z","timestamp":1619491910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593447_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540306849","9783540322672"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11593447_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}