Recent technologies have cleared the way for large scale application of electronic
communication. The open and distributed nature of these communications implies that the …

We present the design and implementation of a typechecker for verifying security properties
of the source code of cryptographic protocols and access control mechanisms. The …

Accountability mechanisms, which rely on after-the-fact verification, are an attractive means
to enforce authorization policies. In this paper, we describe an operational model of …

This paper presents AURA, a programming language for access control that treats ordinary
programming constructs (eg, integers and recursive functions) and authorization logic …

We consider the problem of statically verifying the conformance of the code of a system to an
explicit authorization policy. In a distributed setting, some part of the system may be …

Authorization logics provide a principled and flexible approach to specifying access control
policies. One of their compelling benefits is that a proof in the logic is evidence that an …

We define a new decidable logic for expressing and checking invariants of programs that
manipulate dynamically-allocated objects via pointers and destructive pointer updates. The …

This paper presents the first type system for statically analyzing security protocols that are
based on zero-knowledge proofs. We show how certain properties offered by zero …

Secure compilers generate compiled code that withstands many target-level attacks such as
alteration of control flow, data leaks or memory corruption. Many existing secure compilers …

Distributed systems and applications are often expected to enforce high-level authorization
policies. To this end, the code for these systems relies on lower-level security mechanisms …