Secrecy and authenticity types for secure distributed messaging

Authors:
Michele Bugliesi;Stefano Calzavara;Damiano Macedonio
Affiliations:
Università Ca' Foscari Venezia, Dipartimento di Informatica;Università Ca' Foscari Venezia, Dipartimento di Informatica;Università Ca' Foscari Venezia, Dipartimento di Informatica
Venue:
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Year:
2010

Citing 17
Cited 0

A logic of authentication

ACM Transactions on Computer Systems (TOCS)
Secrecy by typing in security protocols

Journal of the ACM (JACM)
Linearity and the pi-calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Semantic Model for Authentication Protocols

SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Typed behavioural equivalences for processes in the presence of subtyping

Mathematical Structures in Computer Science
On asynchrony in name-passing calculi

Mathematical Structures in Computer Science
Secure Implementations for Typed Session Abstractions

CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
A type discipline for authorization policies

ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Types and effects for asymmetric cryptographic protocols

Journal of Computer Security - Special issue on CSFW15
Language Based Secure Communication

CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Specifying Secure Transport Channels

CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for google apps

Proceedings of the 6th ACM workshop on Formal methods in security engineering
Secrecy and group creation

Information and Computation
Channel abstractions for network security†

Mathematical Structures in Computer Science
Cryptographically sound implementations for communicating processes

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Specifying and modelling secure channels in strand spaces

FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Design, implementation, and deployment of the iKP secure electronic payment system

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a calculus with mobile names, distributed principals and primitives for secure remote communication, without any reference to explicit cryptography. The calculus is equipped with a system of types and effects providing static guarantees of secrecy and authenticity in the presence of a Dolev-Yao intruder. The novelty with respect to existing type systems for security is in the structure of our secrecy and authenticity types, which are inspired by the formulas of BAN Logic, and retain much of the simplicity and intuitive reading of such formulas. Drawing on these types, the type system makes it possible to characterize authenticity directly as a property of the data exchanged during a protocol rather than indirectly by extracting and interpreting the effects the protocol has on that data.