Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
Timestamps in key distribution protocols
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
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
On Name Generation and Set-Based Analysis in the Dolev-Yao Model
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
An Improved Constraint-Based System for the Verification of Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Rewriting for Cryptographic Protocol Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
An NP Decision Procedure for Protocol Insecurity with XOR
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Protocol Insecurity with Finite Number of Sessions is NP-Complete
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Information Processing Letters
A Theory of Dictionary Attacks and its Complexity
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Tree automata with one memory set constraints and cryptographic protocols
Theoretical Computer Science - Automata, languages and programming
Deciding knowledge in security protocols for monoidal equational theories
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Deciding security of protocols against off-line guessing attacks
Proceedings of the 12th ACM conference on Computer and communications security
Intruder deduction for the equational theory of Abelian groups with distributive encryption
Information and Computation
A survey of algebraic properties used in cryptographic protocols
Journal of Computer Security
Hierarchical combination of intruder theories
Information and Computation
Symbolic protocol analysis for monoidal equational theories
Information and Computation
YAPA: A Generic Tool for Computing Intruder Knowledge
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures
Theoretical Computer Science
Cap unification: application to protocol security modulo homomorphic encryption
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
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
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)
Unification modulo homomorphic encryption
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Deciding recognizability under Dolev-Yao intruder model
ISC'10 Proceedings of the 13th international conference on Information security
Symbolic protocol analysis in presence of a homomorphism operator and exclusive or
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Unification Modulo Homomorphic Encryption
Journal of Automated Reasoning
Deduction with XOR constraints in security API modelling
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
The finite variant property: how to get rid of some algebraic properties
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Hierarchical combination of intruder theories
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
YAPA: A Generic Tool for Computing Intruder Knowledge
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We present a non-deterministic polynomial time procedure to decide the problem of insecurity, in the presence of a bounded number of sessions, for cryptographic protocols containing explicit destructor symbols, like decryption and projection. These operators are axiomatized by an arbitrary convergent rewrite system satisfying some syntactic restrictions. This approach, with parameterized semantics, allows us to weaken the security hypotheses for verification, i.e.to address a larger class of attacks than for models based on free algebra. Our procedure is defined by an nference system based on basic narrowing techniques for deciding satisfiability of combinations of first-order equations and intruder deduction constraints.