On the Protocol Composition Logic PCL
| dc.creator | Cremers, Cas | |
| dc.date | 2007-09-07 | |
| dc.date | 2008-02-22 | |
| dc.date.accessioned | 2026-07-07T09:22:11Z | |
| dc.date.available | 2026-07-07T09:22:11Z | |
| dc.description | A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of the logic, as defined in [DDMP05,HSD+05,He05,Dat05,Der06,DDMR07]. The identified problems imply strong restrictions on the scope of PCL, and imply that some currently claimed PCL proofs cannot be proven within the logic, or make use of unsound axioms. Where possible, we propose solutions for these problems. | |
| dc.identifier | https://arxiv.org/abs/0709.1080 | |
| dc.identifier | http://arxiv.org/abs/0709.1080 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/155290 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Logic in Computer Science | |
| dc.title | On the Protocol Composition Logic PCL | |
| dc.type | text |