Title
Efficient representation of the attacker’s knowledge in cryptographic protocols analysis
Abstract
This paper addresses the problem of representing the intruder’s knowledge in the formal verification of cryptographic protocols, whose main challenges are to represent the intruder’s knowledge efficiently and without artificial limitations on the structure and size of messages. The new knowledge representation strategy proposed in this paper achieves both goals and leads to practical implementation because it is incrementally computable and is easily amenable to work with various term representation languages. In addition, it handles associative and commutative term composition operators, thus going beyond the free term algebra framework. An extensive computational complexity analysis of the proposed representation strategy is included in the paper.
Year
DOI
Venue
2008
10.1007/s00165-008-0078-3
Formal Asp. Comput.
Keywords
Field
DocType
artificial limitation,proposed representation strategy,new knowledge representation strategy,state space exploration,cryptographic protocol,commutative term composition operator,formal verification,various term representation language,free term algebra framework,incrementally computable,knowledge representation,cryptographic protocols analysis,cryptographic protocols,extensive computational complexity analysis,efficient representation,composition operator,state space,computational complexity
Term algebra,Discrete mathematics,Knowledge representation and reasoning,Programming language,Associative property,Commutative property,Cryptographic protocol,Computer science,Theoretical computer science,Operator (computer programming),Computational complexity theory,Formal verification
Journal
Volume
Issue
ISSN
20
3
1433-299X
Citations 
PageRank 
References 
1
0.40
29
Authors
4
Name
Order
Citations
PageRank
Ivan Cibrario Bertolotti111816.04
Luca Durante223120.12
Riccardo Sisto355656.79
Adriano Valenzano453558.77