Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
verfasst von : Helmut Seidl, Kumar Neeraj Verma
Erschienen in: Program Analysis and Compilation, Theory and Practice
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 one-variable 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
$\mathcal{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.