By Topic

Computational Rationality of Formal Analysis on Cryptographic Protocols

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

2 Author(s)
Simin Liu ; Coll. of Inf. Eng., Jingdezhen Ceramic Inst., Jingdezhen, China ; Junyao Ye

This paper describes and discusses the computational rationality of formal analysis on cryptographic protocols, which is based on the computational rationality theorem of formal encrypt on Abadi-Rowgaway. Analysis of group key distribution protocol shows that the theorem has strong analytical ability to the protocols alternative attacks. The paper presents formal methods on group key distribution protocols, and the formal definition of security in the computational method. Finally, it proves its rationality.

Published in:

Computational and Information Sciences (ICCIS), 2012 Fourth International Conference on

Date of Conference:

17-19 Aug. 2012