Name
Abstract | ||
|---|---|---|
We present an algorithm to decide the intruder deduction problem (IDP) for a class of locally stable theories enriched with normal forms. Our result relies on a new and efficient algorithm to solve a restricted case of higher-order associative-commutative matching, obtained by combining the Distinct Occurrences of AC-matching algorithm and a standard algorithm to solve systems of linear Diophantine equations. A translation between natural deduction and sequent calculus allows us to use the same approach to decide the elementary deduction problem for locally stable theories. As an application, we model the theory of blind signatures and derive an algorithm to decide IDP in this context, extending previous decidability results. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.4204/EPTCS.113.7 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE |
Field | DocType | Issue |
Discrete mathematics,Standard algorithms,Natural deduction,Algorithm,Sequent calculus,Decidability,Diophantine equation,Blossom algorithm,Mathematics | Journal | 113 |
ISSN | Citations | PageRank |
2075-2180 | 0 | 0.34 |
References | Authors | |
17 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mauricio Ayala-Rincón | 1 | 156 | 31.94 |
| Maribel Fernández | 2 | 315 | 23.44 |
| Daniele Nantes Sobrinho | 3 | 2 | 3.08 |