{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T08:10:16Z","timestamp":1785831016591,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540414049","type":"print"},{"value":"9783540444480","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44448-3_25","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:22:44Z","timestamp":1181348564000},"page":"331-345","source":"Crossref","is-referenced-by-count":95,"title":["Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2000,10,27]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"G. Ateniese Effcient Verifiable Encryption (and Fair Exchange) of Digital Signatures, In 6th ACM CCS, pp. 138\u2013146, 1999.","DOI":"10.1145\/319709.319728"},{"key":"25_CR2","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."},{"issue":"4","key":"25_CR3","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/49.839935","volume":"18","author":"N. Asokan","year":"2000","unstructured":"N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications, 18(4):591\u2013610, Apr. 2000.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"25_CR4","series-title":"Lect Notes Comput Sci","volume-title":"CARDIS\u2019 98","author":"F. Bao","year":"2000","unstructured":"F. Bao. An Effcient Verifiable Encryption Scheme for the Encryption of Discrete Logarithms, In CARDIS\u2019 98 vol. 1820 of LNCS, 2000."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"J. Camenisch and I. Damg\u00e5rd. Verifiable encryption and applications to group signatures and signature sharing. Technical Report RS-98-32, BRICS, Department of Computer Science, University of Aarhus, Dec. 1998.","DOI":"10.7146\/brics.v5i32.19438"},{"key":"25_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/3-540-69053-0_32","volume-title":"EUROCRYPT\u2019 97","author":"J. Camenisch","year":"1997","unstructured":"J. Camenisch. Efficient and generalized group signatures. In EUROCRYPT\u2019 97, vol. 1233 of LNCS, pp. 465\u2013479, 1997."},{"key":"25_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-61770-1_26","volume-title":"Computer Security-ESORICS 96","author":"J. Camenisch","year":"1996","unstructured":"J. Camenisch, U. Maurer, and M. Stadler. Digital payment systems with passive anonymity-revoking trustees. In Computer Security-ESORICS 96, vol. 1146 of LNCS, pp. 33\u201343. Springer Verlag, 1996."},{"key":"25_CR8","series-title":"Lect Notes Comput Sci","volume-title":"CRYPTO\u2019 99","author":"J. Camenisch","year":"1998","unstructured":"J. Camenisch and M. Michels. Separability and Efficiency for Generic Group Signature Schemes In M. Wiener, CRYPTO\u2019 99, vol. 1666 of LNCS, 1998."},{"key":"25_CR9","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, 1997."},{"key":"25_CR10","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 effcient and secure protocols for verifiable signature sharing and other applications. In CRYPTO\u2019 98, vol. 1642 of LNCS, pp. 105\u2013120, Berlin, 1998. Springer Verlag."},{"key":"25_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"EUROCRYPT\u2019 91","author":"D. Chaum","year":"1991","unstructured":"D. Chaum and E. van Heyst. Group signatures. In EUROCRYPT\u2019 91, vol. 547 of LNCS, pp. 257\u2013265. Springer-Verlag, 1991."},{"key":"25_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BFb0053433","volume-title":"EUROCRYPT\u2019 94","author":"L. Chen","year":"1995","unstructured":"L. Chen and T. P. Pedersen. New group signature schemes. In EUROCRYPT\u2019 94, vol. 950 of LNCS, pp. 171\u2013181, 1995."},{"key":"25_CR13","unstructured":"R. Cramer. Modular Design of Secure yet Practical Cryptographic Protocol. PhD thesis, University ofA msterdam, 1997."},{"key":"25_CR14","series-title":"Lect Notes Comput Sci","volume-title":"CRYPTO\u2019 98","author":"R. Cramer","year":"1998","unstructured":"R. Cramer and I. Damg\u00e5rd. Zero-knowledge prooff or finite field arithmetic, or: Can zero-knowledge be for free? In CRYPTO\u2019 98, vol. 1642 of LNCS, 1998."},{"key":"25_CR15","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 ofwit ness hiding protocols. In CRYPTO\u2019 94, vol. 839 of LNCS, pp. 174\u2013187. Springer Verlag, 1994."},{"key":"25_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/0-387-34805-0_3","volume-title":"CRYPTO\u2019 89","author":"I. B. Damg\u00e5rd","year":"1990","unstructured":"I. B. Damg\u00e5rd. On the existence of bit commitment schemes and zero-knowledge proofs. In CRYPTO\u2019 89, vol. 435 of LNCS, pp. 17\u201327, 1990."},{"key":"25_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"CRYPTO\u2019 89","author":"Y. Desmedt","year":"1990","unstructured":"Y. Desmedt and Y. Frankel. Threshold cryptography. In CRYPTO\u2019 89, vol. 435 of LNCS, pp. 307\u2013315. Springer-Verlag, 1990."},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"C. Dwork, M. Naor, and A. Sahai. Concurrent zero knowledge. In Proc. 30th Annual ACM Symposium on Theory of Computing (STOC), 1998.","DOI":"10.1145\/276698.276853"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. Journal of Cryptology, 1:77\u201394, 1988.","journal-title":"Journal of Cryptology"},{"key":"25_CR20","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"CRYPTO\u2019 86","author":"A. Fiat","year":"1987","unstructured":"A. Fiat and A. Shamir. How to prove yourself: Practical solution to identification and signature problems. In CRYPTO\u2019 86, vol. 263 of LNCS, pp. 186\u2013194, 1987."},{"key":"25_CR21","series-title":"Lect Notes Comput Sci","volume-title":"ASIACRYPT\u2019 96","author":"Y. Frankel","year":"1996","unstructured":"Y. Frankel, Y. Tsiounis, and M. Yung. \u201cIndirect discourse proofs:\u201d Achieving efficient fair off-line e-cash. In ASIACRYPT\u2019 96, vol. 1163 of LNCS, 1996."},{"key":"25_CR22","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."},{"issue":"3","key":"25_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich and A. Kahan. How to construct constant-round zero-knowledge proof systems for NP. Journal of Cryptology, 9(3):167\u2013190, 1996.","journal-title":"Journal of Cryptology"},{"issue":"2","key":"25_CR24","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270\u2013299, Apr. 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-45961-8_11","volume-title":"EUROCRYPT\u2019 88","author":"L. C. Guillou","year":"1988","unstructured":"L. C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In EUROCRYPT\u2019 88, vol. 330 of LNCS, pp. 123\u2013128, 1988."},{"key":"25_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BFb0055727","volume-title":"CRYPTO\u2019 98","author":"J. Kilian","year":"1998","unstructured":"J. Kilian and E. Petrank. Identity escrow. In CRYPTO\u2019 98, vol. 1642 of LNCS, pp. 169\u2013185, Berlin, 1998. Springer Verlag."},{"key":"25_CR27","unstructured":"S. Micali. Efficient certificate revocation and certified e-mail with transparent post offces. Presentation at the 1997 RSA Security Conference."},{"issue":"2","key":"25_CR28","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/0217025","volume":"17","author":"S. Micali","year":"1988","unstructured":"S. Micali, C. Racko., and B. Sloan. The notion ofsecu rity for probabilistic cryptosystems. SIAM Journal on Computing, 17(2):412\u2013426, April 1988.","journal-title":"SIAM Journal on Computing"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"H. Petersen. How to convert any digital signature scheme into a group signature scheme. In Security Protocols Workshop, Paris, 1997.","DOI":"10.1007\/BFb0028168"},{"key":"25_CR30","series-title":"Lect Notes Comput Sci","first-page":"173","volume-title":"EUROCRYPT 2000","author":"G. Poupard","year":"2000","unstructured":"G. Poupard and J. Stern, Fair Encryption of RSA Keys. In EUROCRYPT 2000, LNCS, pp. 173\u2013190. Springer Verlag, 2000."},{"issue":"3","key":"25_CR31","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr. Eficient signature generation for smart cards. Journal of Cryptology, 4(3):239\u2013252, 1991.","journal-title":"Journal of Cryptology"},{"key":"25_CR32","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."},{"key":"25_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/3-540-49264-X_17","volume-title":"EUROCRYPT\u2019 95","author":"M. Stadler","year":"1995","unstructured":"M. Stadler, J.-M. Piveteau, and J. Camenisch. Fair blind signatures. In EUROCRYPT\u2019 95, vol. 921 of LNCS, pp. 209\u2013219, 1995."},{"key":"25_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0054114","volume-title":"EUROCRYPT\u2019 98","author":"A. Young","year":"1998","unstructured":"A. Young and M. Yung. Auto-Recoverable Auto-Certifiable Cryptosystems. In EUROCRYPT\u2019 98, vol. 1403 of LNCS, pp. 17\u201331, 1998."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44448-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:13:20Z","timestamp":1556478800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44448-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414049","9783540444480"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-44448-3_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}