Sandboxing in a Distributed Pi-Calculus
Publikation: Forskning - peer review › Konferenceartikel i proceeding
Standard
Sandboxing in a Distributed Pi-Calculus. / Hüttel, Hans; Kühnrich, Morten.
WITS 2006. red. / Dieter Gollmann; Jan Jürjens. 2006. s. 114-128.Publikation: Forskning - peer review › Konferenceartikel i proceeding
Harvard
APA
CBE
MLA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - Sandboxing in a Distributed Pi-Calculus
A1 - Hüttel,Hans
A1 - Kühnrich,Morten
AU - Hüttel,Hans
AU - Kühnrich,Morten
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
KW - sikkerhed
KW - pi-kalkyle
KW - type systems
KW - security
KW - pi-calculus
KW - type systems
BT - WITS 2006
T2 - WITS 2006
A2 - Jürjens,Jan
ED - Jürjens,Jan
SP - 114
EP - 128
ER -