Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic Computation
Unification in the union of disjoint equational theories: combining decision procedures
Journal of Symbolic Computation
Symbolic Trace Analysis of Cryptographic Protocols
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Reachability Problem in Cryptographic Protocols
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Practical Secret Voting Scheme for Large Scale Elections
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
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
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science - Automated reasoning for security protocol analysis
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
Symbolic protocol analysis for monoidal equational theories
Information and Computation
Combining Algorithms for Deciding Knowledge in Security Protocols
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Easy intruder deduction problems with homomorphisms
Information Processing Letters
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
Normal proofs in intruder theories
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
A trace based bisimulation for the spi calculus: an extended abstract
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
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
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Analysis of an electronic voting protocol in the applied pi calculus
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Formalising Observer Theory for Environment-Sensitive Bisimulation
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Hi-index | 0.00 |
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages Γ under the theory of blind signatures and arbitrary convergent equational theories modulo associativity and commutativity (AC) of certain binary operators. The traditional formulations of intruder deduction are usually given in natural-deduction-like systems and proving decidability requires significant effort in showing that the rules are "local" in some sense. By using the well-known translation between natural deduction and sequent calculus, we recast the intruder deduction problem as proof search in sequent calculus, in which locality is immediate. Using standard proof theoretic methods, such as permutability of rules and cut elimination, we show that the intruder deduction problem can be reduced, in polynomial time, to the elementary deduction problems, which amounts to solving certain equations in the underlying individual equational theories. We further show that this result extends to combinations of disjoint AC-convergent theories whereby the decidability of intruder deduction under the combined theory reduces to the decidability of elementary deduction in each constituent theory. Although various researchers have reported similar results for individual cases, our work shows that these results can be obtained using a systematic and uniform methodology based on the sequent calculus.