In this paper, we consider the scenario where a set of parties need to cooperate with one another. To safely exchange the information, a set of authorization rules is given to the parties. In some cases, a trusted third party is required to perform the expected operations. Since interactions with the third party can be expensive and there maybe risk of data exposure/misuse, it is important to minimize their use. We formulate the minimization problem and show the problem is in NP-hard. We then propose a greedy algorithm to find close to optimal solutions. © 2013 IFIP International Federation for Information Processing.
CITATION STYLE
Le, M., Kant, K., & Jajodia, S. (2013). Rule enforcement with third parties in secure cooperative data access. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7964 LNCS, pp. 282–288). https://doi.org/10.1007/978-3-642-39256-6_20
Mendeley helps you to discover research relevant for your work.