In authorization, there is often a wish to shift the burden of proof to those making requests, since they may have more resources and more specific knowledge to construct the required proofs. We introduce an extreme instance of this approach, which we call Code-Carrying Authorization (CCA). With CCA, access-control decisions can partly be delegated to untrusted code obtained at run-time. The dynamic verification of this code ensures the safety of authorization decisions. We define and study this approach in the setting of a higher-order spi calculus. The type system of this calculus provides the needed support for static and dynamic verification. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Maffeis, S., Abadi, M., Fournet, C., & Gordon, A. D. (2008). Code-carrying authorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5283 LNCS, pp. 563–579). Springer Verlag. https://doi.org/10.1007/978-3-540-88313-5_36
Mendeley helps you to discover research relevant for your work.