Most of the past results can be found in the phd thesis of Alptekin Küpçü titled "Efficient Cryptography for the Next Generation Secure Cloud", done at Brown University.
The book version is available from multiple sellers, including the following:
A presentation video is available as recorded at Microsoft Research.
Abstract of "Eﬃcient Cryptography for the Next Generation Secure Cloud" by Alptekin Küpçü.
Peer-to-peer (P2P) systems, and client-server type storage and computation outsourcing constitute some of the major applications that the next generation cloud schemes will address. Since these applications are just emerging, it is the perfect time to design them with security and privacy in mind. Furthermore, considering the high-churn characteristics of such systems, the cryptographic protocols employed must be eﬃcient and scalable. This thesis shows that cryptography can be used to eﬃciently and scalably provide security and privacy for the next generation cloud systems.
We start by describing an eﬃcient and scalable fair exchange protocol that can be used for exchanging ﬁles between participants of a P2P ﬁle sharing system. In this system, there are two central authorities that we introduce: the arbiter and the bank. We then try distributing these entities to reduce trust assumptions and to improve performance. Our work on distributing the arbiter leads to impossibility results, whereas our work on distributing the bank leads to a more general cloud computation result showing how a boss can employ untrusted contractors, and ﬁne or reward them. We then consider cloud storage scenario, where the client outsources storage of her ﬁles to an untrusted server. We show how the client can challenge the server to prove that her ﬁle is kept intact, even when the ﬁles are dynamic. Next, we provide an agreement protocol for a dynamic message, where two parties agree on the latest version of a message that changes over time. We then apply this agreement protocol to the cloud storage setting and show how a judge can arbitrate between the client and the server oﬃcially based on the agreed-upon message and the proof sent by the server. Lastly, we show that all our solutions are eﬃcient and scalable by presenting results from the cryptographic library we implemented.