On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
An approach to the formal verification of cryptographic protocols
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Term rewriting and all that
Towards a completeness result for model checking of security protocols
Journal of Computer Security
A compiler for analyzing cryptographic protocols using noninterference
ACM Transactions on Software Engineering and Methodology (TOSEM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
A Method for Automatic Cryptographic Protocol Verification
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
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
On Name Generation and Set-Based Analysis in the Dolev-Yao Model
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Lazy Infinite-State Analysis of Security Protocols
Proceedings of the International Exhibition and Congress on Secure Networking - CQRE (Secure) '99
Proof Techniques for Cryptographic Processes
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Hierarchy of Authentication Specifications
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th 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
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Compiling and verifying security protocols
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
A Framework for the Analysis of Security Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
On Name Generation and Set-Based Analysis in the Dolev-Yao Model
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
Decidability of context-explicit security protocols
Journal of Computer Security - Special issue on WITS'03
A method for symbolic analysis of security protocols
Theoretical Computer Science
Constraint solving for contract-signing protocols
CONCUR 2005 - Concurrency Theory
A survey of algebraic properties used in cryptographic protocols
Journal of Computer Security
A calculus of challenges and responses
Proceedings of the 2007 ACM workshop on Formal methods in security engineering
Transducer-based analysis of cryptographic protocols
Information and Computation
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchical combination of intruder theories
Information and Computation
Symbolic protocol analysis for monoidal equational theories
Information and Computation
ACM Transactions on Computational Logic (TOCL)
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Validating Integrity for the Ephemerizer's Protocol with CL-Atse
Formal to Practical Security
Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
Deciding the Security of Protocols with Commuting Public Key Encryption
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures
Theoretical Computer Science
Deciding strategy properties of contract-signing protocols
ACM Transactions on Computational Logic (TOCL)
Verifying cryptographic protocols with subterms constraints
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Key substitution in the symbolic analysis of cryptographic protocols
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Symbolic bisimulation for the applied Pi calculus
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Symbolic bisimulation for the applied pi calculus
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
Bounded memory Dolev-Yao adversaries in collaborative systems
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A declarative framework for security: secure concurrent constraint programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Recursion versus replication in simple cryptographic protocols
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Deciding properties of contract-signing protocols
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Generic verification of security protocols
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Hierarchical combination of intruder theories
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Monotonic set-extended prefix rewriting and verification of recursive ping-pong protocols
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
| Hi-index | 5.23 |
We study the reachability problem for cryptographic protocols represented as processes relying on perfect cryptographic functions. We introduce a symbolic reduction system that can handle hashing functions, symmetric keys, and public keys. Desirable properties such as secrecy or authenticity are specified by inserting logical assertions in the processes.We show that the symbolic reduction system provides a flexible decision procedure for finite processes and a reference for sound implementations. The symbolic reduction system can be regarded as a variant of syntactic unification which is compatible with certain set-membership constraints. For a significant fragment of our formalism, we argue that a dag implementation of the symbolic reduction system leads to an algorithm running in NPTIME thus matching the lower bound of the problem.In the case of iterated or finite control processes, we show that the problem is undecidable in general and in PTIME for a subclass of iterated processes that do not rely on pairing. Our technique is based on rational transductions of regular languages and it applies to a class of processes containing the ping-pong protocols presented in Dolev et al. (Inform. Comput. (55) (1982) 57).