Skip to Main content Skip to Navigation
Conference papers

An NP Decision Procedure for Protocol Insecurity with XOR

Yannick Chevalier 1 Ralf Küsters 2 Michaël Rusinowitch 1 Mathieu Turuani 1
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-called oracle rules, i.e., deduction rules that satisfy certain conditions. As an instance of this general framework, we obtain that protocol insecurity is in NP for an intruder that can exploit the properties of the XOR operator. This operator is frequently used in cryptographic protocols but cannot be handled in most protocol models. An immediate consequence of our proof is that checking whether a message can be derived by an intruder (using XOR) is in P. We also apply our framework to an intruder that exploits properties of certain encryption modes such as cipher block chaining (CBC).
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00103954
Contributor : Mathieu Turuani <>
Submitted on : Thursday, October 5, 2006 - 3:29:56 PM
Last modification on : Friday, April 2, 2021 - 3:33:07 AM

Identifiers

  • HAL Id : inria-00103954, version 1

Citation

Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani. An NP Decision Procedure for Protocol Insecurity with XOR. 18th IEEE Symposium on Logic in Computer Science (LICS 2003), Jun 2003, Ottawa, Canada, pp.261-270. ⟨inria-00103954⟩

Share

Metrics

Record views

1044