Verification of Multi-Party Ping-Pong Protocols via Program Transformation
The paper describes a verification technique based on program transformation with unfolding that allows to find short attacks on multi-party ping-pong protocols in the Dolev-Yao intruder model. Protocols are modelled by prefix grammars, and questions of model optimization and complexity are considered.
2016 ◽
Vol 85
(5)
◽
pp. 782-804
◽
Keyword(s):
2020 ◽
Vol 16
(1)
◽
pp. 48
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
1976 ◽
Vol 174
(2)
◽
pp. 592-602
◽