Show simple item record

dc.contributor.authorAbadi, Martin
dc.contributor.authorBurrows, Michael
dc.contributor.authorLampson, Butler
dc.contributor.authorPlotkin, Gordon
dc.date.accessioned2003-11-05T16:12:09Z
dc.date.available2003-11-05T16:12:09Z
dc.date.issued1993
dc.identifier.citationACM Transactions on Programming Languages and Systems, Vol. 15, No. 3, September 1993.en
dc.identifier.urihttp://hdl.handle.net/1842/207
dc.description.abstractWe 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.extent282006 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectcryptographyen
dc.subjectcryptographic protocolsen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleA Calculus for Access Control in Distributed Systemsen
dc.typeArticleen


Files in this item

This item appears in the following Collection(s)

Show simple item record