We consider secrecy problems for cryptographic protocols modeled using Horn clauses and present general classes of Horn clauses which can be efficiently decided. Besides simplifying the methods for the class of flat and onevariable clauses introduced for modeling of protocols with single blind copying [7,25], we also generalize this class by considering k-variable clauses instead of one-variable clauses with suitable restrictions similar to those for the class S(+). This class allows to conveniently model protocols with joint blind copying. We show that for a fixed k, our new class can be decided in DEXPTIME, as in the case of one variable.
|Book series||Lecture Notes in Computer Science|
|Publication status||Published - 2007|
|Event||Symposium on Program Analysis and Compilation, Theory and Practice. Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday - Schloss Dagstuhl, GERMANY|
Duration: 1 Jan 2007 → …
|Conference||Symposium on Program Analysis and Compilation, Theory and Practice. Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday|
|City||Schloss Dagstuhl, GERMANY|
|Period||01/01/2007 → …|