DMCA
Union, Intersection, and Refinement Types and Reasoning About Type Disjointness for Secure Protocol Implementations (2012)
Cached
Download Links
BibTeX
@MISC{Backes12union,intersection,,
author = {Michael Backes and Catalin Hritcu and Matteo Maffei},
title = {Union, Intersection, and Refinement Types and Reasoning About Type Disjointness for Secure Protocol Implementations},
year = {2012}
}
Share
 |
 |
 |
 |
||
OpenURL
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, 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 zeroknowledge proofs. The type system comes with a mechanized proof of correctness and an efficient type-checker.
Keyphrases
refinement type type disjointness secure protocol implementation type-based analysis integrity property asymmetric cryptography mechanized proof type system combine private data protocol implementation increased expressivity efficient type-checker novel ability important protocol class polymorphic type zeroknowledge proof type system authenticated data new type system cryptographic protocol implementation secret data
