{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:35Z","timestamp":1772283635898,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540675174","type":"print"},{"value":"9783540455394","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45539-6_17","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:26:08Z","timestamp":1184603168000},"page":"243-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":50,"title":["Confirmer Signature Schemes Secure against Adaptive Adversaries"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Michels","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,5,12]]},"reference":[{"key":"17_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BFb0054156","volume-title":"EUROCRYPT\u2019 98","author":"N. Asokan","year":"1998","unstructured":"N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. In EUROCRYPT\u2019 98, vol. 1403 of LNCS, pp. 591\u2013606, 1998."},{"key":"17_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/BFb0054130","volume-title":"EUROCRYPT\u2019 98","author":"M. Bellare","year":"1998","unstructured":"M. Bellare, J. A. Garay, and T. Rabin. Fast batch verification for modular exponentiation and digital signatures. In EUROCRYPT\u2019 98, vol. 1403 of LNCS, pp. 236\u2013250. Springer Verlag, 1998."},{"key":"17_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/0-387-34799-2_15","volume-title":"CRYPTO\u2019 88","author":"M. Bellare","year":"1990","unstructured":"M. Bellare and S. Micali. How to sign given any trapdoor function. In CRYPTO\u2019 88, vol. 403 of LNCS, pp. 200\u2013215. Springer-Verlag, 1990."},{"key":"17_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"EUROCRYPT\u2019 96","author":"M. Bellare","year":"1996","unstructured":"M. Bellare and P. Rogaway. The exact security of digital signature \u2014 how to sign with RSA and Rabin. In EUROCRYPT\u2019 96, vol. 1070 of LNCS, pp. 399\u2013416. Springer Verlag, 1996."},{"key":"17_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"EU-ROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"F. Boudot. Efficient proofs that a committed number lies in an interval. In EU-ROCRYPT 2000, vol. 1807 of LNCS, pp. 431\u2013444. Springer Verlag, 2000 (this volume)."},{"key":"17_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-48405-1_27","volume-title":"CRYPTO\u2019 99","author":"J. Camenisch","year":"1999","unstructured":"J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In CRYPTO\u2019 99, vol. 1296 of LNCS, pp. 413\u2013430, 1999."},{"key":"17_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"CRYPTO\u2019 97","author":"J. Camenisch","year":"1997","unstructured":"J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In CRYPTO\u2019 97, vol. 1296 of LNCS, pp. 410\u2013424. Springer Verlag, 1997."},{"key":"17_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BFb0055723","volume-title":"CRYPTO\u2019 98","author":"D. Catalano","year":"1998","unstructured":"D. Catalano and R. Gennaro. New efficient and secure protocols for verifiable signature sharing and other applications. In CRYPTO\u2019 98, vol. 1642 of LNCS, pp. 105\u2013120. Springer Verlag, 1998."},{"key":"17_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BFb0053427","volume-title":"EUROCRYPT\u2019 94","author":"D. Chaum","year":"1994","unstructured":"D. Chaum. Designated confirmer signatures. In EUROCRYPT\u2019 94, vol. 950 of LNCS, pp. 86\u201391. Springer Verlag, 1994."},{"key":"17_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/0-387-34805-0_20","volume-title":"CRYPTO\u2019 89","author":"D. Chaum","year":"1990","unstructured":"D. Chaum and H. van Antwerpen. Undeniable signatures. In CRYPTO\u2019 89, vol. 435 of LNCS, pp. 212\u2013216. Springer-Verlag, 1990."},{"key":"17_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/3-540-49649-1_23","volume-title":"ASIACRYPT\u2019 98","author":"L. Chen","year":"1998","unstructured":"L. Chen. Efficient fair exchange with verifiable confirmation of signatures. In ASIACRYPT\u2019 98, vol. 1514 of LNCS, pp. 286\u2013299. Springer Verlag, 1998."},{"key":"17_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"CRYPTO\u2019 94","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u00e5rd, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO\u2019 94, vol. 839 of LNCS, pp. 174\u2013187. Springer Verlag, 1994."},{"key":"17_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"CRYPTO\u2019 98","author":"R. Cramer","year":"1998","unstructured":"R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In CRYPTO\u2019 98, vol. 1642 of LNCS, pp. 13\u201325. Springer Verlag, 1998."},{"key":"17_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/3-540-48405-1_31","volume-title":"CRYPTO\u2019 99","author":"G. Crescenzo Di","year":"1999","unstructured":"G. Di Crescenzo and R. Ostrovsky. On concurrent zero-knowledge with preprocessing. In CRYPTO\u2019 99, vol. 1296 of LNCS, pp. 485\u2013502, 1999."},{"key":"17_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"EUROCRYPT 2000","author":"I. Damg\u00e5rd","year":"2000","unstructured":"I. Damg\u00e5rd. Efficient concurrent zero-knowledge in the auxiliary string model. In EUROCRYPT 2000, vol. 1807 of LNCS, pp. 418\u2013430. Springer Verlag, 2000 (this volume)."},{"key":"17_CR16","unstructured":"D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In Proc. 35th IEEE Symposium on Foundations of Computer Science (FOCS), 1994."},{"key":"17_CR17","series-title":"Lect Notes Comput Sci","first-page":"105","volume-title":"CRYPTO\u2019 98","author":"C. Dwork","year":"1998","unstructured":"C. Dwork and A. Sahai. Concurrrent zero-knowledge: Reducing the need for timing constraints. In CRYPTO\u2019 98, vol. 1642 of LNCS, pp. 105\u2013120, 1998."},{"key":"17_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/3-540-49264-X_5","volume-title":"EUROCRYPT\u2019 95","author":"M. Franklin","year":"1995","unstructured":"M. Franklin and M. Reiter. Verifiable signature sharing. In EUROCRYPT\u2019 95, vol. 921 of LNCS, pp. 50\u201363. Springer Verlag, 1995."},{"key":"17_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0054115","volume-title":"EUROCRYPT\u2019 98","author":"E. Fujisaki","year":"1998","unstructured":"E. Fujisaki and T. Okamoto. A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In EUROCRYPT\u2019 98, vol. 1403 of LNCS, pp. 32\u201346. Springer Verlag, 1998."},{"issue":"2","key":"17_CR20","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"Shafi Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281\u2013308.","journal-title":"SIAM Journal on Computing"},{"key":"17_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/BFb0054142","volume-title":"EUROCRYPT\u2019 98","author":"M. Michels","year":"1998","unstructured":"M. Michels and M. Stadler. Generic constructions for secure and efficient confirmer signature schemes. In EUROCRYPT\u2019 98, vol. 1403 of LNCS, pp. 406\u2013421, 1998."},{"key":"17_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Proc. Information Security Workshop\u201999","author":"K. Nguyen","year":"1999","unstructured":"K. Nguyen, Y. Mu, and V. Varadharajan. Undeniable confirmer signature. Proc. Information Security Workshop\u201999, LNCS, Springer-Verlag, 1999."},{"key":"17_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-48658-5_8","volume-title":"CRYPTO\u2019 94","author":"T. Okamoto","year":"1994","unstructured":"T. Okamoto. Designated confirmer signatures and public-key encryption are equivalent. In CRYPTO\u2019 94, vol. 839 of LNCS, pp. 61\u201374. Springer Verlag, 1994."},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Comm. of the ACM, 21(2):120\u2013126, Feb. 1978.","journal-title":"Comm. of the ACM"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"J. Rompel. One-way functions are necessary and sufficient for secure signature. In Proc. 22nd Annual ACM STOC, 387\u2013394, 1990.","DOI":"10.1145\/100216.100269"},{"issue":"3","key":"17_CR26","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239\u2013252, 1991.","journal-title":"Journal of Cryptology"},{"key":"17_CR27","series-title":"Lect Notes Comput Sci","first-page":"191","volume-title":"EUROCRYPT\u2019 96","author":"M. Stadler","year":"1996","unstructured":"M. Stadler. Publicly verifiable secret sharing. In EUROCRYPT\u2019 96, vol. 1070 of LNCS, pp. 191\u2013199. Springer Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45539-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T23:39:52Z","timestamp":1558481992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45539-6_17"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675174","9783540455394"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45539-6_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"12 May 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}