Design and formal verification of a certified email protocol with transparent TTP

in Frontiers of Computer Science (2013), 7(2), 279-297

In certified email (CEM) protocols, trusted third party (TTP) transparency is an important security requirement which helps to avoid bad publicity as well as protecting individual users’ privacy ... [more ▼]

In certified email (CEM) protocols, trusted third party (TTP) transparency is an important security requirement which helps to avoid bad publicity as well as protecting individual users’ privacy. Cederquist et al. proposed an optimistic certified email protocol, which employs key chains to reduce the storage requirement of the TTP. We extend their protocol to satisfy the property of TTP transparency, using existing verifiably encrypted signature schemes. An implementation with the scheme based on bilinear pairing makes our extension one of the most efficient CEM protocols satisfying strong fairness, timeliness, and TTP transparency. We formally verify the security requirements of the extended protocol. The properties of fairness, timeliness and effectiveness are checked in the model checker Mocha, and TTP transparency is formalised and analysed using the toolsets mCRL and CADP [less ▲]

Game-based verification of contract signing protocols with minimal messages

in Innovations in Systems and Software Engineering (2012), 8

Verification of a key-chain based TTP transparent CEM protocol

in Proceedings of the 3rd Workshop on Harnessing Theories for Tool Support in Software (2011), ENTCS 274

A Comparison of Semantic Models for Noninterference

in Theoretical Computer Science (2010), 411(47), 41234147

The literature on definitions of security based on causality-like notions such as noninterference has used several distinct semantic models for systems. Early work was based on state machine and trace-set ... [more ▼]

The literature on definitions of security based on causality-like notions such as noninterference has used several distinct semantic models for systems. Early work was based on state machine and trace-set definitions; more recent work has dealt with definitions of security in two distinct process algebraic settings. Comparisons between the definitions has been carried out mainly within semantic frameworks. This paper studies the relationship between semantic frameworks, by defining mappings between a number of semantic models and studying the relationship between notions of noninterference under these mappings. [less ▲]