{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:50:56Z","timestamp":1757451056998},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642010002"},{"type":"electronic","value":"9783642010019"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01001-9_25","type":"book-chapter","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T12:38:25Z","timestamp":1239799105000},"page":"425-442","source":"Crossref","is-referenced-by-count":83,"title":["On the Portability of Generalized Schnorr Proofs"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[]},{"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-44598-6_16","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"G. Ateniese","year":"2000","unstructured":"Ateniese, G., Camenisch, J.L., Joye, M., Tsudik, G.: A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, p. 255. Springer, Heidelberg (2000)"},{"key":"25_CR2","unstructured":"Ateniese, G., Camenisch, J., Joye, M., Tsudik, G.: Remarks on \u201danalysis of one popular group signature scheme\u201d in asiacrypt 2006. Cryptology ePrint Archive, Report 2006\/464 (2006), http:\/\/eprint.iacr.org\/"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-36504-4_14","volume-title":"Financial Cryptography","author":"G. Ateniese","year":"2003","unstructured":"Ateniese, G., Song, D.X., Tsudik, G.: Quasi-efficient revocation in group signatures. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 183\u2013197. Springer, Heidelberg (2003)"},{"key":"25_CR4","unstructured":"Bangerter, E.: On Efficient Zero-Knowledge Proofs of Knowledge. PhD thesis, Ruhr U. Bochum (2005)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-30580-4_11","volume-title":"Public Key Cryptography - PKC 2005","author":"E. Bangerter","year":"2005","unstructured":"Bangerter, E., Camenisch, J.L., Maurer, U.M.: Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 154\u2013171. Springer, Heidelberg (2005), http:\/\/www.zurich.ibm.com\/~\/jca\/papers\/bacama05.pdf"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"25_CR7","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":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44586-2_15","volume-title":"Public Key Cryptography","author":"E. Bresson","year":"2001","unstructured":"Bresson, E., Stern, J.: Efficient revocation in group signatures. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 190\u2013206. Springer, Heidelberg (2001)"},{"key":"25_CR9","first-page":"225","volume-title":"Proc. 11th ACM Conference on Computer and Communications Security","author":"E. Brickell","year":"2004","unstructured":"Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation. In: Proc. 11th ACM Conference on Computer and Communications Security, pp. 225\u2013234. ACM Press, New York (2004)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-24747-0_7","volume-title":"Trust Management","author":"L. Bussard","year":"2004","unstructured":"Bussard, L., Molva, R., Roudier, Y.: History-Based Signature or How to Trust Anonymous Documents. In: Jensen, C., Poslad, S., Dimitrakos, T. (eds.) iTrust 2004. LNCS, vol.\u00a02995, pp. 78\u201392. Springer, Heidelberg (2004)"},{"key":"25_CR11","first-page":"122","volume-title":"PerCom Workshops","author":"L. Bussard","year":"2004","unstructured":"Bussard, L., Roudier, Y., Molva, R.: Untraceable secret credentials: Trust establishment with privacy. In: PerCom Workshops, pp. 122\u2013126. IEEE Computer Society, Los Alamitos (2004)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Kiayias, A., Yung, M.: On the portability of generalized schnorr proofs. Technical report, Cryptology ePrint Archive (2009)","DOI":"10.1007\/978-3-642-01001-9_25"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J.L. Camenisch","year":"2003","unstructured":"Camenisch, J.L., 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)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J.L. Camenisch","year":"1997","unstructured":"Camenisch, J.L., Stadler, M.A.: Efficient Group Signature Schemes for Large Groups. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 410\u2013424. Springer, Heidelberg (1997)"},{"key":"25_CR15","unstructured":"Camenisch, J.L.: Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Z\u00fcrich, Diss. ETH No.\u00a012520. Hartung Gorre Verlag, Konstanz (1998)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/11935230_30","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"Z. Cao","year":"2006","unstructured":"Cao, Z.: Analysis of One Popular Group Signature Scheme. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 460\u2013466. Springer, Heidelberg (2006)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BFb0054154","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"A.H. Chan","year":"1998","unstructured":"Chan, A.H., Frankel, Y., Tsiounis, Y.: Easy Come - Easy Go Divisible Cash. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 561\u2013575. Springer, Heidelberg (1998)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Chan, A.H., Frankel, Y., Tsiounis, Y.: Easy come - easy go divisible cash. GTE Technical Report (1998), http:\/\/www.ccs.neu.edu\/home\/yiannis\/pubs.html","DOI":"10.1007\/BFb0054154"},{"issue":"3","key":"25_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/357830.357847","volume":"3","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Shoup, V.: Signature schemes based on the strong rsa assumption. ACM Trans. Inf. Syst. Secur.\u00a03(3), 161\u2013185 (2000)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"25_CR20","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.B. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.B.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 418\u2013430. Springer, Heidelberg (2000)"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"I.B. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I.B., Fujisaki, E.: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 125\u2013142. Springer, Heidelberg (2002)"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-30598-9_6","volume-title":"Security in Communication Networks","author":"J. Furukawa","year":"2005","unstructured":"Furukawa, J., Yonezawa, S.: Group Signatures with Separate and Distributed Authorities. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol.\u00a03352, pp. 77\u201390. Springer, Heidelberg (2005)"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-45126-6_3","volume-title":"Financial Cryptography","author":"M. Gaud","year":"2003","unstructured":"Gaud, M., Traor\u00e9, J.: On the Anonymity of Fair Offline E-cash Systems. In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742, pp. 34\u201350. Springer, Heidelberg (2003)"},{"key":"25_CR26","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/28395.28420","volume-title":"STOC 1987: Proceedings of the nineteenth annual ACM conference on Theory of computing","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC 1987: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"25_CR27","volume-title":"The Foundations of Cryptography","author":"O. Goldreich","year":"1999","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol.\u00a02. Cambridge University Press, Cambridge (1999)"},{"issue":"1","key":"25_CR28","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/11745853_3","volume-title":"Public Key Cryptography - PKC 2006","author":"S. Kunz-Jacques","year":"2006","unstructured":"Kunz-Jacques, S., Martinet, G., Poupard, G., Stern, J.: Cryptanalysis of an Efficient Proof of Knowledge of Discrete Logarithm. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 27\u201343. Springer, Heidelberg (2006)"},{"key":"25_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-48000-6_17","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"T. Le Van","year":"1999","unstructured":"Van Le, T., Nguyen, K.Q., Varadharajan, V.: How to Prove That a Committed Number Is Prime. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 208\u2013218. Springer, Heidelberg (1999)"},{"key":"25_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BFb0055483","volume-title":"Financial Cryptography","author":"A. Lysyanskaya","year":"1998","unstructured":"Lysyanskaya, A., Ramzan, Z.: Group Blind Digital Signatures: A Scalable Solution to Electronic Cash. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol.\u00a01465, pp. 184\u2013197. Springer, Heidelberg (1998)"},{"key":"25_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-44647-8_8","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"P.D. MacKenzie","year":"2001","unstructured":"MacKenzie, P.D., Reiter, M.K.: Two-party generation of DSA signatures. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 137\u2013154. Springer, Heidelberg (2001)"},{"key":"25_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-30108-0_10","volume-title":"Computer Security \u2013 ESORICS 2004","author":"E. Mykletun","year":"2004","unstructured":"Mykletun, E., Narasimha, M., Tsudik, G.: Signature Bouquets: Immutability for Aggregated\/Condensed Signatures. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol.\u00a03193, pp. 160\u2013176. Springer, Heidelberg (2004)"},{"key":"25_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-30144-8_31","volume-title":"Information Security","author":"T. Nakanishi","year":"2004","unstructured":"Nakanishi, T., Shiota, M., Sugiyama, Y.: An Efficient Online Electronic Cash with Unlinkable Exact Payments. In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol.\u00a03225, pp. 367\u2013378. Springer, Heidelberg (2004)"},{"issue":"3","key":"25_CR35","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology\u00a013(3), 361\u2013396 (2000)","journal-title":"Journal of Cryptology"},{"key":"25_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-48184-2_5","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"A. Santis De","year":"1988","unstructured":"De Santis, A., Micali, S., Persiano, G.: Noninteractive Zero-Knowledge Proof Systems. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 52\u201372. Springer, Heidelberg (1988)"},{"issue":"3","key":"25_CR37","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":"25_CR38","first-page":"225","volume-title":"Proc. 8th ACM Conference on Computer and Communications Security","author":"D.X. Song","year":"2001","unstructured":"Song, D.X.: Practical forward secure group signature schemes. In: Proc. 8th ACM Conference on Computer and Communications Security, pp. 225\u2013234. ACM press, New York (2001)"},{"key":"25_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11506157_28","volume-title":"Information Security and Privacy","author":"W. Susilo","year":"2005","unstructured":"Susilo, W., Mu, Y.: On the Security of Nominative Signatures. In: Boyd, C., Gonz\u00e1lez Nieto, J.M. (eds.) ACISP 2005. LNCS, vol.\u00a03574, pp. 329\u2013335. Springer, Heidelberg (2005)"},{"key":"25_CR40","unstructured":"Tang, C., Liu, Z., Wang, M.: A verifiable secret sharing scheme with statistical zero-knowledge. Cryptology ePrint Archive, Report 2003\/222 (2003), http:\/\/eprint.iacr.org\/"},{"key":"25_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-31979-5_5","volume-title":"Information Security Practice and Experience","author":"P.P. Tsang","year":"2005","unstructured":"Tsang, P.P., Wei, V.K.: Short Linkable Ring Signatures for E-Voting, E-Cash and Attestation. In: Deng, R.H., Bao, F., Pang, H., Zhou, J. (eds.) ISPEC 2005. LNCS, vol.\u00a03439, pp. 48\u201360. Springer, Heidelberg (2005)"},{"key":"25_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-30556-9_30","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"P.P. Tsang","year":"2004","unstructured":"Tsang, P.P., Wei, V.K., Chan, T.K., Au, M.H., Liu, J.K., Wong, D.S.: Separable Linkable Threshold Ring Signatures. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol.\u00a03348, pp. 384\u2013398. Springer, Heidelberg (2004)"},{"key":"25_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/11556992_11","volume-title":"Information Security","author":"V.K. Wei","year":"2005","unstructured":"Wei, V.K.: Tracing-by-linking group signatures. In: Zhou, J., L\u00f3pez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol.\u00a03650, pp. 149\u2013163. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01001-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:12:03Z","timestamp":1558271523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01001-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010002","9783642010019"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01001-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}