Reasoning about secrecy for active networks

Authors:
Pankaj Kakkar;Carl A. Gunter;Martín Abadi
Affiliations:
Computer and Information Science Department, University of Pennsylvania, Philadelphia, PA;Computer and Information Science Department, University of Pennsylvania, Philadelphia, PA;Computer Science Department, University of California, Santa Cruz, CA
Venue:
Journal of Computer Security - CSFW13
Year:
2003

Citing 11
Cited 0

Data networks

Data networks
The chemical abstract machine

Selected papers of the Second Workshop on Concurrency and compositionality
Active bridging

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
PLAN: a packet language for active networks

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
A calculus for cryptographic protocols

Information and Computation
Secrecy by typing in security protocols

Journal of the ACM (JACM)
Activating Networks: A Progress Report

Computer
A Secure Plan

IWAN '99 Proceedings of the First International Working Conference on Active Networks
Using the domain name system for system break-ins

SSYM'95 Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5
A survey of active network research

IEEE Communications Magazine
A secure active network environment architecture: realization in SwitchWare

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

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 affect the potential flows 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.