Sequential Probabilistic Process Calculus and Simulation-based Security

Ralf Kuesters, University of Kiel

We present a sequential probabilistic polynomial-time process calculus (SPPC) that serves as a basis for comparing related work on simulation-based security. Using representations of communicating Turing machines and IO Automata in SPPC, we are able to compare three related simulation-based security notions: universal composability, black-box-simulatability, and process observational equivalence (or strong simulatability). We prove some expected relationships between these notions and observe some surprising differences that would not be apparent without detailed analysis.

Gates 4B (opposite 490) Tuesday 08/03/04 1630 hrs