{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T04:46:22Z","timestamp":1747284382792,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540338512"},{"type":"electronic","value":"9783540338529"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11745853_34","type":"book-chapter","created":{"date-parts":[[2006,4,13]],"date-time":"2006-04-13T09:18:58Z","timestamp":1144919938000},"page":"525-542","source":"Crossref","is-referenced-by-count":34,"title":["k-Times Anonymous Authentication with a Constant Proving Cost"],"prefix":"10.1007","author":[{"given":"Isamu","family":"Teranishi","sequence":"first","affiliation":[]},{"given":"Kazue","family":"Sako","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","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, vol.\u00a01880, pp. 255\u2013270. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-44598-6_16"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Abe, F.: How to Date Blind Signatures. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 244\u2013251. Springer, Heidelberg (1996)","DOI":"10.1007\/BFb0034851"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Medeiros, A.: Efficient Group Signatures without Trapdoors. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 246\u2013268. Springer, Heidelberg (2003)","DOI":"10.1007\/978-3-540-40061-5_15"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, Canetti, Krawczyk: Pseudorandom functions revisited: The cascade construction and its concrete security. In: FOCS 1996, pp. 514\u2013523 (1996)","DOI":"10.1109\/SFCS.1996.548510"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, Micciancio, Warinschi: Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 614\u2013629. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-39200-9_38"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Shi, H., Zhang, C.: Foundations of Group Signatures: The Case of Dynamic Groups. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 136\u2013153. Springer, Heidelberg (2005)","DOI":"10.1007\/978-3-540-30574-3_11"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Short Signatures Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 56\u201373. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short Group Signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 41\u201355. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"34_CR9","doi-asserted-by":"crossref","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)","DOI":"10.1007\/3-540-45539-6_31"},{"key":"34_CR10","unstructured":"Brands. An Efficient Off-line Electronic Cash System Based On The Representation Problem. TR. CS-R9323, Centrum voor Wiskunde en Informatica"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Brickell, Camenisch, Chen: Direct Anonymous Attestation. In: ACMCCS 2004, pp. 132\u2013145 (2004)","DOI":"10.1145\/1030083.1030103"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Schoenmakers, B.: Proof 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)","DOI":"10.1007\/3-540-48658-5_19"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Chan, A.H., Frankel, Y., Tsiounis, Y.: Easy Come - Easy Go Divisible Cash. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 614\u2013629. Springer, Heidelberg (1998)","DOI":"10.1007\/BFb0054154"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Camenisch, J.L., Groth, J.: Group Signatures: Better Efficiency and New Theoretical Aspects. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol.\u00a03352, pp. 120\u2013133. Springer, Heidelberg (2005)","DOI":"10.1007\/978-3-540-30598-9_9"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Camenisch, J.L., Hohenberger, S., Lysyanskaya, A.: Compact E-Cash. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 302\u2013321. Springer, Heidelberg (2005)","DOI":"10.1007\/11426639_18"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Camenisch, J.L., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 268\u2013289. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36413-7_20"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Camenisch, J.L., 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)","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 257\u2013265. Springer, Heidelberg (1991)","DOI":"10.1007\/3-540-46416-6_22"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Chaum, D., Pedersen, T.P.: Transferred Cash Grows in Size. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 390\u2013407. Springer, Heidelberg (1993)","DOI":"10.1007\/3-540-47555-9_32"},{"key":"34_CR20","unstructured":"Canard, T.: List Signature Schemes and Application to Electronic Voting. In: International Workshop on Coding and Cryptography 2003, pp. 24\u201328 (2003)"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Canard, S., Stam, T.: List Signature Schemes. Special Issue of the Journal Discrete Applied mathematics (2005)","DOI":"10.1016\/j.dam.2005.08.003"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Jurik, D.: A Generalization, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44586-2_9"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.B., Nielsen, J.B.: Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 449\u2013464. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45708-9_29"},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Yampolskiy, A.: A Verifiable Random Function with Short Proofs and Keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 416\u2013431. Springer, Heidelberg (2005)","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"34_CR25","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Imai, H.: An Efficient Group Signature Scheme from Bilinear Maps. In: Boyd, C., Gonz\u00e1lez Nieto, J.M. (eds.) ACISP 2005. LNCS, vol.\u00a03574, pp. 455\u2013467. Springer, Heidelberg (2005)","DOI":"10.1007\/11506157_38"},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Sako, K.: An Efficient Scheme for Proving a Shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 368\u2013387. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44647-8_22"},{"key":"34_CR27","doi-asserted-by":"crossref","unstructured":"Goldreich, Goldwasser, Micali: How to construct random function. J.ACM\u00a033(4), 797\u2013807 (1986)","DOI":"10.1145\/6490.6503"},{"key":"34_CR28","unstructured":"Kiayias, Y.: Group Signatures: Provable Secure, Efficient Constructions and Anonymity from Trapdoor Holders (2004), http:\/\/eprint.iacr.org\/2004\/076.ps"},{"key":"34_CR29","unstructured":"Kiayias, A., Yung, M.: Group Signatures with Efficient Concurrent Join. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 198\u2013214. Springer, Heidelberg (2005), http:\/\/eprint.iacr.org\/2005\/345"},{"key":"34_CR30","unstructured":"Mitsunari, Sakai, Kasahara: A new traitor tracing. IEICE Trans.\u00a085(2), 481\u2013484 (2002)"},{"key":"34_CR31","doi-asserted-by":"crossref","unstructured":"Nakanishi, T., Haruna, N., Sugiyama, Y.: Unlinkable Electronic Coupon Protocol with Anonymity Control. In: Zheng, Y., Mambo, M. (eds.) ISW 1999. LNCS, vol.\u00a01729, pp. 37\u201346. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-47790-X_4"},{"key":"34_CR32","unstructured":"Reingold, N.: Number-Theoretic Constructions of Efficient Pseudo- Random Functions. In: FOCS 1997, pp. 458\u2013467 (1997)"},{"key":"34_CR33","doi-asserted-by":"crossref","unstructured":"Nguyen, L., Safavi-Naini, R.: Efficient and Provably Secure Trapdoor-free Group Signature Schemes from Bilinear Pairings. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 372\u2013386. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-30539-2_26"},{"key":"34_CR34","doi-asserted-by":"crossref","unstructured":"Nguyen, L., Safavi-Naini, R.: Dynamic k-Times Anonymous Authentication. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 318\u2013333. Springer, Heidelberg (2005)","DOI":"10.1007\/11496137_22"},{"key":"34_CR35","doi-asserted-by":"crossref","unstructured":"Neff: A Verifiable Secret Shuffle and its Application to E-Voting. In: ACMCCS 2001, pp. 116\u2013125 (2001)","DOI":"10.1145\/501997.502000"},{"key":"34_CR36","unstructured":"Okamoto, T., Ohta: One-Time Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences\u00a081(1), 2\u201310 (1998)"},{"key":"34_CR37","doi-asserted-by":"crossref","unstructured":"Ohkubo, M., Miura, F., Abe, M., Fujioka, A., Okamoto, T.: An improvement of a practical secret voting scheme. In: Zheng, Y., Mambo, M. (eds.) ISW 1999. LNCS, vol.\u00a01729, pp. 37\u201346. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-47790-X_19"},{"key":"34_CR38","doi-asserted-by":"crossref","unstructured":"Pavlovski, C., Boyd, C., Foo, E.: Detachable Electronic Coins. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol.\u00a01726, pp. 54\u201370. Springer, Heidelberg (1999)","DOI":"10.1007\/978-3-540-47942-0_6"},{"key":"34_CR39","doi-asserted-by":"crossref","unstructured":"Pedersen, T.P.: A Threshold Cryptosystem without a Trusted Party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)","DOI":"10.1007\/3-540-46416-6_47"},{"key":"34_CR40","unstructured":"Sako: Restricted Anonymous Participation. In: SCIS 2000, B12 (Japanese)"},{"key":"34_CR41","doi-asserted-by":"crossref","unstructured":"Sako, K., Kilian, J.: Secure Voting using Partially Compatible Homomorphisms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 411\u2013424. Springer, Heidelberg (1994)","DOI":"10.1007\/3-540-48658-5_37"},{"key":"34_CR42","unstructured":"Teranishi, I., Furukawa, J.: Tag Signature. In: SCIS 2003, 6C-2 (2003) (Japanese. Preliminary version of [TFS04])"},{"key":"34_CR43","doi-asserted-by":"crossref","unstructured":"Teranishi, I., Furukawa, J., Sako, K.: k-Times Anonymous Authentication. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 308\u2013322. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-30539-2_22"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11745853_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T11:06:32Z","timestamp":1736334392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11745853_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338512","9783540338529"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/11745853_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}