Algorithmic aspects of some protocol verification logics

dc.contributor.authorVályi, Sándor
dc.contributor.authorKödmön, József
dc.contributor.authorTakács, Pélter
dc.date.accessioned2012-06-07T07:48:10Z
dc.date.available2012-06-07T07:48:10Z
dc.date.conferenceend2007-06-24
dc.date.conferencestart2007-06-22
dc.date.issued2012-06-07
dc.description.abstractWe show that 1. in first-order modal logic of Coffey and Saidha, it is undecidable whether a given protocol specification is valid 2. The language of valid protocol specifications is not even recursively enumerable over integer time 3. Over dense time it is recursively enumerable. We also give a semantics for that logic.en_US
dc.description.citySmoleniceen_US
dc.description.conferencetypeInternationalen_US
dc.description.countrySlovenskoen_US
dc.identifier.urihttp://hdl.handle.net/123456789/41
dc.language.isoenen_US
dc.subjectcryptographyen_US
dc.subjectundecidabilityen_US
dc.titleAlgorithmic aspects of some protocol verification logicsen_US
dc.title.conference7th Central European Conference on Cryptologyen_US
dc.type.classLectureen_US
dc.type.specificationScientificen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
t.pdf
Size:
77.58 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: