loading...
Protocol Insecurity with Finite Number of Sessions is NP-Complete
Cape Breton, Novia Scotia, Canada June 11-June 13
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSFW.2001.93014514th IEEE Computer Security Foundatio ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Michaël Rusinowitch, Mathieu Turuani, "Protocol Insecurity with Finite Number of Sessions is NP-Complete," Computer Security Foundations Workshop, IEEE, pp. 0174, 14th IEEE Computer Security Foundations Workshop (CSFW'01), 2001.
 
 
BibTex
x
 
@article{ 10.1109/CSFW.2001.930145,
author = {Michaël Rusinowitch and Mathieu Turuani},
title = {Protocol Insecurity with Finite Number of Sessions is NP-Complete},
journal ={Computer Security Foundations Workshop, IEEE},
volume = {0},
year = {2001},
isbn = {0-7695-1146-5},
pages = {0174},
doi = {http://doi.ieeecomputersociety.org/10.1109/CSFW.2001.930145},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Security Foundations Workshop, IEEE
TI - Protocol Insecurity with Finite Number of Sessions is NP-Complete
SN - 0-7695-1146-5
SP
EP
A1 - Michaël Rusinowitch,
A1 - Mathieu Turuani,
PY - 2001
VL - 0
JA - Computer Security Foundations Workshop, IEEE
ER -
 
Michaël Rusinowitch, LORIA-INRIA- Universit? Henri Poincar?
Mathieu Turuani, LORIA-INRIA- Universit? Henri Poincar?
Abstract: We investigate the complexity of the protocol insecurity problem for a finite number of sessions (fixed number of interleaved runs). We show that this problem is NP-complete in a Dolev-Yao model of intruders. The result does not assume a limit on the size of messages and supports nonatomic symmetric encryption keys. We also prove that in order to build an attack with a fixed number of sessions the intruder needs only to forge messages of polynomial size, provided that they are represented as dags.
Citation:
Michaël Rusinowitch, Mathieu Turuani, "Protocol Insecurity with Finite Number of Sessions is NP-Complete," csfw, pp.0174, 14th IEEE Computer Security Foundations Workshop (CSFW'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.