Towards a theory of universally composable cloud computing

1Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper studies universally composable Cloud computing and makes the following two-fold contributions - In the first fold, various notions of Clouds are introduced and formalized. The security of public Cloud computing is formalized within the standard secure computations framework. - In the second, a universally composable theorem of Cloud computing in the presence of monotone adversary structure within Canetti's universally composable framework is presented and analyzed. Our contribution possibly bridges security gaps between the industrial views of Clouds and that of theoretical researchers. © 2009 Springer-Verlag.

Cite

CITATION STYLE

APA

Zhu, H. (2009). Towards a theory of universally composable cloud computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5931 LNCS, pp. 638–643). https://doi.org/10.1007/978-3-642-10665-1_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free