{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:12:48Z","timestamp":1765368768483},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222627"},{"type":"electronic","value":"9783642222634"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22263-4_14","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T17:34:45Z","timestamp":1311010485000},"page":"246-263","source":"Crossref","is-referenced-by-count":33,"title":["Efficient Proofs of Attributes in Pairing-Based Anonymous Credential System"],"prefix":"10.1007","author":[{"given":"Amang","family":"Sudarsono","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toru","family":"Nakanishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuo","family":"Funabiki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11832072_8","volume-title":"Security and Cryptography for Networks","author":"M.H. Au","year":"2006","unstructured":"Au, M.H., Susilo, W., Mu, Y.: Constant-size dynamic k-TAA. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 111\u2013125. Springer, Heidelberg (2006)"},{"key":"#cr-split#-14_CR2.1","unstructured":"Au, M.H., Susilo, W., Mu, Y.: Constant-size dynamic k-TAA. Cryptology ePrint Archive: Report 2008\/136 (2008);"},{"key":"#cr-split#-14_CR2.2","unstructured":"This is the extended version of [1]"},{"key":"14_CR3","unstructured":"Belenkiy, M., Chase, M., Kohlweiss, M., Lysyanskaya, A.: Non-interactive anonymous credentials. Cryptology ePrint Archive: Report 2007\/384 (2007)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-540-78524-8_20","volume-title":"Theory of Cryptography","author":"M. Belenkiy","year":"2008","unstructured":"Belenkiy, M., Chase, M., Kohlweiss, M., Lysyanskaya, A.: P-signatures and noninteractive anonymous credentials. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 356\u2013374. Springer, Heidelberg (2008)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bichsel, P., Camenisch, J., Gro\u00df, T., Shoup, V.: Anonymous credentials on a standard java card. In: Proc. ACM Conference on Computer and Communications Security 2009 (ACM-CCS 2009), pp. 600\u2013610 (2009)","DOI":"10.1145\/1653662.1653734"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","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)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D. Boneh","year":"2004","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)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: Proc. 11th ACM Conference on Computer and Communications Security (ACM-CCS 2004), pp. 168\u2013177 (2004)","DOI":"10.1145\/1030083.1030106"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-71677-8_1","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"X. Boyen","year":"2007","unstructured":"Boyen, X., Waters, B.: Full-domain subgroup hiding and constant-size group signatures. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Gro\u00df, T.: Efficient attributes for anonymous credentials. In: Proc. ACM Conference on Computer and Communications Security 2008 (ACM-CCS 2008), pp. 345\u2013356 (2008)","DOI":"10.1145\/1455770.1455814"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-642-01001-9_25","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Kiayias, A., Yung, M.: On the portability of generalized schnorr proofs. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 425\u2013442. Springer, Heidelberg (2009)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-00468-1_27","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Kohlweiss, M., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credentials. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 481\u2013500. Springer, Heidelberg (2009)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 61\u201376. Springer, Heidelberg (2002)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R. Cramer","year":"1994","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)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/11506157_38","volume-title":"Information Security and Privacy","author":"J. Furukawa","year":"2005","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)"}],"container-title":["Lecture Notes in Computer Science","Privacy Enhancing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22263-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:06:56Z","timestamp":1606187216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22263-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222627","9783642222634"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22263-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}