Recursion vs. Replication in Simple Cryptographic Protocols

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskning

463 Downloads (Pure)

Abstract

We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we show that all nontrivial properties, including reachability and equivalence checking wrt. the whole van Glabbeek's spectrum, become undecidable for a very simple recursive extension of the protocol. The result holds even if no nondeterministic choice operator is allowed. We also show that the extended calculus is capable of an implicit description of the active intruder, including full analysis and synthesis of messages in the sense of Amadio, Lugiez and Vanackere. We conclude by showing that reachability analysis for a replicative variant of the protocol becomes decidable.
OriginalsprogEngelsk
TitelAnnual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'05)
Antal sider10
Publikationsdato2005
Sider175-184
StatusUdgivet - 2005
Begivenhed31st Annual Conference on Current Trends in Theory and Practice of Informatics, 22.-28. januar 2005 - Liptovsky Mikulas, Slovakiet, Slovakiet
Varighed: 19 maj 2010 → …
Konferencens nummer: 31

Konference

Konference31st Annual Conference on Current Trends in Theory and Practice of Informatics, 22.-28. januar 2005
Nummer31
Land/OmrådeSlovakiet
ByLiptovsky Mikulas, Slovakiet
Periode19/05/2010 → …

Bibliografisk note

Serie: LNCS, Springer-Verlag, 3381

Emneord

  • kryptografiske protokoller
  • proceskalkyler
  • afgørbarhed

Fingeraftryk

Dyk ned i forskningsemnerne om 'Recursion vs. Replication in Simple Cryptographic Protocols'. Sammen danner de et unikt fingeraftryk.

Citationsformater