By Topic

Secrecy for Bounded Security Protocols: Disequality Tests and an Intruder with Existentials Lead to Undecidability

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Catalin V. Birjoveanu ; Dept. of Comput. Sci., Al. I. Cuza Univ. of Iasi, Iasi, Romania

The complexity of the initial secrecy problem for protocols in restricted form, with bounded length messages, unbounded number of protocol sessions, bounded existentials, disequality tests and an intruder with existentials remained open. In this paper, we prove that the problem above is undecidable, using exactly the same setting and formalism as in the paper in that the problem was initially stated.To our knowledge, up to now there is no proof of undecidability of the open problem mentioned above that constructs a protocol (well-founded) in restricted form in multiset rewriting formalism.

Published in:

Informatics, 2009. BCI '09. Fourth Balkan Conference in

Date of Conference:

17-19 Sept. 2009