Arrow Research search
Back to MFCS

MFCS 1999

Language-Based Security

Conference Paper Security Algorithms and Complexity · Theoretical Computer Science

Abstract

Abstract Security of mobile code is a major issue in today’s global computing environment. When you download a program from an untrusted source, how can you be sure it will not do something undesirable? In this paper I will discuss a particular approach to this problem called language-based security. In this approach, security information is derived from a program written in a high-level language during the compilation process and is included in the compiled object. This extra security information can take the form of a formal proof, a type annotation, or some other form of certificate or annotation. It can be downloaded along with the object code and automatically verified before running the code locally, giving some assurance against certain types of failure or unauthorized activity. The verifier must be trusted, but the compiler, code, and certificate need not be. Java bytecode verification is an example of this approach. I will give an overview of some recent work in this area, including a particular effort in which we are trying to make the production of certificates and the verification as efficient and invisible as possible.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Symposium on Mathematical Foundations of Computer Science
Archive span
1973-2025
Indexed papers
3045
Paper id
306647454007769481