Modeling frameworks such as probabilistic I/O automata (PIOA) and Markov decision
processes permit both probabilistic and nondeterministic choices. In order to use such …

We present a symbolic framework for refinement and composition of security protocols. The
framework uses the notion of ideal functionalities. These are abstract systems which are …

Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision
Processes permit both probabilistic and nondeterministic choices. In order to use these …

This paper presents the time-bounded task-PIOA modeling framework, an extension of the
probabilistic input/output automata (PIOA) framework that can be used for modeling and …

Many of the problems that arise in the context of blockchains and decentralized finance can
be seen as variations on classical problems of distributed computing. The smart contract …

In the verification of concurrent systems involving probabilities, the aim is to find out the
maximum/minimum probability that a given event occurs (examples of such events being …

Although there have been many successes in verifying proofs of non-interactive
cryptographic primitives such as encryption and signatures, formal verification of interactive …

For many cryptographic protocols, security relies on the assumption that adversarial entities
have limited computational power. This type of security degrades progressively over the …

This work extends the composable secure-emulation of Canetti et al. to dynamic settings.
Our work builds on top of dynamic probabilistic I/O automata, a recent framework introduced …

We present probabilistic dynamic I/O automata, a framework to model dynamic probabilistic
systems. Our work extends dynamic I/O Automata formalism of Attie & Lynch to probabilistic …