Algorithmic aspects of some protocol verification logics
| dc.contributor.author | Vályi, Sándor | |
| dc.contributor.author | Ködmön, József | |
| dc.contributor.author | Takács, Pélter | |
| dc.date.accessioned | 2012-06-07T07:48:10Z | |
| dc.date.available | 2012-06-07T07:48:10Z | |
| dc.date.conferenceend | 2007-06-24 | |
| dc.date.conferencestart | 2007-06-22 | |
| dc.date.issued | 2012-06-07 | |
| dc.description.abstract | We 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.city | Smolenice | en_US |
| dc.description.conferencetype | International | en_US |
| dc.description.country | Slovensko | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/41 | |
| dc.language.iso | en | en_US |
| dc.subject | cryptography | en_US |
| dc.subject | undecidability | en_US |
| dc.title | Algorithmic aspects of some protocol verification logics | en_US |
| dc.title.conference | 7th Central European Conference on Cryptology | en_US |
| dc.type.class | Lecture | en_US |
| dc.type.specification | Scientific | en_US |