A new knowledge representation strategy for cryptographic protocol analysis

Authors:
B. Ivan Cibrario;Luca Durante;Riccardo Sisto;Adriano Valenzano
Affiliations:
Istituto di Elettronica e di Ingegneria dell'Informazione e delle Telecomunicazioni, Politecnico di Torino, Torino, Italy;Istituto di Elettronica e di Ingegneria dell'Informazione e delle Telecomunicazioni, Politecnico di Torino, Torino, Italy;Dipartimento di automatica e Informatica, Politecnico di Torino, Torino, Italy;Istituto di Elettronica e di Ingegneria dell'Informazione e delle Telecomunicazioni, Politecnico di Torino, Torino, Italy
Venue:
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Year:
2003

Citing 11
Cited 1

Automatic recognition of tractability in inference relations

Journal of the ACM (JACM)
A calculus of mobile processes, I

Information and Computation
A calculus for cryptographic protocols

Information and Computation
The inductive approach to verifying cryptographic protocols

Journal of Computer Security
Verifying security protocols with Brutus

ACM Transactions on Software Engineering and Methodology (TOSEM)
Constraint solving for bounded-process cryptographic protocol analysis

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
A State-Exploration Technique for Spi-Calculus Testing Equivalence Verification

FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Using state space exploration and a natural deduction style message derivation engine to verify security protocols

PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Proof Techniques for Cryptographic Processes

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Computing Symbolic Models for Verifying Cryptographic Protocols

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations

Automatic detection of attacks on cryptographic protocols: a case study

DIMVA'05 Proceedings of the Second international conference on Detection of Intrusions and Malware, and Vulnerability Assessment

Quantified Score

Hi-index	0.00

Visualization

Abstract

The formal verification of security properties of a cryptographic protocol is a difficult, albeit very important task as more and more sensible resources are added to public networks. This paper is focused on model checking; when adopting this approach to the problem, one challenge is to represent the intruder's knowledge in an effective way. We present an intruder's knowledge representation strategy that supports the full term language of spi calculus and does not pose artificial restrictions, such as atomicity or limited maximum size, to language elements. In addition, our approach leads to practical implementation because the knowledge representation is incrementally computable and is easily amenable to work with various term representation languages.