Ping-Pong Protocols as Prefix Grammars and Turchin Relation

14 pages•Published: July 25, 2013

Abstract

The paper describes how to verify cryptographic protocols by a general-purpose program
transformation technique with unfolding. The questions of representation and analysis
of the protocols as prefix rewriting grammars are discussed. In these aspects Higman and
Turchin embeddings on computational paths are considered, and a refinement of Turchin’s
relation is presented that allows to algorithmically decide the empty word problem for
prefix rewriting grammars.

Keyphrases: cryptographic protocols, ping pong protocols, prefix rewriting, supercompilation, turchin relation

In: Alexei Lisitsa and Andrei Nemytykh (editors). VPT 2013. First International Workshop on Verification and Program Transformation, vol 16, pages 74-87.

Links:	https://easychair.org/publications/paper/ZX
	https://doi.org/10.29007/lw7c

BibTeX entry

@inproceedings{VPT2013:Ping_Pong_Protocols_as,
  author    = {Antonina Nepeivoda},
  title     = {Ping-Pong Protocols as Prefix Grammars and Turchin Relation},
  booktitle = {VPT 2013. First International Workshop on Verification and Program Transformation},
  editor    = {Alexei Lisitsa and Andrei Nemytykh},
  series    = {EPiC Series in Computing},
  volume    = {16},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/ZX},
  doi       = {10.29007/lw7c},
  pages     = {74-87},
  year      = {2013}}

Download PDF Open PDF in browser