2007•Computer Engineering and Applications JournalRequires access
Computational soundness of formal analysis of cryptographic protocols
Han Ji-hong, Pla Air
Open publisher page 0 citations
Abstract
Based on the Abadi-Rowgaway computational soundness theorem of formal encryption,this paper proposes and proves our computational soundness theorem of formal analysis of cryptographic protocols.Through the analysis for group key distribution protocols,our soundness theorem is stronger and powerful in adaptive attacks.This paper proposes formal definitions of security for group key distribution protocols both in the formal methods and the computational methods,then proves soundness of the formal definition.