Monotonic set-extended prefix rewriting and verification of recursive ping-pong protocols

Authors:
Giorgio Delzanno;Javier Esparza;Jiří Srba
Affiliations:
Dipartimento di Informatica e Scienze dell'Informazione, Università di Genova, Italy;Institut für Formale Methoden der Informatik, Universität Stuttgart, Germany;BRICS, Department of Computer Science, Aalborg University, Denmark
Venue:
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Year:
2006

Citing 12
Cited 0

Concurrent constraint programming

Concurrent constraint programming
Unreliable channels are easier to verify than perfect channels

Information and Computation
Weak alternating automata are not that weak

ACM Transactions on Computational Logic (TOCL)
On the symbolic reduction of processes with cryptographic functions

Theoretical Computer Science
A bisimulation method for cryptographic protocols

Nordic Journal of Computing
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
On Name Generation and Set-Based Analysis in the Dolev-Yao Model

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
On the Decidability of Cryptographic Protocols with Open-Ended Data Structures

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Efficient Algorithms for Model Checking Pushdown Systems

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Protocol insecurity with a finite number of sessions and composed keys is NP-complete

Theoretical Computer Science
Recursion versus replication in simple cryptographic protocols

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e. by adding an active intruder capable of storing all exchanged messages including full analysis and synthesis of messages) some verification problems become decidable. In particular we give an algorithm to decide control state reachability, a problem related to security properties like secrecy and authenticity. The proof is via a reduction to a new prefix rewriting model called Monotonic Set-extended Prefix rewriting (MSP). We demonstrate further applicability of the introduced model by encoding a fragment of the ccp (concurrent constraint programming) language into MSP.