Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Reasoning About Secrecy for Active Networks
 

Summary: Reasoning About Secrecy
for Active Networks
Pankaj Kakkar
University of Pennsylvania
pankaj@gradient.cis.upenn.edu
Carl A. Gunter
University of Pennsylvania
gunter@cis.upenn.edu
Martn Abadi
University of California, Santa Cruz
abadi@soe.ucsc.edu
Abstract
In this paper we develop a language of mobile agents called uPLAN
for describing the capabilities of active (programmable) networks. We use
a formal semantics for uPLAN to demonstrate how capabilities provided
for programming the network can a ect the potential ows of information
between users. In particular, we formalize a concept of security against
attacks on secrecy by an `outsider' and show how basic protections are
preserved in the presence of programmable network functions.
1 Introduction

  

Source: Abadi, Martín - Department of Computer Science, University of California at Santa Cruz

 

Collections: Computer Technologies and Information Sciences