A method of model-checking is proposed based on propositional projection temporal logic(PPTL)to verify the security of unconditional security communication protocols
in particular the Russian Cards protocols. The protocol model is built up in ProMeLa language according to the rules of constructing Russian Cards protocol that are given in our previous work. The security properties are defined by PPTL
that is
the chop operator is used to compose interactive events sequentially and to formalize the expected communication sequence
and the projection operator is employed to express the security properties over the sequence. Then the PPTL properties are transformed into Never Claim structures. The verification is done in a widely-used model checker-SPIN with the ProMeLa model and the Never Claim properties as the inputs. Experimental results show that Russian Cards protocols constructed using the protocol rules are safe and reliable. The model-checking method is also applicable in verifying ordinary unconditional security communication protocols.
关键词
Keywords
references
DUAN Zhenhua, YANG Chen. Unconditional secure communication: a Russian Cards protocol [J]. Journal of Combinatorial Optimization, 2010, 19(4): 501-530.
CLARKE E M, EMERSON E A, SISTLA A P. Automatic verification of finite-state concurrent systems using temporal logic specifications [J]. ACM Transactions on Programming Languages and Systems, 1986, 8(2): 244-263.
HOLZMANN G J. The spin model checker: primer and reference manual [M]. Reading, Mass, USA: Addison-Wesley, 2003.
VAN DITMARSCH H P, VAN DER HOEK W, VANDER MEYDEN R, et al. Model checking Russian Cards [J]. Electronic Notes in Theoretical Computer Science, 2006,149(2):105-123.
DUAN Zhenhua. Temporal logic and temporal logic programming [M]. Beijing, China: Science Press of China, 2006.
WANG Xiaobing, DUAN Zhenhua. Projection temporal logic oriented model checking for web services [J]. Journal of Xi'an Jiaotong University, 2009, 43(4): 39-44.
DUAN Zhenhua, TIAN Cong, ZHANG Li. A decision procedure for propositional projection temporal logic with infinite models [J]. Acta Informatica, 2008,45(1): 43-78.