Events

7 December 2010

Bât. I. RdC
Microsoft Research - Inria Joint Centre
Parc Orsay Université

Union and Intersection Types for Secure Protocol Implementations
Catalin Hritcu, Saarland University

Abstract:
We present a new type system for verifying the security of cryptographic protocol implementations. The type system combines prior work on refinement types, with union types, intersection, and polymorphic types, and with the novel ability to reason statically about the disjointness of types. The increased expressivity enables the analysis of important protocol classes that were previously out of scope for the type-based analyses of protocol implementations. In particular, our types can statically characterize: (i) more usages of asymmetric cryptography, such as signatures of private data and encryptions of authenticated data; (ii) authenticity and integrity properties achieved by showing knowledge of secret data; (iii) applications based on zero-knowledge proofs. The type system comes with a mechanized proof of correctness and an efficient type-checker