Flow logic for Dolev-Yao secrecy in cryptographic processes

Authors:
C. Bodei;P. Degano;F. Nielson;H. Riis Nielson
Affiliations:
Dipartimento di Informatica, Università di Pisa, Corso Italia 40, I-56125 Pisa, Italy;Dipartimento di Informatica, Università di Pisa, Corso Italia 40, I-56125 Pisa, Italy;Informatics and Mathematical Modelling, The Technical University of Denmark, Richard Petersens Plads Bldg. 321, DK-2800 Kongens Lyngby, Denmark;Informatics and Mathematical Modelling, The Technical University of Denmark, Richard Petersens Plads Bldg. 321, DK-2800 Kongens Lyngby, Denmark
Venue:
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
Year:
2002

Citing 17
Cited 8

An approach to the formal verification of cryptographic protocols

CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Secure information flow in a multi-threaded imperative language

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The SLam calculus: programming with secrecy and integrity

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A typed language for distributed mobile processes (extended abstract)

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types for mobile ambients

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Trust and partial typing in open systems of mobile agents

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus for cryptographic protocols

Information and Computation
Secrecy by typing in security protocols

Journal of the ACM (JACM)
Types for access control

Theoretical Computer Science
A sound type system for secure flow analysis

Journal of Computer Security
Using encryption for authentication in large networks of computers

Communications of the ACM
Certification of programs for secure information flow

Communications of the ACM
A lattice model of secure information flow

Communications of the ACM
Mobile values, new names, and secure communication

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal Eavesdropping and Its Computational Interpretation

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Control Flow Analysis for the pi-calculus

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Proving Properties of Security Protocols by Induction

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations

Checking security policies through an enhanced control flow analysis

Journal of Computer Security - Special issue on WITS'03
Static validation of security protocols

Journal of Computer Security
A monotone framework for CCS

Computer Languages, Systems and Structures
Flow-sensitive Leakage Analysis in Mobile Ambients

Electronic Notes in Theoretical Computer Science (ENTCS)
Security protocols: principles and calculi tutorial notes

Foundations of security analysis and design IV
Data flow analysis for CCS

Program analysis and compilation, theory and practice
Flow Logic for Process Calculi

ACM Computing Surveys (CSUR)
Security protocol verification: symbolic and computational models

POST'12 Proceedings of the First international conference on Principles of Security and Trust

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the νSPI-calculus that strengthens the notion of "perfect symmetric cryptography" of the spi-calculus by making encryption history dependent. We give our calculus an operational and a static semantics. The latter is a control flow analysis (CFA), defined in the form of a flow logic, and it is proved semantically correct. We then apply our CFA to check security properties; in particular, we show that secrecy à la Dolev-Yao can be expressed in terms of the CFA.