E-mail a Wiley Online Library Link

Riccardo Bresciani and Andrew Butterfield A UTP approach towards probabilistic protocol verification Security and Communication Networks 7

Version of Record online: 21 JUN 2012 | DOI: 10.1002/sec.546

Thumbnail image of graphical abstract

We encode protocol runs as predicates, in the style of the Unifying Theories of Programming, in the form of homogeneous relations between probability distributions on the state space at the beginning and at the end of the protocol. The attacker model is a variation of the classical Dolev–Yao model, where cryptographic primitives can be broken probabilistically. We obtain a lattice of traces, ordered by safety with respect to a given goal.

Complete the form below and we will send an e-mail message containing a link to the selected article on your behalf

Required = Required Field