Edinburgh Research Archive

A Calculus for Access Control in Distributed Systems

Simple item page
dc.contributor.author
Abadi, Martin
en
dc.contributor.author
Burrows, Michael
en
dc.contributor.author
Lampson, Butler
en
dc.contributor.author
Plotkin, Gordon
en
dc.date.accessioned
2003-11-05T16:12:09Z
dc.date.available
2003-11-05T16:12:09Z
dc.date.issued
1993
dc.description.abstract
We study some of the concepts, protocols, and algorithms for access control in distributed systems, from a logical perspective. We account for how a principal may come to believe that another principal is making a request, either on his own or on someone else’s behalf. We also provide a logical language for access control lists and theories for deciding whether requests should be granted.
en
dc.format.extent
282006 bytes
en
dc.format.mimetype
application/pdf
en
dc.identifier.citation
ACM Transactions on Programming Languages and Systems, Vol. 15, No. 3, September 1993.
dc.identifier.uri
http://hdl.handle.net/1842/207
dc.language.iso
en
dc.subject
cryptography
en
dc.subject
cryptographic protocols
en
dc.subject
Laboratory for Foundations of Computer Science
en
dc.title
A Calculus for Access Control in Distributed Systems
en
dc.type
Article
en

Files

Original bundle

Now showing 1 - 1 of 1
Name:
Calculus_for_Access_Control.pdf
Size:
275.4 KB
Format:
Adobe Portable Document Format
Download

This item appears in the following Collection(s)

Informatics Publications