Conference Proceeding

Deciding Knowledge in Security Protocols Under Equational Theories.

01/2004; pp.46-58 In proceeding of: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings
Source: DBLP
0 0
 · 
0 Bookmarks
 · 
21 Views
  • Source
    Article: A Proof Theoretic Analysis of Intruder Theories
    Alwen F Tiu, Rajeev Gore, Jeremy Dawson
    [show abstract] [hide abstract]
    ABSTRACT: 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 Gamma 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 problem, which amounts to solving certain equations in the underlying individual equational theories. We 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. To further demonstrate the utility of the sequent-based approach, we show that, for Dolev-Yao intruders, our sequent-based techniques can be used to solve the more difficult problem of solving deducibility constraints, where the sequents to be deduced may contain gaps (or variables) representing possible messages the intruder may produce. Comment: Extended version of RTA 2009 paper
    05/2010;
  • Source
    Article: Reducing Equational Theories for the Decision of Static Equivalence.
    Steve Kremer, Antoine Mercier, Ralf Treinen
    J. Autom. Reasoning. 01/2012; 48:197-217.
  • Source
    Article: Computing Knowledge in Security Protocols Under Convergent Equational Theories.
    Stefan Ciobâca, Stéphanie Delaune, Steve Kremer
    J. Autom. Reasoning. 01/2012; 48:219-262.

Show more

Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.