Private Processing of Outsourced Network Functions
Open Access
- 11 March 2016
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 2015, 39-44
Abstract
Aiming to reduce the cost and complexity of maintaining networking infrastructures, organizations are increasingly outsourcing their network functions (e.g., firewalls, traffic shapers and intrusion detection systems) to the cloud, and a number of industrial players have started to offer network function virtualization (NFV)-based solutions. Alas, outsourcing network functions in its current setting implies that sensitive network policies, such as firewall rules, are revealed to the cloud provider. In this paper, we investigate the use of cryptographic primitives for processing outsourced network functions, so that the provider does not learn any sensitive information. More specifically, we present a cryptographic treatment of privacy-preserving outsourcing of network functions, introducing security definitions as well as an abstract model of generic network functions, and then propose a few instantiations using partial homomorphic encryption and public-key encryption with keyword search. We include a proof-of-concept implementation of our constructions and show that network functions can be privately processed by an untrusted cloud provider in a few milliseconds.Comment: A preliminary version of this paper appears in the 1st ACM International Workshop on Security in Software Defined Networks & Network Function Virtualization. This is the full versioKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- BlindBox2015
- Cryptanalysis of the Multilinear Map over the Integers2015
- Practical Multilinear Maps over the Integers2013
- Making middleboxes someone else's problem2012
- OpenFlowACM SIGCOMM Computer Communication Review, 2008
- Structured firewall designComputer Networks, 2007
- Evaluating 2-DNF Formulas on Ciphertexts2005
- Public Key Encryption with Keyword Search2004
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970