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 propose a novel paradigm for defining security of cryptographic protocols, called
universally composable security. The salient property of universally composable definitions …

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 …

Recently some efforts were made towards capturing the security requirements from digital
signature schemes as an ideal functionality within a composable security framework. This …

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 …

We construct the first public-key encryption scheme that is proven secure (in the standard
model, under standard assumptions) even when the attacker gets access to encryptions of …

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 …

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 …