{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T13:49:54Z","timestamp":1760622594931,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442707"},{"type":"electronic","value":"9783540458111"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45811-5_21","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T09:43:51Z","timestamp":1192787031000},"page":"272-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Proofs of Knowledge for Non-monotone Discrete-Log Formulae and Applications"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Bresson","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Stern","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"key":"21_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/3-540-44598-6_16","volume-title":"Proc. of Crypto\u2019 00, August 2000","author":"G. Ateniese","year":"2000","unstructured":"G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In M. Bellare, editor, Proc. of Crypto\u2019 00, volume 1880 of LNCS, pages 255\u2013270. Springer-Verlag, August 2000."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proc. of ACM CCS\u2019 93, pages 62\u201373. ACM Press, November 1993.","DOI":"10.1145\/168588.168596"},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-48329-2_26","volume-title":"Proc. of Crypto\u2019 93, August 1994","author":"S. A. Brands","year":"1994","unstructured":"S. A. Brands. Untraceable off-line cash in wallets with observers. In D. R. Stinson, editor, Proc. of Crypto\u2019 93, volume 773 of LNCS, pages 302\u2013318. Springer-Verlag, August 1994."},{"key":"21_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-69053-0_22","volume-title":"Proc. of Eurocrypt\u2019 97, May 1997","author":"S. A. Brands","year":"1997","unstructured":"S. A. Brands. Rapid demonstration oflinear relations connected by boolean operators. In W. Fumy, editor, Proc. of Eurocrypt\u2019 97, volume 1233 of LNCS, pages 318\u2013333. Springer-Verlag, May 1997."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"G. Brassard and C. Cr\u00e9peau. Non transitive transfer of confidence: a perfect zeroknowledge interactive protocol for SAT and beyond. In Proc. of FOCS\u2019 86, pages 188\u2013195. IEEE Press, October 1986.","DOI":"10.1109\/SFCS.1986.33"},{"key":"21_CR6","series-title":"Lect Notes Comput Sci","first-page":"190","volume-title":"Proc. of PKC\u2019 01, February 2001","author":"E. Bresson","year":"2000","unstructured":"E. Bresson and J. Stern. Efficient revocation in group signatures. In K. Kim, editor, Proc. of PKC\u2019 01, volume 1992 of LNCS, pages 190\u2013206. Springer-Verlag, February 2001."},{"key":"21_CR7","unstructured":"J. Camenisch. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Z\u00fcrich, 1998."},{"key":"21_CR8","series-title":"Lect Notes Comput Sci","first-page":"160","volume-title":"Proc. of Asiacrypt\u2019 98, October 1999","author":"J. Camenisch","year":"1998","unstructured":"J. Camenisch and M. Michels. A group signature scheme with improved efficiency. In K. Ohta and D. Pei, editors, Proc. of Asiacrypt\u2019 98, volume 1514 of LNCS, pages 160\u2013174. Springer-Verlag, October 1999."},{"key":"21_CR9","series-title":"Lect Notes Comput Sci","first-page":"106","volume-title":"Proc. of Crypto\u2019 99, August 1999","author":"J. Camenisch","year":"1999","unstructured":"J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In M. Wiener, editor, Proc. of Crypto\u2019 99, volume 1666 of LNCS, pages 106\u2013121. Springer-Verlag, August 1999."},{"key":"21_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Proc. of Crypto\u2019 97, August 1997","author":"J. Camenisch","year":"1997","unstructured":"J. Camenisch and M. Stadler. Efficient group signatures schemes for large groups. In B. Kaliski, editor, Proc. of Crypto\u2019 97, volume 1294 of LNCS, pages 410\u2013424. Springer-Verlag, August 1997."},{"key":"21_CR11","unstructured":"J. Camenisch and M. Stadler. Proofs systems for general statements about discrete logarithms. Technical Report TR 260, ETH Z\u00fcrich, Z\u00fcrich, CH, March 1997."},{"key":"21_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-48910-X_7","volume-title":"Proc. of Eurocrypt\u2019 99, May 1999","author":"R. Canetti","year":"1999","unstructured":"R. Canetti and S. Goldwasser. An efficient threshold PKC secure against adaptive CCA. In J. Stern, editor, Proc. of Eurocrypt\u2019 99, volume 1592 of LNCS, pages 90\u2013106. Springer-Verlag, May 1999."},{"key":"21_CR13","series-title":"Lect Notes Comput Sci","first-page":"195","volume-title":"Proc. of Crypto\u2019 86, August 1986","author":"D. Chaum","year":"1987","unstructured":"D. Chaum. Demonstrating that a public predicate can be satisfied without revealing any information about how. In A. M. Odlyzko, editor, Proc. of Crypto\u2019 86, volume 263 of LNCS, pages 195\u2013199. Springer-Verlag, August 1986."},{"key":"21_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-39118-5_13","volume-title":"Proc. of Eurocrypt\u2019 87, May 1987","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, J. H. Evertse, and J. van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In D. Chaum and W. L. Price, editors, Proc. of Eurocrypt\u2019 87, volume 304 of LNCS, pages 127\u2013141. Springer-Verlag, May 1987."},{"key":"21_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-47721-7_14","volume-title":"Proc. of Crypto\u2019 86, August 1986","author":"D. Chaum","year":"1987","unstructured":"D. Chaum, J. H. Evertse, J. van de Graaf, and R. Peralta. Demonstrating possession of a discrete logarithm without revealing it. In A. M. Odlyzko, editor, Proc. of Crypto\u2019 86, volume 263 of LNCS, pages 200\u2013212. Springer-Verlag, August 1986."},{"key":"21_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Proc. of Eurocrypt\u2019 91, May 1992","author":"D. Chaum","year":"1991","unstructured":"D. Chaum and E. van Heyst. Group signatures. In D. W. Davies, editor, Proc. of Eurocrypt\u2019 91, volume 547 of LNCS, pages 257\u2013265. Springer-Verlag, May 1992."},{"key":"21_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/3-540-46766-1_38","volume-title":"Proc. of Crypto\u2019 91, August 1992","author":"D. Chaum","year":"1992","unstructured":"D. Chaum, E. van Heyst, and B. Pfitzmann. Cryptographically strong undeniable signatures, unconditionally secure for the signer. In J. Feigenbaum, editor, Proc. of Crypto\u2019 91, volume 576 of LNCS, pages 470\u2013484. Springer-Verlag, August 1992."},{"key":"21_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BFb0053433","volume-title":"Proc. of Eurocrypt\u2019 94, May 1995","author":"L. Chen","year":"1995","unstructured":"L. Chen and T. P. Pedersen. New group signature schemes. In A. De Santis, editor, Proc. of Eurocrypt\u2019 94, volume 950 of LNCS, pages 171\u2013181. Springer-Verlag, May 1995."},{"key":"21_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Proc. of Crypto\u2019 94, August 1994","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. B. Damg\u00e5rd, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. G. Desmedt, editor, Proc. of Crypto\u2019 94, volume 839 of LNCS, pages 174\u2013187. Springer-Verlag, August 1994."},{"issue":"2","key":"21_CR20","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. J. of Cryptology, 1(2):77\u201394, Summer 1988.","journal-title":"J. of Cryptology"},{"key":"21_CR21","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"Proc. of Crypto\u2019 86, August 1986","author":"A. Fiat","year":"1987","unstructured":"A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. M. Odlyzko, editor, Proc. of Crypto\u2019 86, volume 263 of LNCS, pages 186\u2013194. Springer-Verlag, August 1986."},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Z. Galil, S. Haber, and M. Yung. A private interactive test of a boolean predicate and minimum-knowledge public key cryptosystem. In Proc. of FOCS\u2019 85, pages 360\u2013371. IEEE Press, October 1985.","DOI":"10.1109\/SFCS.1985.1"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. W. Rackoff. Knowledge complexity ofin teractive proofs. In Proc. of STOC\u2019 85, pages 291\u2013304. ACM Press, May 1985.","DOI":"10.1145\/22145.22178"},{"key":"21_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BFb0055727","volume-title":"Proc. of Crypto\u201998, August 1998","author":"J. Kilian","year":"1998","unstructured":"J. Kilian and E. Petrank. Identity escrow. In H. Krawczyk, editor, Proc. of Crypto\u201998, volume 1462 of LNCS, pages 169\u2013185. Springer-Verlag, August 1998."},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung. On monotone formula closure of SZK. In Proc. of FOCS\u2019 94, pages 454\u2013465. IEEE Press, November 1994.","DOI":"10.1109\/SFCS.1994.365745"},{"key":"21_CR26","unstructured":"B. Schoenmakers. Efficient proofs of or. Manuscript, 1993."},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"D. X. Song. Practical forward secure group signature schemes. In P. Samarati, editor, ACM CCS\u2019 01, pages 225\u2013234. ACM Press, November 2001.","DOI":"10.1145\/501983.502015"},{"key":"21_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Proc. of Eurocrypt\u2019 96, May 1996","author":"M. Stadler","year":"1996","unstructured":"M. Stadler. Publicly verifiable secret sharing. In U. M. Maurer, editor, Proc. of Eurocrypt\u2019 96, volume 1070 of LNCS, pages 190\u2013199. Springer-Verlag, May 1996."}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45811-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T19:14:21Z","timestamp":1737486861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45811-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442707","9783540458111"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-45811-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"5 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}