{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:10Z","timestamp":1750307290402,"version":"3.41.0"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["0937060CNS-1010928CNS-0716142"],"award-info":[{"award-number":["0937060CNS-1010928CNS-0716142"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000180","name":"U.S. Department of Homeland Security","doi-asserted-by":"publisher","award":["FA8750-08-2-0147"],"award-info":[{"award-number":["FA8750-08-2-0147"]}],"id":[{"id":"10.13039\/100000180","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000016","name":"U.S. Department of Health and Human Services","doi-asserted-by":"publisher","award":["90TR0003\/01"],"award-info":[{"award-number":["90TR0003\/01"]}],"id":[{"id":"10.13039\/100000016","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":[[2011,5]]},"abstract":"<jats:p>\n            The use of privacy-enhancing cryptographic protocols, such as anonymous credentials and oblivious transfer, could have a detrimental effect on the ability of providers to effectively implement access controls on their content. In this article, we propose a\n            <jats:italic>stateful anonymous credential<\/jats:italic>\n            system that allows the provider to implement nontrivial, real-world access controls on oblivious protocols conducted with anonymous users. Our system models the behavior of users as a state machine and embeds that state within an anonymous credential to restrict access to resources based on the state information. The use of state machine models of user behavior allows the provider to restrict the users' actions according to a wide variety of access control models without learning anything about the users' identities or actions. Our system is secure in the standard model under basic assumptions and, after an initial setup phase, each transaction requires only constant time. As a concrete example, we show how to implement the Brewer--Nash (Chinese Wall) and Bell-La Padula (Multilevel Security) access control models within our credential system. Furthermore, we combine our credential system with an adaptive oblivious transfer scheme to create a privacy-friendly oblivious database with strong access controls.\n          <\/jats:p>","DOI":"10.1145\/1952982.1952992","type":"journal-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:51:38Z","timestamp":1307361098000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Access controls for oblivious and anonymous systems"],"prefix":"10.1145","volume":"14","author":[{"given":"Scott E.","family":"Coull","sequence":"first","affiliation":[{"name":"RedJack"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Green","sequence":"additional","affiliation":[{"name":"Johns Hopkins University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susan","family":"Hohenberger","sequence":"additional","affiliation":[{"name":"Johns Hopkins University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Aiello W. Ishai Y. and \n      \n      \n      Reingold O\n      \n  \n  . \n  2001\n  . Priced oblivious transfer: How to sell digital goods. In Advances in Cryptology (EUROCRYPT'01) Lecture Notes in Computer Science vol. \n  2045 Springer Berlin 119--135.   Aiello W. Ishai Y. and Reingold O. 2001. Priced oblivious transfer: How to sell digital goods. In Advances in Cryptology (EUROCRYPT'01) Lecture Notes in Computer Science vol. 2045 Springer Berlin 119--135.","DOI":"10.1007\/3-540-44987-6_8"},{"key":"e_1_2_1_2_1","unstructured":"Bell D. E. and Padula L. J. L. 1988. Secure computer system: Unified exposition and Multics interpretation. MITRE Corp. Bedford MA.  Bell D. E. and Padula L. J. L. 1988. Secure computer system: Unified exposition and Multics interpretation. MITRE Corp. Bedford MA."},{"key":"e_1_2_1_3_1","unstructured":"Biba K. J. 1977. Integrity considerations for secure computer systems. Tech. rep. ESD-TR-76-372 MITRE Corp. Bedford MA.  Biba K. J. 1977. Integrity considerations for secure computer systems. Tech. rep. ESD-TR-76-372 MITRE Corp. Bedford MA."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Blake I. F.\n     and \n      \n      \n      Kolesnikov V\n      \n  \n  . \n  2004\n  . Strong Conditional Oblivious Transfer and Computing on Intervals. In Advances in Cryptology (ASIACRYPT'04) Lecture Notes in Computer Science vol. \n  3329 Springer Berlin 515--529.  Blake I. F. and Kolesnikov V. 2004. Strong Conditional Oblivious Transfer and Computing on Intervals. In Advances in Cryptology (ASIACRYPT'04) Lecture Notes in Computer Science vol. 3329 Springer Berlin 515--529.","DOI":"10.1007\/978-3-540-30539-2_36"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Boneh D.\n     and \n      \n      \n      Boyen X\n      \n  \n  . \n  2004\n  . Short signatures without random oracles. In Advances in Cryptology (EUROCRYPT'04) Lecture Notes in Computer Science vol. \n  3027 Springer Berlin 56--73.  Boneh D. and Boyen X. 2004. Short signatures without random oracles. In Advances in Cryptology (EUROCRYPT'04) Lecture Notes in Computer Science vol. 3027 Springer Berlin 56--73.","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Boneh D. Boyen X. and \n      \n      \n      Shacham H\n      \n  \n  . \n  2004\n  . Short group signatures. In Advances in Cryptology (CRYPTO'04) Lecture Notes in Computer Science vol. \n  3152 Springer Berlin 227--242.  Boneh D. Boyen X. and Shacham H. 2004. Short group signatures. In Advances in Cryptology (CRYPTO'04) Lecture Notes in Computer Science vol. 3152 Springer Berlin 227--242.","DOI":"10.1007\/978-3-540-28628-8_3"},{"volume-title":"Advances in Cryptology (EUROCRYPT'00)","series-title":"Lecture Notes in Computer Science","author":"Boudot F.","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754542.1754572"},{"volume-title":"Proceedings of the IEEE Symposium on Security and Privacy. IEEE","author":"Brewer D. F. C.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/647096.716992"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653679"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_8"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180431"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_18"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11832072_10"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Camenisch J.\n     and \n      \n      \n      Lysyanskaya A\n      \n  \n  . \n  2001\n  . Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In Advances in Cryptology (EUROCRYPT'01) Lecture Notes in Computer Science vol. \n  2045 Springer Berlin 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'01) Lecture Notes in Computer Science vol. 2045 Springer Berlin 93--118.","DOI":"10.1007\/3-540-44987-6_7"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Camenisch J.\n     and \n      \n      \n      Lysyanskaya A\n      \n  \n  . \n  2003\n  . A signature scheme with efficient protocols. In Security in Communication Networks Lecture Notes in Computer Science vol. \n  2576 Springer Berlin 268--289.   Camenisch J. and Lysyanskaya A. 2003. A signature scheme with efficient protocols. In Security in Communication Networks Lecture Notes in Computer Science vol. 2576 Springer Berlin 268--289.","DOI":"10.1007\/3-540-36413-7_20"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Camenisch J.\n     and \n      \n      \n      Lysyanskaya A\n      \n  \n  . \n  2004\n  . Signature schemes and anonymous credentials from bilinear maps. In Advances in Cryptology (CRYPTO'04) Lecture Notes in Computer Science vol. \n  3152 Springer Berlin 56--72.  Camenisch J. and Lysyanskaya A. 2004. Signature schemes and anonymous credentials from bilinear maps. In Advances in Cryptology (CRYPTO'04) Lecture Notes in Computer Science vol. 3152 Springer Berlin 56--72.","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Camenisch J.\n     and \n      \n      \n      Michels M\n      \n  \n  . \n  1999\n  a. Proving in zero-knowledge that a number n is the product of two safe primes. In Advances in Cryptology (EUROCRYPT'99) Lecture Notes in Computer Science vol. \n  1592 Springer Berlin 107--122.   Camenisch J. and Michels M. 1999a. Proving in zero-knowledge that a number n is the product of two safe primes. In Advances in Cryptology (EUROCRYPT'99) Lecture Notes in Computer Science vol. 1592 Springer Berlin 107--122.","DOI":"10.1007\/3-540-48910-X_8"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Camenisch J.\n     and \n      \n      \n      Michels M\n      \n  \n  . \n  1999\n  b. Seperability and efficiency for generic group signature schemes. InAdvances in Cryptology (CRYPTO'99) Lecture Notes in Computer Science vol. \n  1666 Springer Berlin 413--430.   Camenisch J. and Michels M. 1999b. Seperability and efficiency for generic group signature schemes. InAdvances in Cryptology (CRYPTO'99) Lecture Notes in Computer Science vol. 1666 Springer Berlin 413--430.","DOI":"10.1007\/3-540-48405-1_27"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_33"},{"key":"e_1_2_1_22_1","unstructured":"Camenisch J. 1998. Group signature schemes and payment systems based on the discrete logarithm problem. Ph.D. dissertation ETH Zurich.  Camenisch J. 1998. Group signature schemes and payment systems based on the discrete logarithm problem. Ph.D. dissertation ETH Zurich."},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Chan A. Frankel Y. and \n      \n      \n      Tsiounis Y\n      \n  \n  . \n  1998\n  . Easy come-easy go divisible cash. In Advances in Cryptology (EUROCRYPT'98) Lecture Notes in Computer Science vol. \n  1403 Springer Berlin 561--575.  Chan A. Frankel Y. and Tsiounis Y. 1998. Easy come-easy go divisible cash. In Advances in Cryptology (EUROCRYPT'98) Lecture Notes in Computer Science vol. 1403 Springer Berlin 561--575.","DOI":"10.1007\/BFb0054154"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/4372.4373"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Chaum D.\n     and \n      \n      \n      Pedersen T. P\n      \n  \n  . \n  1992\n  . Wallet databases with observers. In Advances in Cryptology (CRYPTO'92) Lecture Notes in Computer Science vol. \n  740 Springer Berlin 89--105.   Chaum D. and Pedersen T. P. 1992. Wallet databases with observers. In Advances in Cryptology (CRYPTO'92) Lecture Notes in Computer Science vol. 740 Springer Berlin 89--105.","DOI":"10.1007\/3-540-48071-4_7"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"volume-title":"Proceedings of the IEEE Symposium on Security and Privacy. IEEE, Washington, D.C., 27--29","author":"Clark D. D.","key":"e_1_2_1_27_1"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/648117.746604"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Cramer R. Damgard I. and \n      \n      \n      Schoenmakers B\n      \n  \n  . \n  1994\n  . Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology (CRYPTO'94) Lecture Notes in Computer Science vol. \n  839 Springer Berlin 174--187.   Cramer R. Damgard I. and Schoenmakers B. 1994. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology (CRYPTO'94) Lecture Notes in Computer Science vol. 839 Springer Berlin 174--187.","DOI":"10.1007\/3-540-48658-5_19"},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Crescenzo G. D. Ostrovsky R. and \n      \n      \n      Rajagopolan S\n      \n  \n  . \n  1999\n  . Conditional oblivious transfer and time released encryption. In Advances in Cryptology (EUROCRYPT'99) Lecture Notes in Computer Science vol. \n  1592 Springer Berlin 74--89.   Crescenzo G. D. Ostrovsky R. and Rajagopolan S. 1999. Conditional oblivious transfer and time released encryption. In Advances in Cryptology (EUROCRYPT'99) Lecture Notes in Computer Science vol. 1592 Springer Berlin 74--89.","DOI":"10.1007\/3-540-48910-X_6"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Damgard I.\n     and \n      \n      \n      Fujisaki E\n      \n  \n  . \n  2002\n  . An integer commitment scheme based on groups with hidden order. In Advances in Cryptology (ASIACRYPT'02) Lecture Notes in Computer Science vol. \n  2501 Springer Berlin 125--142.   Damgard I. and Fujisaki E. 2002. An integer commitment scheme based on groups with hidden order. In Advances in Cryptology (ASIACRYPT'02) Lecture Notes in Computer Science vol. 2501 Springer Berlin 125--142.","DOI":"10.1007\/3-540-36178-2_8"},{"key":"e_1_2_1_32_1","unstructured":"Department of Defense. 1985. Trusted computer system evaluation criteria. Tech. rep. DoD 5200.28-STD.  Department of Defense. 1985. Trusted computer system evaluation criteria. Tech. rep. DoD 5200.28-STD."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_17"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Fujisaki E.\n     and \n      \n      \n      Okamoto T\n      \n  \n  . \n  1997\n  . Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology (CRYPTO'97) Lecture Notes in Computer Science vol. \n  1294 Springer Berlin 16--30.   Fujisaki E. and Okamoto T. 1997. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology (CRYPTO'97) Lecture Notes in Computer Science vol. 1294 Springer Berlin 16--30.","DOI":"10.1007\/BFb0052225"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.47"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_2_1_39_1","unstructured":"Google. 2009. Google Health. https:\/\/www.google.com\/health.  Google. 2009. Google Health. https:\/\/www.google.com\/health."},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Green M.\n     and \n      \n      \n      Hohenberger S\n      \n  \n  . \n  2007\n  . Blind identity-based encryption and simulatable oblivious transfer. In Advances in Cryptology (ASIACRYPT'07) Lecture Notes in Computer Science vol. \n  4833 Springer Berlin 265--282.   Green M. and Hohenberger S. 2007. Blind identity-based encryption and simulatable oblivious transfer. In Advances in Cryptology (ASIACRYPT'07) Lecture Notes in Computer Science vol. 4833 Springer Berlin 265--282.","DOI":"10.1007\/978-3-540-76900-2_16"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1478559.1478563"},{"key":"e_1_2_1_43_1","unstructured":"Lysyanskaya A. 2002. Signature schemes and applications to cryptographic protocol design. Ph.D. dissertation MIT Cambridge MA.   Lysyanskaya A. 2002. Signature schemes and applications to cryptographic protocol design. Ph.D. dissertation MIT Cambridge MA."},{"key":"e_1_2_1_44_1","unstructured":"Microsoft. 2009. Microsoft HealthVault. http:\/\/www.healthvault.com\/.  Microsoft. 2009. Microsoft HealthVault. http:\/\/www.healthvault.com\/."},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Naor M.\n     and \n      \n      \n      Pinkas B\n      \n  \n  . \n  1999\n  . Oblivious transfer with adaptive queries. In Advances in Cryptology (CRYPTO'99) Lecture Notes in Computer Science vol. \n  1666 Springer Berlin 573--590.   Naor M. and Pinkas B. 1999. Oblivious transfer with adaptive queries. In Advances in Cryptology (CRYPTO'99) Lecture Notes in Computer Science vol. 1666 Springer Berlin 573--590.","DOI":"10.1007\/3-540-48405-1_36"},{"volume-title":"Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS'97)","author":"Naor M.","key":"e_1_2_1_46_1"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2003.08.023"},{"volume-title":"Advances in Cryptology (CRYPTO'92)","series-title":"Lecture Notes in Computer Science","author":"Pedersen T. P.","key":"e_1_2_1_48_1"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"e_1_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Teranishi I. Furukawa J. and \n      \n      \n      Sako K\n      \n  \n  . \n  2004\n  . k-times anonymous authentication. In Advances in Cryptology (ASIACRYPT'04) Lecture Notes in Computer Science vol. \n  3329 Springer Berlin 308--322.  Teranishi I. Furukawa J. and Sako K. 2004. k-times anonymous authentication. In Advances in Cryptology (ASIACRYPT'04) Lecture Notes in Computer Science vol. 3329 Springer Berlin 308--322.","DOI":"10.1007\/978-3-540-30539-2_22"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_7"}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1952982.1952992","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1952982.1952992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:41Z","timestamp":1750244381000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1952982.1952992"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["10.1145\/1952982.1952992"],"URL":"https:\/\/doi.org\/10.1145\/1952982.1952992","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"type":"print","value":"1094-9224"},{"type":"electronic","value":"1557-7406"}],"subject":[],"published":{"date-parts":[[2011,5]]},"assertion":[{"value":"2010-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}