Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Ţiplea, Ferucio L.a; b | Bîrjoveanu, Cătălin V.a | Enea, Constantina | Boureanu, Ioanaa
Affiliations: [a] Department of Computer Science, “Al.I.Cuza” University of Iaşi, Iaşi, Romania. E-mails: fltiplea@infoiasi.ro, cbirjoveanu@infoiasi.ro, cenea@infoiasi.ro, iboureanu@infoiasi.ro | [b] School of Computer Science, University of Central Florida, Orlando, FL 32816, USA. E-mail: fltiplea@mail.dntis.ro
Note: [*] The research reported in this paper was partially supported by the National University Research Council of Romania under the grant CNCSIS 632/2004–2005.
Abstract: The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bounded protocols with freshness check is shown to be NEXPTIME-complete. Relating the formalism in this paper to the multiset rewriting (MSR) formalism we obtain that the initial secrecy problem for protocols in restricted form, with bounded length messages, bounded existentials, with or without disequality tests, and an intruder with no existentials, is NEXPTIME-complete. If existentials for the intruder are allowed but disequality tests are not allowed, the initial secrecy problem still is NEXPTIME-complete. However, if both existentials for the intruder and disequality tests are allowed and the protocols are not well-founded (and, therefore, not in restricted form), then the problem is undecidable. These results also correct some wrong statements in Durgin et al., JCS 12 (2004), 247–311.
Keywords: Security protocol, secrecy problem, complexity
DOI: 10.3233/JCS-2007-0306
Journal: Journal of Computer Security, vol. 16, no. 6, pp. 689-712, 2008
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl