Skip to main content
Conference ProceedingsOPEN ACCESS

Dynamics in delegation and revocation schemes: A logical approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6818 LNCS 90-105
DOI: 10.1007/978-3-642-22348-8_9
4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we first introduce a logic for describing formally a family of delegation and revocation models that are based on the work in Hagström et al.. We then extend our logic to accommodate an epistemic interpretation of trust within the framework that we define. What emerges from this work is a rich framework of formally well-defined delegation and revocation schemes that accommodates an important trust component. © 2011 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Aucher, G., Barker, S., Boella, G., Genovese, V., & Van Der Torre, L. (2011). Dynamics in delegation and revocation schemes: A logical approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6818 LNCS, pp. 90–105). https://doi.org/10.1007/978-3-642-22348-8_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free