DocumentCode :
3315661
Title :
Computational Rationality of Formal Analysis on Cryptographic Protocols
Author :
Liu, Simin ; Ye, Junyao
Author_Institution :
Coll. of Inf. Eng., Jingdezhen Ceramic Inst., Jingdezhen, China
fYear :
2012
fDate :
17-19 Aug. 2012
Firstpage :
904
Lastpage :
907
Abstract :
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.
Keywords :
cryptographic protocols; Abadi-Rowgaway; computational rationality theorem; cryptographic protocols; formal definition; formal encrypt; group key distribution protocol; Computational modeling; Cryptographic protocols; Encryption; Law; Communication Protocols; Computational Rationality; Cryptography; Formal Analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational and Information Sciences (ICCIS), 2012 Fourth International Conference on
Conference_Location :
Chongqing
Print_ISBN :
978-1-4673-2406-9
Type :
conf
DOI :
10.1109/ICCIS.2012.111
Filename :
6300530
Link To Document :
بازگشت