An experiment in ping-pong protocol verification by nondeterministic pushdown automata

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt


An experiment is described that confirms the security of a well-studied class of cryptographic protocols(Dolev-Yao intruder model) can be verified by two-way nondeterministic pushdown automata(2NPDA). A nondeterministic pushdown program checks whether the intersection of a regular language(the protocol to verify) and a given Dyck language containing all canceling words is empty. Ifit is not, an intruder can reveal secret messages sent between trusted users. The verification is guaranteedto terminate in cubic time at most on a 2NPDA-simulator. The interpretive approach used in thisexperiment simplifies the verification, by separating the nondeterministic pushdown logic and programcontrol, and makes it more predictable. We describe the interpretive approach and the knowntransformational solutions, and show they share interesting features. Also noteworthy is how abstractresults from automata theory can solve practical problems by programming language means.
TitelProceedings Third Workshop on Models for Formal Analysis of Real Systems and Sixth International Workshop on Verification and Program Transformation. Proceedings
RedaktørerJohn P. Gallagher, Rob van Glabbeek, Wendelin Serwe
ForlagOpen Publishing Association
StatusUdgivet - 2018
Begivenhed6th International Workshop on Verification and Program Transformation - Thessaloniki, Grækenland
Varighed: 20 apr. 2018 → …


Workshop6th International Workshop on Verification and Program Transformation
Periode20/04/2018 → …
NavnElectronic Proceedings in Theoretical Computer Science

Antal downloads er baseret på statistik fra Google Scholar og

Ingen data tilgængelig

ID: 194063040