{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T21:01:09Z","timestamp":1784926869308,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,10,30]]},"DOI":"10.1145\/1180405.1180431","type":"proceedings-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T01:15:56Z","timestamp":1168996556000},"page":"201-210","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":154,"title":["How to win the clonewars"],"prefix":"10.1145","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[{"name":"IBM Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Susan","family":"Hohenberger","sequence":"additional","affiliation":[{"name":"IBM Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markulf","family":"Kohlweiss","sequence":"additional","affiliation":[{"name":"Katholieke Universiteit Leuven"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[{"name":"Brown University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mira","family":"Meyerovich","sequence":"additional","affiliation":[{"name":"Brown University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646765.759593"},{"key":"e_1_3_2_1_2_1","first-page":"29","volume-title":"NDSS","author":"Ateniese G.","year":"2005","unstructured":"G. Ateniese , K. Fu , M. Green , and S. Hohenberger . Improved Proxy Re-encryption Schemes with Applications to Secure Distributed Storage . In NDSS , p. 29 -- 43 , 2005 .]] G. Ateniese, K. Fu, M. Green, and S. Hohenberger. Improved Proxy Re-encryption Schemes with Applications to Secure Distributed Storage. In NDSS, p. 29--43, 2005.]]"},{"key":"e_1_3_2_1_4_1","first-page":"480","volume-title":"EUROCRYPT '97","volume":"1233","author":"Bari\u0107 N.","year":"1997","unstructured":"N. Bari\u0107 and B. Pfitzmann . Collision-free accumulators and fail-stop signature schemes without trees . In EUROCRYPT '97 , volume 1233 , p. 480 -- 494 , 1997 .]] N. Bari\u0107 and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In EUROCRYPT '97, volume 1233, p. 480--494, 1997.]]"},{"key":"e_1_3_2_1_5_1","first-page":"56","volume":"3027","author":"Boneh D.","year":"2004","unstructured":"D. Boneh and X. Boyen . Short signatures without random oracles. In EUROCRYPT , v. 3027 of LNCS, p. 56 -- 73 , 2004 .]] D. Boneh and X. Boyen. Short signatures without random oracles. In EUROCRYPT, v.3027 of LNCS, p. 56--73, 2004.]]","journal-title":"Short signatures without random oracles. In EUROCRYPT"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","volume-title":"CRYPTO","author":"Boneh D.","year":"2004","unstructured":"D. Boneh , X. Boyen , and H. Shacham . Short group signatures using strong Diffie-Hellman . In CRYPTO , volume 3152 of LNCS , p. 41--55, 2004 .]] D. Boneh, X. Boyen, and H. Shacham. Short group signatures using strong Diffie-Hellman. In CRYPTO, volume 3152 of LNCS, p. 41--55, 2004.]]"},{"key":"e_1_3_2_1_7_1","first-page":"213","volume":"2139","author":"Boneh D.","year":"2001","unstructured":"D. Boneh and M. Franklin . Identity-based encryption from the Weil pairing. In CRYPTO , v. 2139 , p. 213 -- 229 , 2001 .]] D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In CRYPTO, v.2139, p. 213--229, 2001.]]","journal-title":"Identity-based encryption from the Weil pairing. In CRYPTO"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_31"},{"key":"e_1_3_2_1_10_1","volume-title":"Trustee-based tracing extensions to anonymous cash and the making of anonymous change","author":"Brickell E.","year":"1995","unstructured":"E. Brickell , P. Gemmel , and D. Kravitz . Trustee-based tracing extensions to anonymous cash and the making of anonymous change . In SIAM , p. 457--466, 1995 .]] E. Brickell, P. Gemmel, and D. Kravitz. Trustee-based tracing extensions to anonymous cash and the making of anonymous change. In SIAM, p. 457--466, 1995.]]"},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","volume-title":"ASIACRYPT","author":"Camenisch J.","year":"2000","unstructured":"J. Camenisch and I. Damg\u00e5rd . Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes . In ASIACRYPT , volume 1976 of LNCS , p. 331--345, 2000 .]] J. Camenisch and I. Damg\u00e5rd. Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes. In ASIACRYPT, volume 1976 of LNCS, p. 331--345, 2000.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_18"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11832072_10"},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","volume-title":"EUROCRYPT","author":"Camenisch J.","year":"2001","unstructured":"J. Camenisch and A. Lysyanskaya . Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation . In EUROCRYPT , volume 2045 of LNCS , p. 93--118, 2001 .]] J. Camenisch and A. Lysyanskaya. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In EUROCRYPT, volume 2045 of LNCS, p. 93--118, 2001.]]"},{"key":"e_1_3_2_1_15_1","first-page":"61","volume":"2442","author":"Camenisch J.","year":"2002","unstructured":"J. Camenisch and A. Lysyanskaya . Dynamic accumulators and application to efficient revocation of anonymous credentials. In CRYPTO , 2442 of LNCS, p. 61 -- 76 , 2002 .]] J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In CRYPTO, 2442 of LNCS, p. 61--76, 2002.]]","journal-title":"In CRYPTO"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1766811.1766838"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","volume-title":"ESORICS 96","author":"Camenisch J.","year":"1996","unstructured":"J. Camenisch , U. Maurer , and M. Stadler . Digital payment systems with passive anonymity-revoking trustees . In ESORICS 96 , volume 1146 of LNCS , p. 33--43, 1996 .]] J. Camenisch, U. Maurer, and M. Stadler. Digital payment systems with passive anonymity-revoking trustees. In ESORICS 96, volume 1146 of LNCS, p. 33--43, 1996.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_8"},{"key":"e_1_3_2_1_20_1","series-title":"LNCS","volume-title":"CRYPTO '99","author":"Camenisch J.","year":"1999","unstructured":"J. Camenisch and M. Michels . Separability and efficiency for generic group signature schemes . In CRYPTO '99 , volume 1666 of LNCS , p. 413--430, 1999 .]] J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In CRYPTO '99, volume 1666 of LNCS, p. 413--430, 1999.]]"},{"key":"e_1_3_2_1_21_1","series-title":"LNCS","volume-title":"CRYPTO '97","author":"Camenisch J.","year":"1997","unstructured":"J. Camenisch and M. Stadler . Efficient group signature schemes for large groups . In CRYPTO '97 , volume 1296 of LNCS , p. 410--424, 1997 .]] J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In CRYPTO '97, volume 1296 of LNCS, p. 410--424, 1997.]]"},{"key":"e_1_3_2_1_22_1","first-page":"561","volume-title":"EUROCRYPT, v. 1403","author":"Chan A.","year":"1998","unstructured":"A. Chan , Y. Frankel , and Y. Tsiounis . Easy come -- easy go divisible cash . In EUROCRYPT, v. 1403 , p. 561 -- 575 , 1998 .]] A. Chan, Y. Frankel, and Y. Tsiounis. Easy come -- easy go divisible cash. In EUROCRYPT, v. 1403, p. 561--575, 1998.]]"},{"key":"e_1_3_2_1_23_1","first-page":"199","volume-title":"CRYPTO '82","author":"Chaum D.","year":"1982","unstructured":"D. Chaum . Blind signatures for untraceable payments . In CRYPTO '82 , p. 199 -- 203 . Plenum Press , 1982 .]] D. Chaum. Blind signatures for untraceable payments. In CRYPTO '82, p. 199--203. Plenum Press, 1982.]]"},{"key":"e_1_3_2_1_24_1","first-page":"153","volume-title":"CRYPTO '83","author":"Chaum D.","year":"1983","unstructured":"D. Chaum . Blind signature systems . In CRYPTO '83 , p. 153 -- 156 . Plenum , 1983 .]] D. Chaum. Blind signature systems. In CRYPTO '83, p. 153--156. Plenum, 1983.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/4372.4373"},{"key":"e_1_3_2_1_26_1","series-title":"LNCS","volume-title":"CRYPTO","author":"Chaum D.","year":"1990","unstructured":"D. Chaum , A. Fiat , and M. Naor . Untraceable electronic cash . In CRYPTO , volume 403 of LNCS , p. 319--327, 1990 .]] D. Chaum, A. Fiat, and M. Naor. Untraceable electronic cash. In CRYPTO, volume 403 of LNCS, p. 319--327, 1990.]]"},{"key":"e_1_3_2_1_27_1","series-title":"LNCS","volume-title":"EUROCRYPT '91","author":"Chaum D.","year":"1991","unstructured":"D. Chaum and E. van Heyst . Group signatures . In EUROCRYPT '91 , volume 547 of LNCS , p. 257--265, 1991 .]] D. Chaum and E. van Heyst. Group signatures. In EUROCRYPT '91, volume 547 of LNCS, p. 257--265, 1991.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_20"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_33"},{"key":"e_1_3_2_1_30_1","series-title":"LNCS","volume-title":"CRYPTO","author":"Damg\u00e5rd I. B.","year":"1990","unstructured":"I. B. Damg\u00e5rd . Payment systems and credential mechanism with provable security against abuse by individuals . In CRYPTO , volume 403 of LNCS , p. 328--335, 1990 .]] I. B. Damg\u00e5rd. Payment systems and credential mechanism with provable security against abuse by individuals. In CRYPTO, volume 403 of LNCS, p. 328--335, 1990.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/648120.747056"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"e_1_3_2_1_33_1","series-title":"LNCS","volume-title":"CRYPTO","author":"Fiat A.","year":"1986","unstructured":"A. Fiat and A. Shamir . How to prove yourself: Practical solutions to identification and signature problems . In CRYPTO , volume 263 of LNCS , p. 186--194, 1986 .]] A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO, volume 263 of LNCS, p. 186--194, 1986.]]"},{"key":"e_1_3_2_1_34_1","series-title":"LNCS","volume-title":"CRYPTO '97","author":"Fujisaki E.","year":"1997","unstructured":"E. Fujisaki and T. Okamoto . Statistical zero knowledge protocols to prove modular polynomial relations . In CRYPTO '97 , volume 1294 of LNCS , p. 16--30, 1997 .]] E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO '97, volume 1294 of LNCS, p. 16--30, 1997.]]"},{"key":"e_1_3_2_1_35_1","series-title":"LNCS","volume-title":"ASIACRYPT","author":"Galbraith S. D.","year":"2001","unstructured":"S. D. Galbraith . Supersingular curves in cryptography . In ASIACRYPT , volume 2248 of LNCS , p. 495--513, 2001 .]] S. D. Galbraith. Supersingular curves in cryptography. In ASIACRYPT, volume 2248 of LNCS, p. 495--513, 2001.]]"},{"key":"e_1_3_2_1_36_1","series-title":"LNCS","volume-title":"EUROCRYPT","author":"Jarecki S.","year":"2004","unstructured":"S. Jarecki and V. Shmatikov . Handcuffing big brother: an abuse-resilient transaction escrow scheme . In EUROCRYPT , volume 3027 of LNCS , p. 590--608, 2004 .]] S. Jarecki and V. Shmatikov. Handcuffing big brother: an abuse-resilient transaction escrow scheme. In EUROCRYPT, volume 3027 of LNCS, p. 590--608, 2004.]]"},{"key":"e_1_3_2_1_37_1","first-page":"571","volume":"3027","author":"Kiayias A.","year":"2004","unstructured":"A. Kiayias , M. Yung , and Y. Tsiounis . Traceable signatures. In EUROCRYPT , vol. 3027 , p. 571 -- 589 , 2004 .]] A. Kiayias, M. Yung, and Y. Tsiounis. Traceable signatures. In EUROCRYPT, vol. 3027, p. 571--589, 2004.]]","journal-title":"Traceable signatures. In EUROCRYPT"},{"key":"e_1_3_2_1_39_1","first-page":"184","volume":"1758","author":"Lysyanskaya A.","year":"1999","unstructured":"A. Lysyanskaya , R. Rivest , A. Sahai , and S. Wolf . Pseudonym systems. In SAC , vol. 1758 , p. 184 -- 199 , 1999 .]] A. Lysyanskaya, R. Rivest, A. Sahai, and S. Wolf. Pseudonym systems. In SAC, vol. 1758, p. 184--199, 1999.]]","journal-title":"Pseudonym systems. In SAC"},{"key":"e_1_3_2_1_40_1","series-title":"LNCS","volume-title":"CT-RSA","author":"McCullagh N.","year":"2004","unstructured":"N. McCullagh and P. S. L. M. Barreto . A new two-party identity-based authenticated key agreement . In CT-RSA , volume 3376 of LNCS , p. 262--274, 2004 .]] N. McCullagh and P. S. L. M. Barreto. A new two-party identity-based authenticated key agreement. In CT-RSA, volume 3376 of LNCS, p. 262--274, 2004.]]"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02113297"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_22"},{"key":"e_1_3_2_1_43_1","series-title":"LNCS","volume-title":"CRYPTO","author":"Pedersen T. P.","year":"1992","unstructured":"T. P. Pedersen . Non-interactive and information-theoretic secure verifiable secret sharing . In CRYPTO , volume 576 of LNCS , p. 129--140, 1992 .]] T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO, volume 576 of LNCS, p. 129--140, 1992.]]"},{"key":"e_1_3_2_1_44_1","volume-title":"Authenticated ID-based key exchange and remote log-in with simple token and PIN number","author":"Scott M.","year":"2002","unstructured":"M. Scott . Authenticated ID-based key exchange and remote log-in with simple token and PIN number , 2002 . http:\/\/eprint.iacr.org\/2002\/164.]] M. Scott. Authenticated ID-based key exchange and remote log-in with simple token and PIN number, 2002. http:\/\/eprint.iacr.org\/2002\/164.]]"},{"key":"e_1_3_2_1_45_1","first-page":"256","volume-title":"LNCS","author":"Shoup V.","year":"1997","unstructured":"V. Shoup . Lower bounds for discrete logarithms and related problems. In EUROCRYPT , LNCS , p. 256 -- 266 , 1997 . Update : urlhttp:\/\/www.shoup.net\/papers\/.]] V. Shoup. Lower bounds for discrete logarithms and related problems. In EUROCRYPT , LNCS, p. 256--266, 1997. Update: urlhttp:\/\/www.shoup.net\/papers\/.]]"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_3_2_1_47_1","series-title":"LNCS","volume-title":"Asiacrypt","author":"Teranishi I.","year":"2004","unstructured":"I. Teranishi , J. Furukawa , and K. Sako . k-times anonymous authentication (extended abstract) . In Asiacrypt , volume 3329 of LNCS , p. 308--322, 2004 .]] I. Teranishi, J. Furukawa, and K. Sako. k-times anonymous authentication (extended abstract). In Asiacrypt, volume 3329 of LNCS, p. 308--322, 2004.]]"}],"event":{"name":"CCS06: 13th ACM Conference on Computer and Communications Security 2006","location":"Alexandria Virginia USA","acronym":"CCS06","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 13th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1180405.1180431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T09:16:30Z","timestamp":1673082990000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1180405.1180431"}},"subtitle":["efficient periodic n-times anonymous authentication"],"short-title":[],"issued":{"date-parts":[[2006,10,30]]},"references-count":44,"alternative-id":["10.1145\/1180405.1180431","10.1145\/1180405"],"URL":"https:\/\/doi.org\/10.1145\/1180405.1180431","relation":{},"subject":[],"published":{"date-parts":[[2006,10,30]]},"assertion":[{"value":"2006-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}