Skip to Main content Skip to Navigation
New interface
Conference papers

Protocol Insecurity with Finite Number of Sessions is NP-complete

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 show that protocol insecurity is in NP for bounded sessions and non-atomic keys.
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:41:40 PM
Last modification on : Friday, February 4, 2022 - 3:30:17 AM

Links full text




Michaël Rusinowitch, Mathieu Turuani. Protocol Insecurity with Finite Number of Sessions is NP-complete. 14th IEEE Computer Security Foundations Workshop, Jun 2001, Cape Breton, Nova Scotia, Canada, 14 p, ⟨10.1109/CSFW.2001.930145⟩. ⟨inria-00100411⟩



Record views