A calculus for access control in distributed systems
ACM Transactions on Programming Languages and SystemsPublished 1 September 1993Open access
Martı́n Abadi, Michael T. Burrows, Butler Lampson, Gordon Plotkin
Citations576
SJR quartileQ2
SJR score0.56
SNIP1.52
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work provides a logical language for accesss control lists and theories for deciding whether requests should be granted, and studies some of the concepts, protocols, and algorithms for access control in distributed systems from a logical perspective.
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 accesss control lists and theories for deciding whether requests should be granted.
Keywords
Computer ScienceSocial Sciences
IEEE Transactions on Information TheoryNew directions in cryptography
14,441 Citations1976Whitfield Diffie, Martin E. Hellman
Communications of the ACMA method for obtaining digital signatures and public-key cryptosystems
13,142 Citations1983Ronald L. Rivest, Adi Shamir +1 more
Communications of the ACMA method for obtaining digital signatures and public-key cryptosystems
13,083 Citations1978Ronald L. Rivest, Adi Shamir +1 more
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.
Theoretical Computer ScienceLinear logic
4,030 Citations1987Jean-Yves Girard
Material for the course Lineare Logik mit Anwendungen, Technische Hochschule Darmstadt, Sommersemester 1996 is reprinted here in rough draft form.
Communications of the ACMUsing encryption for authentication in large networks of computers
2,360 Citations1978Roger M. Needham, Michael Schroeder
Use of encryption to achieve authenticated communication in computer networks is discussed and example protocols are presented for the establishment of authenticated connections, for the management of authenticated mail, and for signature verification and document integrity guarantee.
An Introduction to Modal Logic
1,842 Citations1968M. J. Cresswell, G. E. Hughes
IEEE CSIT NewsletterProtection of information in computer systems
1,425 Citations1975Jerome H. Saltier, Michael P. Schroeder
An excellant technical survey of the mechanics of protecting computer-stored information from unauthorised use or modifications, with a focus on the conceptual framework necessary to enforce data security.
Journal of the ACMAlternation
1,205 Citations1981Ashok K. Chandra, Dexter Kozen +1 more
It is shown that alternating pushdown automata are strictly more powerful than nondeterministic pushdown Automata and the number of alternations allowed during computations.
Data Encryption Standard
940 Citations2007Dag Arne Osvik, Universitas Bergensis +2 more
Proceedings of the Royal Society of London A Mathematical and Physical SciencesA logic of authentication
630 Citations1989Michael T. Burrows, M. Abadi +1 more
This paper shows how various protocols differ subtly with respect to the required initial assumptions of the participants and their final beliefs, and explains the formalism used, and gives examples of its application to protocols from the literature.
Information and ComputationA Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
621 Citations1994Dexter Kozen
ACM Transactions on Computer SystemsAuthentication in distributed systems
610 Citations1992Butler Lampson, Martín Abadi +2 more
A theory of authentication and a system that implements it, based on the notion of principal and a “speaks for” relation between principals, is described and used to explain many existing and proposed security mechanisms.
ACM SIGOPS Operating Systems ReviewAuthentication in distributed systems
535 Citations1993Armin Liebl
This bibliography contains references of protocol descriptions and of protocol analysis efforts that are fundamental to access control, accounting and secure communication.
Communications of the ACMCapability-based addressing
355 Citations1974R. S. Fabry
A computer using capability-based addressing may be substantially superior to present systems on the basis of protection, simplicity of programming conventions, and efficient implementation.
Journal of Symbolic LogicQuantales and (noncommutative) linear logic
320 Citations1990David N. Yetter
The purpose of this paper is to make explicit the connection between J.-Y.
An architecture for practical delegation in a distributed system
203 Citations1990Morrie Gasser, Ellen McDermott
A practical technique for delegation that provides both cryptographic assurance that a delegation was authorized and authentication of the delegated systems, thereby allowing reliable access control as well as precise auditing of the systems involved in every access.
The Digital Distributed System Security Architecture
187 Citations1989Morrie Gasser, Andy Goldstein +2 more
The architecture must be designed to securely support systems that do not implement or use any of the security services, while providing extensive additional security capabilities for those systems that choose to implement the architecture.
Theoretical Computer ScienceA logical view of composition
82 Citations1993Martı́n Abadi, Gordon Plotkin
Two logics of safety specifications for reactive systems are defined; one of the logics is intuitionistic, while the other one is linear.
Science of Computer ProgrammingAuthentication and delegation with smart-cards
72 Citations1993M. Abadi, Michael T. Burrows +2 more
The authentication of users in distributed systems poses special problems because users lack the ability to encrypt and decrypt, and the same problems arise when users wish to delegate some of their authority to nodes, after mutual authentication.
Cascaded authentication
62 Citations2003Karen Sollins
The author addresses a problem that has arisen in building distributed systems in which incomplete trust exists and program composition is necessary to permit authentication for both access control and accounting when cascading invocations by developing a mechanism she calls passports.
Lecture notes in computer scienceAuthentication and delegation with smart-cards
54 Citations1991M. Abadi, Michael T. Burrows +2 more
The authentication of users in distributed systems poses special problems because users lack the ability to encrypt and decrypt, and the same problems arise when users wish to delegate some of their authority to nodes, after mutual authentication.
Algebra UniversalisRepresentations of distributive lattice-ordered semigroups with binary relations
48 Citations1991H. Andr�ka
Lecture notes in computer scienceDynamic algebras as a well-behaved fragment of relation algebras
47 Citations2006Vaughan Pratt
The RA definitions that are incomplete with respect to representable relation algebras, when expressed in their DA form are complete withrespect to representability of the free intensional dynamic algebraes.
Dynamic algebras as a well-behaved fragment of relation algebras
40 Citations1990Vaughan Pratt
Journal of Symbolic LogicOn models of the elementary theory of (Z, +, 1)
5 Citations1990Mark Nadel, Jonathan Stavi
It is proved that all models of T 1 are ℵ 0 -homogeneous (§2), classify them up to isomorphism or L ∞ κ -equivalence (§3 and 4) and show that they may be as complex as arbitrary sets of real numbers from the point of view of admissible set theory (§5).