An Experiment in Ping-Pong Protocol Verification by Nondeterministic Pushdown Automata

03/27/2018
by   Robert Glück, et al.
0

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. If it is not, an intruder can reveal secret messages sent between trusted users. The verification is guaranteed to terminate in cubic time at most on a 2NPDA-simulator. The interpretive approach used in this experiment simplifies the verification, by separating the nondeterministic pushdown logic and program control, and makes it more predictable. We describe the interpretive approach and the known transformational solutions, and show they share interesting features. Also noteworthy is how abstract results from automata theory can solve practical problems by programming language means.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/08/2022

Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems

We consider general computational models: one-way and two-way finite aut...
research
08/24/2017

Verification of Programs via Intermediate Interpretation

We explore an approach to verification of programs via program transform...
research
07/08/2020

Certifying Emptiness of Timed Büchi Automata

Model checkers for timed automata are widely used to verify safety-criti...
research
09/06/2017

Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification

This volume contains the proceedings of the Eighth International Symposi...
research
09/07/2018

Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification

This volume contains the proceedings of the Ninth International Symposiu...
research
09/12/2019

Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification

This volume contains the proceedings of the Tenth International Symposiu...
research
09/08/2023

Less Power for More Learning: Restricting OCaml Features for Effective Teaching

We present a framework for sandboxing and restricting features of the OC...

Please sign up or login with your details

Forgot password? Click here to reset