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 …

Consensus, or state machine replication is a foundational building block of distributed
systems and modern cryptography. Consensus in the classical, permissioned setting has …

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 …

Realistic secure processors, including those built for academic and commercial purposes,
commonly realize an “attested execution” abstraction. Despite being the de facto standard …

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 …

A system is said to be current-state opaque if the entrance of the system state to a set of
secret states remains opaque (uncertain) to an intruder-at least until the system leaves the …

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 …

This paper presents the first automatic technique for proving not only protocols but also
primitives in the exact security computational model. Automatic proofs of cryptographic …

Many security properties are naturally expressed as indistinguishability between two
versions of a protocol. In this paper, we show that computational proofs of indistinguishability …

We describe a cryptographically sound formal logic for proving protocol security properties
without explicitly reasoning about probability, asymptotic complexity, or the actions of a …