Approximated Computationally Bounded Simulation Relations for Probabilistic Automata

We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. These relations are meant to provide rigorous grounds to parts of correctness proofs for cryptographic protocols that are usually carried out by semi-formal arguments. We illustrate our ideas by recasting a correctness proof of Bellare and Rogaway based on the notion of matching conversation.

• Type: Conference
• Year: 2007
• Where: CSFW
• Authors: Roberto Segala, Andrea Turrini
• Keywords: Correctness Proof, CSFW 2007, Negligible Sets, Probabilistic Automata, Security Privacy