By Topic

Soundness Conditions for Cryptographic Algorithms and Parameters Abstractions in Formal Security Protocol Models

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

2 Author(s)
Alfredo Pironti ; Dip. di Autom. e Inf. c.so, Politec. di Torino, Turin ; Riccardo Sisto

When using formal methods, security protocols are usually modeled with a high level of abstraction. In particular, encryption is assumed to be perfect and cryptographic algorithms and their parameters are often abstracted away. This paper states a set of constraints under which, if an abstract protocol model is secure, then a refined model, which takes into account cryptographic algorithms and parameters, is implied to be secure too. The paper also indicates possible exploitations of this result.

Published in:

Dependability of Computer Systems, 2008. DepCos-RELCOMEX '08. Third International Conference on

Date of Conference:

26-28 June 2008