Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Abstract interpretation and application to logic programs
Journal of Logic Programming
Provably secure session key distribution: the three party case
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
An approach to the formal verification of cryptographic protocols
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
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
Abstracting Cryptographic Protocols with Tree Automata
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Formal Automatic Verification of Authentication Cryptographic Protocols
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Experiments with Finite Tree Automata in Coq
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
On Name Generation and Set-Based Analysis in the Dolev-Yao Model
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Abstracting Cryptographic Protocols by Prolog Rules
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Automated Unbounded Verification of Security Protocols
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Extrapolating Tree Transformations
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Well-Founded Recursive Relations
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Abstracting cryptographic protocols with tree automata
Science of Computer Programming - Special issue on static analysis (SAS'99)
Protocol insecurity with a finite number of sessions and composed keys is NP-complete
Theoretical Computer Science
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Protocol Insecurity with Finite Number of Sessions is NP-Complete
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Strategy for Verifying Security Protocols with Unbounded Message Size
Automated Software Engineering
Verification of cryptographic protocols: tagging enforces termination
Theoretical Computer Science - Foundations of software science and computation structures
Alternating two-way AC-tree automata
Information and Computation
Transducer-based analysis of cryptographic protocols
Information and Computation
ACM Transactions on Computational Logic (TOCL)
Proving Group Protocols Secure Against Eavesdroppers
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Satisfiability of Dolev-Yao Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of cryptographic Protocols: tagging enforces termination
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Two-way equational tree automata for AC-like theories: decidability and closure properties
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Pattern-based abstraction for verifying secrecy in protocols
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A DEXPTIME-complete Dolev-Yao theory with distributive encryption
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Techniques for scaling up analyses based on pre-interpretations
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Completing the picture: soundness of formal encryption in the presence of active adversaries
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Alternation in equational tree automata modulo XOR
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
| Hi-index | 0.00 |
We present an automatic, terminating method for verifying confidentiality properties, and to a lesser extent freshness properties of cryptographic protocols. It is based on a safe abstract interpretation of cryptographic protocols using a specific extension of tree automata, 驴-parameterized tree automata, which mix automata-theoretic techniques with deductive features. Contrary to most model-checking approaches, this method offers actual security guarantees. It owes much to D. Bolignano's ways of modeling cryptographic protocols and to D. Monniaux' seminal idea of using tree automata to verify cryptographic protocols by abstract interpretation. It extends the latter by adding new deductive abilities, and by offering the possibility of analyzing protocols in the presence of parallel multi-session principals, following some ideas by M. Debbabi, M. Mejri, N. Tawbi, and I. Yahmadi.