Abstract
This paper presents an extension of the Dpi-calculus due to Hennessy and Riely with constructs for signing and authenticating code and for sandboxing. A sort system, built on Milner's sort systems for the polyadic pi-calculus, is presented and proven sound with respect to an error predicate which ensures that errors do not occur outside sandboxes and that authentication and migration only happen when allowed. Futhermore a weak subject reduction result involving partial well sortedness is presented.
| Originalsprog | Engelsk |
|---|---|
| Titel | WITS 2006 |
| Redaktører | Dieter Gollmann, Jan Jürjens |
| Antal sider | 15 |
| Publikationsdato | 2006 |
| Sider | 114-128 |
| Status | Udgivet - 2006 |
| Begivenhed | 6th International Workshop on Issues in the Theory of Security (WITS '06) - Wien, Østrig Varighed: 25 mar. 2006 → 26 mar. 2006 |
Konference
| Konference | 6th International Workshop on Issues in the Theory of Security (WITS '06) |
|---|---|
| Land/Område | Østrig |
| By | Wien |
| Periode | 25/03/2006 → 26/03/2006 |
Emneord
- sikkerhed
- pi-kalkyle
- type systems