Strand space model to prove the security of cryptographic protocols
Hou Zheng-feng · Journal of Hefei University of Technology · 2005
Formal analysis is an efficient way to prove the security of cryptographic protocols. F. Javier Thayer Fabrega, Jonathan C. Herzog, and Joshua D. Guttman presented a new cryptographic formal model, namely the strand space model,which was based on the Dolev-Yao algebraic model and combined with the advantages of Woo-Lam model, CSP, Schneider's rank function and Paulson induction method. This kind of computing model provided a new method to prove the security of cryptographic protocols. Investigated in this paper are the research background, main research works, architecture and characteristics of the strand space model and its present and further developments.