{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:04:10Z","timestamp":1767625450151,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T00:00:00Z","timestamp":1131321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,11,7]]},"DOI":"10.1145\/1102199.1102208","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:52:40Z","timestamp":1139241160000},"page":"40-46","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Anonymous yet accountable access control"],"prefix":"10.1145","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[{"name":"IBM Zurich Research Laboratory, R\u00fcschlikon, Switzerland"}]},{"given":"Jan","family":"Camenisch","sequence":"additional","affiliation":[{"name":"IBM Zurich Research Laboratory, R\u00fcschlikon, Switzerland"}]},{"given":"Dieter","family":"Sommer","sequence":"additional","affiliation":[{"name":"IBM Zurich Research Laboratory, R\u00fcschlikon, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2005,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Security Protocols","author":"Bangerter E.","year":"2004","unstructured":"Bangerter , E. , Camenisch , J. , and Lysyanskaya , A . A cryptographic framework for the controlled release of certified data . In Security Protocols 2004 , LNCS. ]] Bangerter, E., Camenisch, J., and Lysyanskaya, A. A cryptographic framework for the controlled release of certified data. In Security Protocols 2004, LNCS.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/603404.603407"},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","first-page":"431","volume-title":"EUROCRYPT","author":"Boudot F.","year":"2000","unstructured":"Boudot , F. Efficient proofs that a committed number lies in an interval . In EUROCRYPT 2000 , vol. 1807 of LNCS , Springer Verlag , pp. 431 -- 444 .]] Boudot, F. Efficient proofs that a committed number lies in an interval. In EUROCRYPT 2000, vol. 1807 of LNCS, Springer Verlag, pp. 431--444.]]"},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","first-page":"318","volume-title":"EUROCRYPT '97","author":"Brands S.","unstructured":"Brands , S. Rapid demonstration of linear relations connected by boolean operators . In EUROCRYPT '97 , vol. 1233 of LNCS , Springer Verlag , pp. 318 -- 333 .]] Brands, S. Rapid demonstration of linear relations connected by boolean operators. In EUROCRYPT '97, vol. 1233 of LNCS, Springer Verlag, pp. 318--333.]]"},{"key":"e_1_3_2_1_5_1","first-page":"120","volume-title":"SCN","author":"Camenisch J.","year":"2004","unstructured":"Camenisch , J. , and Groth , J . Group signatures: Better efficiency and new theoretical aspects . In SCN 2004 , pp. 120 -- 133 . LNCS, Springer Verlag.]] Camenisch, J., and Groth, J. Group signatures: Better efficiency and new theoretical aspects. In SCN 2004, pp. 120--133. LNCS, Springer Verlag.]]"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"93","volume-title":"EUROCRYPT","author":"Camenisch J.","year":"2001","unstructured":"Camenisch , J. , and Lysyanskaya , A . Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation . In EUROCRYPT 2001 , vol. 2045 of LNCS , Springer Verlag , pp. 93 -- 118 .]] Camenisch, J., and Lysyanskaya, A. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In EUROCRYPT 2001, vol. 2045 of LNCS, Springer Verlag, pp. 93--118.]]"},{"key":"e_1_3_2_1_7_1","series-title":"LNCS","first-page":"274","volume-title":"SCN","author":"Camenisch J.","year":"2002","unstructured":"Camenisch , J. , and Lysyanskaya , A . A signature scheme with efficient protocols . In SCN 2002 , vol. 2576 of LNCS , Springer Verlag , pp. 274 -- 295 .]] Camenisch, J., and Lysyanskaya, A. A signature scheme with efficient protocols. In SCN 2002, vol. 2576 of LNCS, Springer Verlag, pp. 274--295.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","volume-title":"EUROCRYPT '99","author":"Camenisch J.","unstructured":"Camenisch , J. , and Michels , M . Proving in zero-knowledge that a number n is the product of two safe primes . In EUROCRYPT '99 , vol. 1592 of LNCS .]] Camenisch, J., and Michels, M. Proving in zero-knowledge that a number n is the product of two safe primes. In EUROCRYPT '99, vol. 1592 of LNCS.]]"},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","first-page":"413","volume-title":"CRYPTO '99","author":"Camenisch J.","unstructured":"Camenisch , J. , and Michels , M . Separability and efficiency for generic group signature schemes . In CRYPTO '99 , vol. 1666 of LNCS , Springer Verlag , pp. 413 -- 430 .]] Camenisch, J., and Michels, M. Separability and efficiency for generic group signature schemes. In CRYPTO '99, vol. 1666 of LNCS, Springer Verlag, pp. 413--430.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"e_1_3_2_1_13_1","series-title":"LNCS","first-page":"561","volume-title":"EUROCRYPT '98","author":"Chan A.","unstructured":"Chan , A. , Frankel , Y. , and Tsiounis , Y . Easy come -- easy go divisible cash . In EUROCRYPT '98 , vol. 1403 of LNCS , Springer Verlag , pp. 561 -- 575 .]] Chan, A., Frankel, Y., and Tsiounis, Y. Easy come -- easy go divisible cash. In EUROCRYPT '98, vol. 1403 of LNCS, Springer Verlag, pp. 561--575.]]"},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","first-page":"89","volume-title":"CRYPTO '92","author":"Chaum D.","unstructured":"Chaum , D. , and Pedersen , T. P . Wallet databases with observers . In CRYPTO '92 , vol. 740 of LNCS , Springer-Verlag , pp. 89 -- 105 .]] Chaum, D., and Pedersen, T. P. Wallet databases with observers. In CRYPTO '92, vol. 740 of LNCS, Springer-Verlag, pp. 89--105.]]"},{"key":"e_1_3_2_1_15_1","series-title":"LNCS","first-page":"174","volume-title":"CRYPTO '94","author":"Cramer R.","unstructured":"Cramer , R. , Damgaard , I. , and Schoenmakers , B . Proofs of partial knowledge and simplified design of witness hiding protocols . In CRYPTO '94 , vol. 839 of LNCS , Springer Verlag , pp. 174 -- 187 .]] Cramer, R., Damgaard, I., and Schoenmakers, B. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO '94, vol. 839 of LNCS, Springer Verlag, pp. 174--187.]]"},{"key":"e_1_3_2_1_16_1","series-title":"LNCS","first-page":"431","volume-title":"EUROCRYPT","author":"Damgaard I.","year":"2000","unstructured":"Damgaard , I. Efficient concurrent zero-knowledge in the auxiliary string model . In EUROCRYPT 2000 , vol. 1807 of LNCS , Springer Verlag , pp. 431 -- 444 .]] Damgaard, I. Efficient concurrent zero-knowledge in the auxiliary string model. In EUROCRYPT 2000, vol. 1807 of LNCS, Springer Verlag, pp. 431--444.]]"},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","volume-title":"ASIACRYPT","author":"Damgaard I.","year":"2002","unstructured":"Damgaard , I. , and Fujisaki , E . An integer commitment scheme based on groups with hidden order . In ASIACRYPT 2002 , vol. 2501 of LNCS .]] Damgaard, I., and Fujisaki, E. An integer commitment scheme based on groups with hidden order. In ASIACRYPT 2002, vol. 2501 of LNCS.]]"},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","first-page":"307","volume-title":"CRYPTO '89","author":"Desmedt Y.","unstructured":"Desmedt , Y. , and Frankel , Y . Threshold cryptography . In CRYPTO '89 , vol. 435 of LNCS , pp. 307 -- 315 .]] Desmedt, Y., and Frankel, Y. Threshold cryptography. In CRYPTO '89, vol. 435 of LNCS, pp. 307--315.]]"},{"key":"e_1_3_2_1_19_1","volume-title":"Official Journal of the European Communities 31","author":"European Parliament","year":"1995","unstructured":"European Parliament . Directive 95\/46\/ec on the protection of individuals with regard to the processing of personal data and on the free movement of such data. Official Journal of the European Communities 31 ( 1995 ).]] European Parliament. Directive 95\/46\/ec on the protection of individuals with regard to the processing of personal data and on the free movement of such data. Official Journal of the European Communities 31 (1995).]]"},{"key":"e_1_3_2_1_20_1","volume-title":"Apr.","author":"Farrell S.","year":"2002","unstructured":"Farrell , S. , and Housley , R . An Internet Attribute Certificate Profile for Authorization. RFC 3281 (Proposed Standard) , Apr. 2002 .]] Farrell, S., and Housley, R. An Internet Attribute Certificate Profile for Authorization. RFC 3281 (Proposed Standard), Apr. 2002.]]"},{"key":"e_1_3_2_1_21_1","series-title":"LNCS","first-page":"16","volume-title":"CRYPTO '97","author":"Fujisaki E.","unstructured":"Fujisaki , E. , and Okamoto , T . Statistical zero knowledge protocols to prove modular polynomial relations . In CRYPTO '97 , vol. 1294 of LNCS , pp. 16 -- 30 .]] Fujisaki, E., and Okamoto, T. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO '97, vol. 1294 of LNCS, pp. 16--30.]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_1_23_1","volume-title":"Apr.","author":"Housley R.","year":"2002","unstructured":"Housley , R. , Polk , W. , Ford , W. , and Solo , D . Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile. RFC 3280 (Proposed Standard) , Apr. 2002 .]] Housley, R., Polk, W., Ford, W., and Solo, D. Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile. RFC 3280 (Proposed Standard), Apr. 2002.]]"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. IEEE Symposium on Security and Privacy","author":"Li N.","year":"2002","unstructured":"Li , N. , Mitchell , J. C. , and Winsborough , W. H . Design of a role-based trust management framework . In Proc. IEEE Symposium on Security and Privacy ( 2002 ).]] Li, N., Mitchell, J. C., and Winsborough, W. H. Design of a role-based trust management framework. In Proc. IEEE Symposium on Security and Privacy (2002).]]"},{"key":"e_1_3_2_1_25_1","series-title":"LNCS","first-page":"129","volume-title":"CRYPTO '91","author":"Pedersen T. P.","unstructured":"Pedersen , T. P. Non-interactive and information-theoretic secure verifiable secret sharing . In CRYPTO '91 , vol. 576 of LNCS , Springer Verlag , pp. 129 -- 140 .]] Pedersen, T. P. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO '91, vol. 576 of LNCS, Springer Verlag, pp. 129--140.]]"},{"key":"e_1_3_2_1_26_1","unstructured":"Prime whitepaper. Whitepaper 18 July 2005. https:\/\/linproxy.fan.workers.dev:443\/http\/www.prime-project.eu.org\/prime\/public\/press_room\/whitepaper\/PRI%ME-Whitepaper-V1.pdf.]]  Prime whitepaper. Whitepaper 18 July 2005. https:\/\/linproxy.fan.workers.dev:443\/http\/www.prime-project.eu.org\/prime\/public\/press_room\/whitepaper\/PRI%ME-Whitepaper-V1.pdf.]]"},{"key":"e_1_3_2_1_27_1","unstructured":"Samarati P. June 2005. Personal communication.]]  Samarati P. June 2005. Personal communication.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365745"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/352600.352633"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502004"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/605434.605435"}],"event":{"name":"CCS05: 12th ACM Conference on Computer and Communications Security 2005","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"],"location":"Alexandria VA USA","acronym":"CCS05"},"container-title":["Proceedings of the 2005 ACM workshop on Privacy in the electronic society"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/1102199.1102208","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/1102199.1102208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:08Z","timestamp":1750262888000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/1102199.1102208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,7]]},"references-count":31,"alternative-id":["10.1145\/1102199.1102208","10.1145\/1102199"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/1102199.1102208","relation":{},"subject":[],"published":{"date-parts":[[2005,11,7]]},"assertion":[{"value":"2005-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}