Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CSFW
2000
IEEE

favoriteEmaildiscussreport

131views Security Privacy» more CSFW 2000»

Reasoning about Secrecy for Active Networks

13 years 9 months ago

Reasoning about Secrecy for Active Networks

Download seclab.uiuc.edu

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.

Pankaj Kakkar, Carl A. Gunter, Martín Abadi

Real-time Traffic

CSFW 2000 | Formal Semantics | Mobile Agents | Programmable Network Functions | Security Privacy |

claim paper

Related Content

» Reasoning About Active Network Protocols

» Secrecy Analysis in Protocol Composition Logic

» Secrecy in Untrusted Networks

» Representing and Reasoning about Motion in a TwoDimensional World

» Tor The SecondGeneration Onion Router

» Event Modelling and Reasoning with Uncertain Information for Distributed Sensor Networks

» Towards Activity Databases Using Sensors and Statistical Models to Summarize Peoples Lives

» Active Data Selection for Sensor Networks with Faults and Changepoints

» Plan in Maude Specifying an Active Network Programming Language

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2000
Where	CSFW
Authors	Pankaj Kakkar, Carl A. Gunter, Martín Abadi

Comments (0)