Conditional Automata: a Tool for Safe Removal of Negligible Events
In Concurrency Theory, 21th International Conference (CONCUR)
, pages 539-551, Springer
, Lecture Notes in Computer Science 6269, 2010.
Downloads: pdf, bibURL: http://dx.doi.org/10.1007/978-3-642-15375-4_37
Abstract. Polynomially accurate simulations are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. They are proposed for verification of cryptographic protocols. In this paper we introduce a general construction on probabilistic automata, called Conditional Automata, that allows us to remove safely events that occur with negligible probability. The construction is justified in terms of polynomially accurate simulations. This, combined with the hierarchical and compositional verification style that underlies simulation relations, permits one to abstract one cryptographic component at a time in a complex system. We illustrate our construction through a simple example based on nonce generation, where we remove the event of repeated nonces.