Skip to Main content Skip to Navigation
Conference papers

Deciding insecurity for non-atomic keys

Michaël Rusinowitch 1 Mathieu Turuani 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present an NP decision procedure for insecurity in the case of finite sessions and non-atomic encryption keys (and no fixed bound on the size of messages). We also explain that in order to build an attack with a fixed number of sessions the intruder needs only to forge messages of linear size, provided that they are represented as dags. This is joint work with Mathieu Turuani and is based on our paper presented in June 2001 at 14th CSFW. for more information:
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:47:33 PM
Last modification on : Friday, February 4, 2022 - 3:30:51 AM


  • HAL Id : inria-00100558, version 1



Michaël Rusinowitch, Mathieu Turuani. Deciding insecurity for non-atomic keys. Dagstuhl Seminar on Specification and Analysis of Secure Cryptographic Protocols, D. Basin (Freiburg), G. Denker (SRI, Menlo Park), G. Lowe (Leicester), J. Millen (SRI Menlo Park), 2001, Dagstuhl, Germany. ⟨inria-00100558⟩



Record views