{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:50:22Z","timestamp":1775145022440,"version":"3.50.1"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["216483"],"award-info":[{"award-number":["216483"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2012,3]]},"abstract":"<jats:p>We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves upon existing approaches, which suffer from a linear number of modular exponentiations in the total number of attributes. This limitation makes them unfit for many practical applications, such as electronic identity cards. Our novel approach can incorporate a large number of binary and finite-set attributes without significant performance impact. It compresses all such attributes into a single attribute base and, thus, boosts the efficiency of all proofs of possession. The core idea is to encode discrete binary and finite-set values as prime numbers. We then use the divisibility property for efficient proofs of their presence or absence. In addition, we contribute efficient methods for conjunctions and disjunctions. The system builds on the strong RSA assumption. We demonstrate the aptness of our method in realistic application scenarios, notably electronic identity cards, and show its advantages for small devices, such as smartcards and cell phones.<\/jats:p>","DOI":"10.1145\/2133375.2133379","type":"journal-article","created":{"date-parts":[[2012,3,27]],"date-time":"2012-03-27T15:17:31Z","timestamp":1332861451000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Efficient Attributes for Anonymous Credentials"],"prefix":"10.1145","volume":"15","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[{"name":"IBM Research--Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Gro\u00df","sequence":"additional","affiliation":[{"name":"IBM Research--Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,3]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Ateniese G. Camenisch J. Joye M. and \n      Tsudik G\n  . \n  2000\n  . A practical and provably secure coalition-resistant group signature scheme. In Advances in Cryptology (CRYPTO). M. Bellare Ed. Lecture Notes in Computer Science vol. \n  1880\n  . \n  Springer Verlag 255--270. Ateniese G. Camenisch J. Joye M. and Tsudik G. 2000. A practical and provably secure coalition-resistant group signature scheme. In Advances in Cryptology (CRYPTO) . M. Bellare Ed. Lecture Notes in Computer Science vol. 1880. Springer Verlag 255--270.","DOI":"10.1007\/3-540-44598-6_16"},{"key":"e_1_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Bari\u0107 N.\n     and \n      Pfitzmann B\n  . \n  1997\n  . Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology (EUROCRYPT). W. Fumy Ed. Lecture Notes in Computer Science vol. \n  1233\n  . \n  Springer Verlag 480--494. Bari\u0107 N. and Pfitzmann B. 1997. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology (EUROCRYPT) . W. Fumy Ed. Lecture Notes in Computer Science vol. 1233. Springer Verlag 480--494.","DOI":"10.1007\/3-540-69053-0_33"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653734"},{"key":"e_1_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Boneh D. Boyen X. and \n      Shacham H\n  . \n  2004\n  . Short group signatures. In Advances in Cryptology (CRYPTO). M. K. Franklin Ed. Lecture Notes in Computer Science vol. \n  3152\n  . \n  Springer Verlag 41--55. Boneh D. Boyen X. and Shacham H. 2004. Short group signatures. In Advances in Cryptology (CRYPTO) . M. K. Franklin Ed. Lecture Notes in Computer Science vol. 3152. Springer Verlag 41--55.","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"e_1_2_2_5_1","volume-title":"Advances in Cryptology (EUROCRYPT)","author":"Boudot F.","unstructured":"Boudot , F. 2000. Efficient proofs that a committed number lies in an interval . In Advances in Cryptology (EUROCRYPT) . B. Preneel Ed., Lecture Notes in Computer Science, vol. 1807 . Springer Verlag , 431--444. Boudot, F. 2000. Efficient proofs that a committed number lies in an interval. In Advances in Cryptology (EUROCRYPT). B. Preneel Ed., Lecture Notes in Computer Science, vol. 1807. Springer Verlag, 431--444."},{"key":"e_1_2_2_6_1","unstructured":"Brands S. 1993. An efficient off-line electronic cash system based on the representation problem. Tech. rep. CS-R9323 CWI. Brands S. 1993. An efficient off-line electronic cash system based on the representation problem. Tech. rep. CS-R9323 CWI."},{"key":"e_1_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Brands S. 1995a. Restrictive blinding of secret-key certificates. Tech. rep. CS-R9509 CWI. Brands S. 1995a. Restrictive blinding of secret-key certificates. Tech. rep. CS-R9509 CWI.","DOI":"10.1007\/3-540-49264-X_19"},{"key":"e_1_2_2_8_1","unstructured":"Brands S. 1995b. Secret-key certificates. Tech. rep. CS-R9510 CWI. Brands S. 1995b. Secret-key certificates. Tech. rep. CS-R9510 CWI."},{"key":"e_1_2_2_9_1","volume-title":"Advances in Cryptology (EUROCRYPT)","author":"Brands S.","unstructured":"Brands , S. 1997. Rapid demonstration of linear relations connected by boolean operators . In Advances in Cryptology (EUROCRYPT) . W. Fumy Ed., Lecture Notes in Computer Science, vol. 1233 . Springer Verlag , 318--333. Brands, S. 1997. Rapid demonstration of linear relations connected by boolean operators. In Advances in Cryptology (EUROCRYPT). W. Fumy Ed., Lecture Notes in Computer Science, vol. 1233. Springer Verlag, 318--333."},{"key":"e_1_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Camenisch J.\n     and \n      Stadler M\n  . \n  1997\n  . Efficient group signature schemes for large groups. In Advances in Cryptology (CRYPTO). B. Kaliski Ed. Lecture Notes in Computer Science vol. \n  1296\n  . \n  Springer Verlag 410--424. Camenisch J. and Stadler M. 1997. Efficient group signature schemes for large groups. In Advances in Cryptology (CRYPTO) . B. Kaliski Ed. Lecture Notes in Computer Science vol. 1296. Springer Verlag 410--424.","DOI":"10.1007\/BFb0052252"},{"key":"e_1_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Camenisch J.\n     and \n      Michels M\n  . \n  1999\n  . Proving in zero-knowledge that a number n is the product of two safe primes. In Advances in Cryptology (EUROCRYPT). J. Stern Ed. Lecture Notes in Computer Science vol. \n  1592\n  . \n  Springer Verlag 107--122. Camenisch J. and Michels M. 1999. Proving in zero-knowledge that a number n is the product of two safe primes. In Advances in Cryptology (EUROCRYPT) . J. Stern Ed. Lecture Notes in Computer Science vol. 1592. Springer Verlag 107--122.","DOI":"10.1007\/3-540-48910-X_8"},{"key":"e_1_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Camenisch J.\n     and \n      Lysyanskaya A\n  . \n  2001\n  . Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In Advances in Cryptology (EUROCRYPT). B. Pfitzmann Ed. Lecture Notes in Computer Science vol. \n  2045\n  . \n  Springer Verlag 93--118. Camenisch J. and Lysyanskaya A. 2001. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In Advances in Cryptology (EUROCRYPT) . B. Pfitzmann Ed. Lecture Notes in Computer Science vol. 2045. Springer Verlag 93--118.","DOI":"10.1007\/3-540-44987-6_7"},{"key":"e_1_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Camenisch J.\n     and \n      Lysyanskaya A\n  . \n  2002\n  . Dynamic accumulators and application to efficient revocation of anonymous credentials. In Advances in Cryptology (CRYPTO). M. Yung Ed. Lecture Notes in Computer Science vol. \n  2442\n  . \n  Springer Verlag 61--76. Camenisch J. and Lysyanskaya A. 2002. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Advances in Cryptology (CRYPTO) . M. Yung Ed. Lecture Notes in Computer Science vol. 2442. Springer Verlag 61--76.","DOI":"10.1007\/3-540-45708-9_5"},{"key":"e_1_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Camenisch J.\n     and \n      Lysyanskaya A\n  . \n  2003\n  . A signature scheme with efficient protocols. In Proceedings of the 3rd International Conference on Security in Communication Networks (SCN\u201902). S. Cimato C. Galdi and G. Persiano Eds. Lecture Notes in Computer Science vol. \n  2576\n  . \n  Springer Verlag 268--289. Camenisch J. and Lysyanskaya A. 2003. A signature scheme with efficient protocols. In Proceedings of the 3rd International Conference on Security in Communication Networks (SCN\u201902) . S. Cimato C. Galdi and G. Persiano Eds. Lecture Notes in Computer Science vol. 2576. Springer Verlag 268--289.","DOI":"10.1007\/3-540-36413-7_20"},{"key":"e_1_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Camenisch J.\n     and \n      Lysyanskaya A\n  . \n  2004\n  . Signature schemes and anonymous credentials from bilinear maps. In Advances in Cryptology (CRYPTO). M. K. Franklin Ed. Lecture Notes in Computer Science vol. \n  3152\n  . \n  Springer Verlag 56--72. Camenisch J. and Lysyanskaya A. 2004. Signature schemes and anonymous credentials from bilinear maps. In Advances in Cryptology (CRYPTO) . M. K. Franklin Ed. Lecture Notes in Computer Science vol. 3152. Springer Verlag 56--72.","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"e_1_2_2_18_1","volume-title":"Archive Report 2010\/496, IACR. http:\/\/eprint.iacr.org\/.","author":"Camenisch J.","year":"2011","unstructured":"Camenisch , J. and Gro\u00df , T . 2011 . Efficient attributes for anonymous credentials (extended version). Cryptology ePrint Archive Report 2010\/496, IACR. http:\/\/eprint.iacr.org\/. Camenisch, J. and Gro\u00df, T. 2011. Efficient attributes for anonymous credentials (extended version). Cryptology ePrint Archive Report 2010\/496, IACR. http:\/\/eprint.iacr.org\/."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_18"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180431"},{"key":"e_1_2_2_21_1","unstructured":"Camenisch J. Gro\u00df T. and Scott-Heydt Benjamin T. 2011. Efficient tight interval proofs with Camenisch-Gro\u00df encoding. IBM Res. rep. RZ 3800 IBM Research Division. Camenisch J. Gro\u00df T. and Scott-Heydt Benjamin T. 2011. Efficient tight interval proofs with Camenisch-Gro\u00df encoding. IBM Res. rep. RZ 3800 IBM Research Division."},{"key":"e_1_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Chan A. Frankel Y. and \n      Tsiounis Y\n  . \n  1998\n  . Easy come---easy go divisible cash. In Advances in Cryptology (EUROCRYPT). K. Nyberg Ed. Lecture Notes in Computer Science vol. \n  1403\n  . \n  Springer Verlag 561--575. Chan A. Frankel Y. and Tsiounis Y. 1998. Easy come---easy go divisible cash. In Advances in Cryptology (EUROCRYPT) . K. Nyberg Ed. Lecture Notes in Computer Science vol. 1403. Springer Verlag 561--575.","DOI":"10.1007\/BFb0054154"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_2_2_25_1","volume-title":"Advances in Cryptology (CRYPTO)","author":"Chaum D.","unstructured":"Chaum , D. 1983. Blind signatures for untraceable payments . In Advances in Cryptology (CRYPTO) . D. Chaum, R. L. Rivest, and A. T. Sherman Eds., Plenum Press , 199--203. Chaum, D. 1983. Blind signatures for untraceable payments. In Advances in Cryptology (CRYPTO). D. Chaum, R. L. Rivest, and A. T. Sherman Eds., Plenum Press, 199--203."},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/4372.4373"},{"key":"e_1_2_2_27_1","series-title":"Lecture Notes in Computer Science","volume-title":"-H","author":"Chaum D.","year":"1987","unstructured":"Chaum , D. and Evertse , J . -H . 1987 . A secure and privacy-protecting protocol for transmitting personal information between organizations. In Advances in Cryptology (CRYPTO). M. Odlyzko Ed., Lecture Notes in Computer Science , vol. 263 . Springer Verlag , 118--167. Chaum, D. and Evertse, J.-H. 1987. A secure and privacy-protecting protocol for transmitting personal information between organizations. In Advances in Cryptology (CRYPTO). M. Odlyzko Ed., Lecture Notes in Computer Science, vol. 263. Springer Verlag, 118--167."},{"key":"e_1_2_2_28_1","volume-title":"Advances in Cryptology (EUROCRYPT)","author":"Chaum D.","unstructured":"Chaum , D. and van Heyst , E. 1991. Group signatures . In Advances in Cryptology (EUROCRYPT) . D. W. Davies Ed., Lecture Notes in Computer Science, vol. 547 . Springer Verlag , 257--265. Chaum, D. and van Heyst, E. 1991. Group signatures. In Advances in Cryptology (EUROCRYPT). D. W. Davies Ed., Lecture Notes in Computer Science, vol. 547. Springer Verlag, 257--265."},{"key":"e_1_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Chaum D.\n     and \n      Pedersen T. P\n  . \n  1993\n  . Wallet databases with observers. In Advances in Cryptology (CRYPTO). E. F. Brickell Ed. Lecture Notes in Computer Science vol. \n  740\n  . \n  Springer Verlag 89--105. Chaum D. and Pedersen T. P. 1993. Wallet databases with observers. In Advances in Cryptology (CRYPTO) . E. F. Brickell Ed. Lecture Notes in Computer Science vol. 740. Springer Verlag 89--105.","DOI":"10.1007\/3-540-48071-4_7"},{"key":"e_1_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Cramer R. Damg\u00e5rd I. and \n      Schoenmakers B\n  . \n  1994\n  . Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology (CRYPTO). Y. G. Desmedt Ed. Lecture Notes in Computer Science vol. \n  839\n  . \n  Springer Verlag 174--187. Cramer R. Damg\u00e5rd I. and Schoenmakers B. 1994. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology (CRYPTO) . Y. G. Desmedt Ed. Lecture Notes in Computer Science vol. 839. Springer Verlag 174--187.","DOI":"10.1007\/3-540-48658-5_19"},{"key":"e_1_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I. and Fujisaki E. 2001. An integer commitment scheme based on groups with hidden order. http:\/\/eprint.iacr.org\/2001. Damg\u00e5rd I. and Fujisaki E. 2001. An integer commitment scheme based on groups with hidden order. http:\/\/eprint.iacr.org\/2001.","DOI":"10.1007\/3-540-36178-2_8"},{"key":"e_1_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Fiat A.\n     and \n      Shamir A\n  . \n  1987\n  . How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology (CRYPTO). A. M. Odlyzko Ed. Lecture Notes in Computer Science vol. \n  263\n  . \n  Springer Verlag 186--194. Fiat A. and Shamir A. 1987. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology (CRYPTO) . A. M. Odlyzko Ed. Lecture Notes in Computer Science vol. 263. Springer Verlag 186--194.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"e_1_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Frankel Y. Tsiounis Y. and \n      Yung M\n  . \n  1998\n  . Fair off-line e-cash made easy. In Advances in Cryptology (ASIACRYPT). K. Kim and T. Matsumoto Eds. Lecture Notes in Computer Science vol. \n  1514\n  . \n  Springer Verlag 257--270. Frankel Y. Tsiounis Y. and Yung M. 1998. Fair off-line e-cash made easy. In Advances in Cryptology (ASIACRYPT) . K. Kim and T. Matsumoto Eds. Lecture Notes in Computer Science vol. 1514. Springer Verlag 257--270.","DOI":"10.1007\/3-540-49649-1_21"},{"key":"e_1_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Fujioka A. Okamoto T. and \n      Ohta K\n  . \n  1992\n  . A practical secret voting scheme for large scale elections. In Advances in Cryptology (ASIACRYPT). J. Seberry and Y. Zheng Eds. Lecture Notes in Computer Science vol. \n  718\n  . \n  Springer 244--251. Fujioka A. Okamoto T. and Ohta K. 1992. A practical secret voting scheme for large scale elections. In Advances in Cryptology (ASIACRYPT) . J. Seberry and Y. Zheng Eds. Lecture Notes in Computer Science vol. 718. Springer 244--251.","DOI":"10.1007\/3-540-57220-1_66"},{"key":"e_1_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Fujisaki E.\n     and \n      Okamoto T\n  . \n  1997\n  . Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology (CRYPTO). B. Kaliski Ed. Lecture Notes in Computer Science vol. \n  1294\n  . \n  Springer Verlag 16--30. Fujisaki E. and Okamoto T. 1997. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology (CRYPTO) . B. Kaliski Ed. Lecture Notes in Computer Science vol. 1294. Springer Verlag 16--30.","DOI":"10.1007\/BFb0052225"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_2_2_37_1","unstructured":"IBM. 2010. Specification of the Identity Mixer cryptographic library v. 2.3.2. Specification IBM Research. http:\/\/prime.inf.tu-dresden.de\/idemix\/. IBM . 2010. Specification of the Identity Mixer cryptographic library v. 2.3.2. Specification IBM Research. http:\/\/prime.inf.tu-dresden.de\/idemix\/."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJSN.2006.010821"},{"key":"e_1_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Kiayias A. Yung M. and \n      Tsiounis Y\n  . \n  2004\n  . Traceable signatures. In Advances in Cryptology (EUROCRYPT). C. Cachin and J. Camenisch Eds. Lecture Notes in Computer Science vol. \n  3027\n  . \n  Springer 571--589. Kiayias A. Yung M. and Tsiounis Y. 2004. Traceable signatures. In Advances in Cryptology (EUROCRYPT) . C. Cachin and J. Camenisch Eds. Lecture Notes in Computer Science vol. 3027. Springer 571--589.","DOI":"10.1007\/978-3-540-24676-3_34"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80043-8"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_2_2_42_1","volume-title":"Advances in Cryptology (CRYPTO)","author":"Pedersen T. P.","unstructured":"Pedersen , T. P. 1992. Non-interactive and information-theoretic secure verifiable secret sharing . In Advances in Cryptology (CRYPTO) . J. Feigenbaum Ed., Lecture Notes in Computer Science, vol. 576 , Springer Verlag , 129--140. Pedersen, T. P. 1992. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology (CRYPTO). J. Feigenbaum Ed., Lecture Notes in Computer Science, vol. 576, Springer Verlag, 129--140."},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(80)90084-0"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160390713"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"e_1_2_2_46_1","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"Shoup V.","unstructured":"Shoup , V. 2008. A Computational Introduction to Number Theory and Algebra 2 nd Ed. Cambridge University Press . http:\/\/www.shoup.net\/ntb\/. Shoup, V. 2008. A Computational Introduction to Number Theory and Algebra 2nd Ed. Cambridge University Press. http:\/\/www.shoup.net\/ntb\/.","edition":"2"},{"key":"e_1_2_2_47_1","unstructured":"SPF Int\u00e9rieur. 2005. Instructions generales relatives \u00e0 la carte d\u2019indentit\u00e9 \u00e9lectronique. SPF Int\u00e9rieur Service Registres de la Population et Cartes d\u2019identit\u00e9 Bruxelles. http:\/\/www.registrenational.fgov.be. SPF Int\u00e9rieur . 2005. Instructions generales relatives \u00e0 la carte d\u2019indentit\u00e9 \u00e9lectronique . SPF Int\u00e9rieur Service Registres de la Population et Cartes d\u2019identit\u00e9 Bruxelles. http:\/\/www.registrenational.fgov.be."},{"key":"e_1_2_2_48_1","volume-title":"International Statistical Classification of Diseases and Health Related Problems (ICD-10)","author":"World Health Organization (WHO). 2005.","unstructured":"World Health Organization (WHO). 2005. International Statistical Classification of Diseases and Health Related Problems (ICD-10) . 2 nd Ed., 10th Rev. Ed. World Health Organization , Geneva. World Health Organization (WHO). 2005. International Statistical Classification of Diseases and Health Related Problems (ICD-10). 2nd Ed., 10th Rev. Ed. World Health Organization, Geneva.","edition":"2"}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2133375.2133379","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2133375.2133379","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:05Z","timestamp":1750241165000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2133375.2133379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["10.1145\/2133375.2133379"],"URL":"https:\/\/doi.org\/10.1145\/2133375.2133379","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"value":"1094-9224","type":"print"},{"value":"1557-7406","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]},"assertion":[{"value":"2009-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}