- Differential Privacy for Collaborative Security Jason Reed, Adam J. Aviv, Daniel Wagner, Andreas Haeberlen, Benjamin Pierce, and Jonathan M. Smith. In proceedings of, EUROSEC'10. April 2010.
Diverse independent subsystems of the internet can benefit from sharing information about common security threats: botnets, worms, and other malicious phenomena can be better understood, detected, and mitigated with a global perspective on network statistics. However, for privacy reasons, service providers cannot indiscriminately publish all of their data, and straightforward anonymization schemes are unreliable. Building on theoretical work in differential privacy mechanisms, we propose a programming model for highly expressive queries about aggregate network behavior that affords strong statistical privacy guarantees and give examples of how it can enable information sharing toward the goal of network security.
- Distance Makes the Types Grow Stronger: A Calculus for Differential Privacy Jason Reed and Benjamin Pierce. ACM SIGPLAN International Conference on Functional Programming (ICFP), Baltimore, Maryland, September 2010. short version
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. differential privacy offers a strong statistical guarantee that the effect of the presence of any individual in a database will be negligible, even when an adversary has auxiliary knowledge. Much of the prior work in this area consists of proving algorithms to be differentially private one at a time; we propose to streamline this process with a functional language whose type system automatically guarantees differential privacy, allowing the programmer to write complex privacy-safe query programs in a flexible and compositional way.
The key novelty is the way our type system captures function sensitivity, a measure of how much a function can magnify the distance between similar inputs: well-typed programs not only can't go wrong, they can't go too far on nearby inputs. Moreover, by introducing a monad for random computations, we can show that the established definition of differential privacy falls out naturally as a special case of this soundness principle. We develop examples including known differentially private algorithms, privacy-aware variants of standard functional programming idioms, and compositionality principles for differential privacy.
- Frenetic: A high-level language for OpenFlow networks Nate Foster, Rob Harrison, Matthew L. Meola, Michael J. Freedman, Jennifer Rexford, and David Walker. Routers for the Extensible Services of Tomorrow, December 2010.
Most interfaces for programming network devices are defined at the low level of abstraction supported by the underlying hardware, which leads to complicated programs that are prone to errors. This paper proposes a high-level programming language for OpenFlow networks based on ideas originally developed in the functional programming community. Our language, called Frenetic, includes a rich pattern algebra for classifying packets, a “program like you see every packet” abstraction, and a run-time system that automatically generates the low-level packet-processing rules. We describe the design and implementation of Frenetic, and show how to use it to implement common management tasks
- Frenetic: A high-level language for OpenFlow networks Nate Foster, Rob Harrison, Michael J. Freedman, Jennifer Rexford, and David Walker. Computing and Information Science Technical Reports. December 2010
Network administrators must configure network devices to simultaneously provide several interrelated services such as routing, load balancing, traffic monitoring, and access control. Unfortunately, most interfaces for programming networks are defined at the low level of abstraction supported by the underlying hardware, leading to complicated programs with subtle bugs. We present Frenetic, a high-level language for OpenFlow networks that enables writing programs in a declarative and compositional style, with a simple "program like you see every packet" abstraction. Building on ideas from functional programming, Frenetic offers a rich pattern algebra for classifying packets into traffic streams and a suite of operators for transforming streams. The run-time system efficiently manages the low-level details of (un)installing packet-processing rules in the switches. We describe the design of Frenetic, an implementation on top of OpenFlow, and experiments and example programs that validate our design choices.