This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n12http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n15http://purl.org/net/nknouf/ns/bibtex#
n6http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n11http://linked.opendata.cz/resource/domain/vavai/projekt/
n9http://linked.opendata.cz/ontology/domain/vavai/
n14http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F04%3A00010072%21RIV08-MSM-14330___/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F04%3A00010072%21RIV08-MSM-14330___
rdf:type
n9:Vysledek skos:Concept
dcterms:description
This paper introduces a process calculus with recursion which allows us to express an unbounded number of runs of the ping-pong protocols introduced by Dolev and Yao. We study the decidability issues associated with two common approaches to checking security properties, namely reachability analysis and bisimulation checking. Our main result is that our channel-free and memory-less calculus is Turing powerful, assuming that at least three principals are involved. We also investigate the expressive power of the calculus in the case of two participants. Here, our main results are that reachability and, under certain conditions, also strong bisimilarity become decidable. V clanku je studovano rekurzivni rozsireni tridy kryptografickych protokolu zalozeneho na ping-pong-ovem chovani. Je ukazano, ze dany formalismus je vypocetne ekvivalentni Turingove stroji a pro ruzne podtridy je dokazana rozhodnutelnost jistych verifikacnich problemu. This paper introduces a process calculus with recursion which allows us to express an unbounded number of runs of the ping-pong protocols introduced by Dolev and Yao. We study the decidability issues associated with two common approaches to checking security properties, namely reachability analysis and bisimulation checking. Our main result is that our channel-free and memory-less calculus is Turing powerful, assuming that at least three principals are involved. We also investigate the expressive power of the calculus in the case of two participants. Here, our main results are that reachability and, under certain conditions, also strong bisimilarity become decidable.
dcterms:title
Recursive Ping-Pong Protocols Ping-pong protocoly s rekurzi Recursive Ping-Pong Protocols
skos:prefLabel
Recursive Ping-Pong Protocols Recursive Ping-Pong Protocols Ping-pong protocoly s rekurzi
skos:notation
RIV/00216224:14330/04:00010072!RIV08-MSM-14330___
n3:strany
129-140
n3:aktivita
n17:Z n17:P
n3:aktivity
P(GA201/03/1161), Z(MSM 143300001)
n3:dodaniDat
n16:2008
n3:domaciTvurceVysledku
n18:2753057
n3:druhVysledku
n21:D
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n10:predkladatel
n3:idSjednocenehoVysledku
583865
n3:idVysledku
RIV/00216224:14330/04:00010072
n3:jazykVysledku
n20:eng
n3:klicovaSlova
cryptographic protocols; automated verification; decidability
n3:klicoveSlovo
n7:automated%20verification n7:decidability n7:cryptographic%20protocols
n3:kontrolniKodProRIV
[1AD73BE00E4D]
n3:mistoKonaniAkce
Barcelona, Spain
n3:mistoVydani
Barcelona
n3:nazevZdroje
Proceedings of 4th International Workshop on Issues in the Theory of Security (WITS'04)
n3:obor
n8:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n11:GA201%2F03%2F1161
n3:rokUplatneniVysledku
n16:2004
n3:tvurceVysledku
Huttel, Hans Srba, Jiří
n3:typAkce
n12:WRD
n3:zahajeniAkce
2004-01-01+01:00
n3:zamer
n14:MSM%20143300001
s:numberOfPages
12
n15:hasPublisher
Peter Ryan
n6:organizacniJednotka
14330