Cryptology ePrint Archive: Report 2018/602

On the Universally Composable Security of OpenStack

Kyle Hogan and Hoda Maleki and Reza Rahaeimehr and Ran Canetti and Marten van Dijk and Jason Hennessey and Mayank Varia and Haibin Zhang

Abstract: OpenStack is the prevalent open-source, non-proprietary package for managing cloud services and data centers. It is highly complex and consists of multiple inter-related components which are developed by separate, loosely coordinated groups. We initiate an effort to provide a rigorous and holistic security analysis of OpenStack. Our analysis has the following key features:

-It is user-centric: It stresses the security guarantees given to users of the system, in terms of privacy, correctness, and timeliness of the services.

-It provides defense in depth: It considers the security of OpenStack even when some of the components are compromised. This departs from the traditional design approach of OpenStack, which assumes that all services are fully trusted.

-It is modular: It formulates security properties for individual components and uses them to assert security properties of the overall system.

We base our modeling and security analysis in the universally composable (UC) security framework, which has been so far used mainly for analyzing security of cryptographic protocols. Indeed, demonstrating how the UC framework can be used to argue about security-sensitive systems which are mostly non-cryptographic in nature is another main contribution of this work.

Our analysis covers only a number of core components of OpenStack. Still, it uncovers some basic and important security trade-offs in the design. It also naturally paves the way to a more comprehensive analysis of OpenStack.

Category / Keywords: applications / Modular Security Analysis, Universal Composability, Cloud Security, OpenStack

Date: received 13 Jun 2018, last revised 10 Aug 2018

Contact author: reza rahaeimehr at uconn edu

Available format(s): PDF | BibTeX Citation

Note: The order of the authors is alphabetical among the first three authors, and again alphabetical among the remaining authors. Indeed, the first three authors contributed signi cantly more to the paper than the other ones.

Version: 20180810:163613 (All versions of this report)

Short URL: ia.cr/2018/602


[ Cryptology ePrint archive ]