Formal ways of representing uncertainty and various logics for reasoning about it; updated
with new material on weighted probability measures, complexity-theoretic considerations …

Security protocol verification has been a very active research area since the 1990s. This
paper surveys various approaches in this area, considering the verification in the symbolic …

We present a new mechanized prover for secrecy properties of security protocols. In contrast
to most previous provers, our tool does not rely on the Dolev-Yao model, but on the …

We propose a formal model of web security based on an abstraction of the web platform and
use this model to analyze the security of several sample web mechanisms and applications …

The theory of artificial neural networks has been successfully applied to a wide variety of
pattern recognition problems. In this paper we introduce a novel class of neural networks …

Protocol Composition Logic (PCL) is a logic for proving security properties of network
protocols that use public and symmetric key cryptography. The logic is designed around a …

Abstract We present the Foundational Cryptography Framework (FCF) for develo** and
checking complete proofs of security for cryptographic schemes within a proof assistant. This …

Since the 1980s, two approaches have been developed for analyzing security protocols.
One of the approaches relies on a computational model that considers issues of complexity …

The IEEE 802.11 i wireless networking protocol provides mutual authentication between a
network access point and user devices prior to user connectivity. The protocol consists of …

We define reactive simulatability for general asynchronous systems. Roughly, simulatability
means that a real system implements an ideal system (specification) in a way that preserves …