{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T10:59:54Z","timestamp":1777805994422,"version":"3.51.4"},"reference-count":21,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2016,3,10]],"date-time":"2016-03-10T00:00:00Z","timestamp":1457568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer Security"],"published-print":{"date-parts":[[2016,6,8]]},"abstract":"<jats:p>In this paper, we consider restricted data sharing between a set of parties that wish to provide some set of online services requiring such data sharing. Each party is assumed to store its data in private relational databases, and is given a set of mutually agreed set of authorization rules that specify access to attributes over individual relations or joins over relations owned by one or more parties. The access restrictions introduce significant additional complexity in rule enforcement and query planning as compared with a traditional distributed database environment. We examine the problem of minimum cost rule enforcement which simultaneously checks for the enforceability of each rule and generation of minimum cost plan of its execution. However, the paper is not focused on specific cost functions, but instead of efficient methods for enforcing rules in the face of access restrictions and inter-party data transfer needs. We propose an efficient heuristic algorithm for this minimal enforcement since the exact problem is NP-hard. In some cases, it is not possible to enforce the rules with the regular parties only. In such cases, we need help of trusted third parties (TPs). If all parties trust a single TP, such a party can enforce all unenforced rules, but it is desirable to use the TP minimally. We also consider the extended case where multiple TPs are required since not every regular party can trust a single TP.<\/jats:p>","DOI":"10.3233\/jcs-160548","type":"journal-article","created":{"date-parts":[[2016,6,3]],"date-time":"2016-06-03T09:51:39Z","timestamp":1464947499000},"page":"379-403","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":4,"title":["Minimum cost rule enforcement for cooperative database access"],"prefix":"10.1177","volume":"24","author":[{"given":"Meixing","family":"Le","sequence":"first","affiliation":[{"name":"Security Technology Business Unit, Cisco Corporation, San Jose, CA, USA. E-mail:\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishna","family":"Kant","sequence":"additional","affiliation":[{"name":"Computer & Information Science Department, Temple University, Philadelphia, PA, USA. E-mails:\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malek","family":"Athamnah","sequence":"additional","affiliation":[{"name":"Computer & Information Science Department, Temple University, Philadelphia, PA, USA. E-mails:\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sushil","family":"Jajodia","sequence":"additional","affiliation":[{"name":"Center for Secure Information Systems, George Mason University, Fairfax, VA, USA. E-mail:\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2016,3,10]]},"reference":[{"key":"ref001","unstructured":"G.\u00a0Aggarwal, M.\u00a0Bawa, P.\u00a0Ganesan, H.\u00a0Garcia-Molina, K.\u00a0Kenthapadi, R.\u00a0Motwani, U.\u00a0Srivastava, D.\u00a0Thomas and Y.\u00a0Xu, Two can keep A secret: A distributed architecture for secure database services, in: CIDR, 2005, pp.\u00a0186\u2013199."},{"key":"ref002","doi-asserted-by":"crossref","unstructured":"R.\u00a0Agrawal, D.\u00a0Asonov, M.\u00a0Kantarcioglu and Y.\u00a0Li, Sovereign joins, in: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, Atlanta, GA, USA, 3\u20138 April 2006, IEEE Computer Society, 2006, p.\u00a026.","DOI":"10.1109\/ICDE.2006.144"},{"key":"ref003","doi-asserted-by":"publisher","DOI":"10.1145\/319628.319650"},{"key":"ref004","doi-asserted-by":"crossref","unstructured":"D.F.C.\u00a0Brewer and M.J.\u00a0Nash, The Chinese wall security policy, in: IEEE Symposium on Security and Privacy, 1989, pp.\u00a0206\u2013214.","DOI":"10.1109\/SECPRI.1989.36295"},{"key":"ref005","doi-asserted-by":"crossref","unstructured":"A.\u00a0Cal\u00ec and D.\u00a0Martinenghi, Querying data under access limitations, in: Proceedings of the 24th International Conference on Data Engineering, ICDE 2008, Canc\u00fan, M\u00e9xico, 7\u201312 April 2008, IEEE, 2008, pp.\u00a050\u201359.","DOI":"10.1109\/ICDE.2008.4497413"},{"key":"ref006","doi-asserted-by":"crossref","unstructured":"S.\u00a0Chaudhuri, An overview of query optimization in relational systems, in: Proceedings of the 7th ACM SIGACT\u2013SIGMOD\u2013SIGART Symposium on Principles of Database Systems, 1998, pp.\u00a034\u201343.","DOI":"10.1145\/275487.275492"},{"key":"ref007","doi-asserted-by":"crossref","unstructured":"V.\u00a0Ciriani, S.\u00a0De Capitani di Vimercati, S.\u00a0Foresti, S.\u00a0Jajodia, S.\u00a0Paraboschi and P.\u00a0Samarati, Keep a few: Outsourcing data while maintaining confidentiality, in: ESORICS, Lecture Notes in Computer Science, Vol.\u00a05789, 2009, pp.\u00a0440\u2013455.","DOI":"10.1007\/978-3-642-04444-1_27"},{"key":"ref008","doi-asserted-by":"crossref","unstructured":"S.\u00a0De Capitani di Vimercati, S.\u00a0Foresti, S.\u00a0Jajodia, S.\u00a0Paraboschi and P.\u00a0Samarati, Controlled information sharing in collaborative distributed query processing, in: ICDCS 2008, Beijing, China, June 2008, pp.\u00a02\u20137.","DOI":"10.1109\/ICDCS.2008.62"},{"key":"ref009","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2010-0413"},{"key":"ref010","doi-asserted-by":"crossref","unstructured":"J.\u00a0Goldstein and P.\u00a0Larson, Optimizing queries using materialized views: A practical, scalable solution, in: Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, 2001, pp.\u00a0331\u2013342.","DOI":"10.1145\/375663.375706"},{"key":"ref011","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100054"},{"key":"ref012","doi-asserted-by":"publisher","DOI":"10.1145\/371578.371598"},{"key":"ref013","doi-asserted-by":"crossref","unstructured":"M.\u00a0Le, K.\u00a0Kant and S.\u00a0Jajodia, Access rule consistency in cooperative data access environment, in: 8th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2012), October 2012, pp.\u00a011\u201320.","DOI":"10.4108\/icst.collaboratecom.2012.250467"},{"key":"ref014","doi-asserted-by":"crossref","unstructured":"M.\u00a0Le, K.\u00a0Kant and S.\u00a0Jajodia, Consistency and enforcement of access rules in cooperative data sharing environment, in: Computers and Security, November 2013, pp.\u00a010\u201312.","DOI":"10.1016\/j.cose.2013.08.011"},{"key":"ref015","doi-asserted-by":"crossref","unstructured":"M.\u00a0Le, K.\u00a0Kant and S.\u00a0Jajodia, Rule enforcement with third parties in secure cooperative data access, in: 27th Data and Applications Security and Privacy, DBSec 2013, July 2013, pp.\u00a03\u20136.","DOI":"10.1007\/978-3-642-39256-6_20"},{"key":"ref016","doi-asserted-by":"crossref","unstructured":"M.\u00a0Le, K.\u00a0Kant and S.\u00a0Jajodia, Consistent query plan generation in secure cooperative data access, in: 28th Data and Applications Security and Privacy, DBSec 2014, July 2014, pp.\u00a010\u201312.","DOI":"10.1007\/978-3-662-43936-4_15"},{"key":"ref017","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-002-0085-6"},{"key":"ref018","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100048"},{"key":"ref019","doi-asserted-by":"crossref","unstructured":"S.\u00a0Rizvi, A.\u00a0Mendelzon, S.\u00a0Sudarshan and P.\u00a0Roy, Extending query rewriting techniques for fine-grained access control, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD\u201904), June 2004, pp.\u00a03\u20136.","DOI":"10.1145\/1007568.1007631"},{"key":"ref020","unstructured":"R.\u00a0Sion, Query execution assurance for outsourced databases, in: VLDB, ACM, 2005, pp.\u00a0601\u2013612."},{"key":"ref021","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Zhang and A.\u00a0Mendelzon, Authorization views and conditional query containment, in: ICDT, Vol.\u00a03363, Springer, 2005, pp.\u00a0259\u2013273.","DOI":"10.1007\/978-3-540-30570-5_18"}],"container-title":["Journal of Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-160548","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JCS-160548","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-160548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:44:58Z","timestamp":1777495498000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JCS-160548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,10]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6,8]]}},"alternative-id":["10.3233\/JCS-160548"],"URL":"https:\/\/doi.org\/10.3233\/jcs-160548","relation":{},"ISSN":["0926-227X","1875-8924"],"issn-type":[{"value":"0926-227X","type":"print"},{"value":"1875-8924","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,10]]}}}