By Topic

Secrecy for Bounded Security Protocols under Composed Keys and Disequality Tests

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
$31 $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)
Birjoveanu, C.V. ; Dept. of Comput. Sci., Al.I.Cuza Univ. of Iasi, Iasi, Romania

In this paper, we extend some complexity results on the secrecy problem for bounded security protocols by adding composed keys and disequality tests to an existing model for security protocols.

Published in:

Symbolic and Numeric Algorithms for Scientific Computing, 2008. SYNASC '08. 10th International Symposium on

Date of Conference:

26-29 Sept. 2008