Efficient Cryptography for the Next Generation Secure Cloud
Alptekin Kupcu
MAR 08, 2013 08:00 AM
A+ A A-

figure 1

We all benefit from the endless alternatives that cloud provides us regarding our storage, computation, and distribution needs. For example, Dropbox or Wuala store our data in the cloud, so that we can reach it anywhere, anytime. Amazon EC2 and SETI@Home projects let us outsource a computational job that is beyond our computer's capabilities to the cloud. This way, more powerful machines or multiple other computers help us solve the problem. Rapidshare and BitTorrent are pervasive examples that help us distribute the files that we want to share with friends or with the world, easily, without overloading our own resources. Unfortunately, all these benefits are not without any risk!

Do you use Dropbox, Sugarsync, Box, Google Drive, or a similar service? If so, do you know that these companies are not responsible in case of a loss of or modification to your data on their servers? Unfortunately, none of the current cloud storage systems provide any provable guarantees about the integrity of your data. Yet, by using cryptographic techniques, it is possible to check for the integrity of the stored data, and get an appropriate proof.

Cloud storage systems (such as PDP, POR, CompactPOR, ScalablePDP, DPDP, PORAM) keep a very small amount of local information about your data in the cloud. Using this information, you may easily update your data, and hence obtain the corresponding updated local information. Whenever you would like to, you may challenge the server to prove to you that your data is still kept intact. If the proof fails when verified with your local data, this means the server has corrupted or lost your data, and hence you may contact a judge at an official court and ask for the payment of a warranty amount. You do not even need to wait in queues outside court houses: The judge can be an automated computer, and even the payments can be made online. Such systems are currently under prototype implementation phase funded by various cloud companies, and thus we may expect to see real deployments soon.

Have you ever participated as a contractor in a cloud computation project such as SETI@Home, Folding@Home, or Electric Sheep? Did you ever try to send a fake result just to improve your reputation? Did you wonder how those people at the top of the list manage to perform so well? Again, current outsourced computation systems have no mechanisms to guarantee correctness of the results. Using cryptography, together with game theory and mechanism design techniques, a very high level of guarantee on the correctness of the returned result can be provided, even if some contractors try to cheat.

Once in a while, you would like to be the boss: you want to outsource a computation job. There is no doubt that you would like to obtain guaranteed correct results. Since the existing systems do not provide you with such a warranty, you decide to use a secure system such as the one due to Belenkiy et al. Parameters of this outsourcing system can be tweaked such that you decide on the level of guaranteed correctness; whether you want it 99% correct, or 99.9% correct, or even more. Furthermore, this system allows you to reward honest contractors giving you the correct results, and fine malicious contractors who try to cheat.

figure 2

Have you ever used BitTorrent, Kazaa, Napster, etc. for downloading files? Don't you always stop uploading whenever you receive the whole file? One of the reasons your download is not as fast as it can be is that many people do the same: These free-riders choose to stop uploading a file whenever their download is complete. Mostly, people stop contributing to a system as soon as they obtain all the service they want to. Only altruistic participants continue contributing to the system, without expecting a reward in return. Using cryptographic fair exchange techniques, it is possible to guarantee that everyone contributes to the system as much as they download, thus increasing the system efficiency and speed by increasing contribution.

In a fair exchange scenario, we have two parties, Alice and Bob, who have one item each (e.g., files) that they would like to exchange. Fairness means either Alice obtains Bob's file and Bob obtains Alice's file, or neither party obtains anything. Applying the fair exchange idea to BitTorrent means that one needs to participate in uploading, to be able to download. This solves the free-riding problem of BitTorrent, forcing all downloaders to participate and upload, thereby increasing overall efficiency of the system. An efficient fair exchange system by Küpçü and Lysyanskaya has been shown to scale well even in high-churn applications, and is available online as part of the open source Cashlib cryptographic library.

figure 3

Cryptography can make unimaginable things possible…

Alptekin Kupc

Alptekin Küpçü has received his Ph.D. degree from Brown University Computer Science Department in 2010. Since then, he has been working as an assistant professor at Koç University College of Engineering, leading the Cryptography, Security & Privacy Research Group he has founded. His research mainly focuses on applied cryptography, and its intersection with cloud security, privacy, peer-to-peer networks, and mechanism design. He has also led the development of the Cashlib cryptographic library available online. He has various honors and awards, and several pending patent applications. Within the past 2 years, he has been involved in 6 funded research projects, 4 of which he has been the principal investigator. For more information, visit http://crypto.ku.edu.tr.

References:

  • [Book] Alptekin Küpçü. "Efficient Cryptography for the Next Generation Secure Cloud: Protocols, Proofs, and Implementation". Lambert Academic Publishing, 2010.
  • [Cashlib] Sarah Meiklejohn, Chris Erway, Alptekin Küpçü, Theodora Hinkle, and Anna Lysyanskaya. "ZKPDL: Enabling Efficient Implementation of Zero-Knowledge Proofs and Electronic Cash". In proceedings of USENIX Security, 2010. http://github.com/brownie/cashlib
  • [CloudComputation] Mira Belenkiy, Melissa Chase, Chris Erway, John Jannotti, Alptekin Küpçü, and Anna Lysyanskaya. "Incentivizing Outsourced Computation". In proceedings of NetEcon, 2008.
  • [CompactPOR] Hovav Shacham and Brent Waters. "Compact Proofs of Retrievability". In proceedings of ASIACRYPT, 2008.
  • [DPDP] Chris Erway, Alptekin Küpçü, Charalampos Papamanthou, and Roberto Tamassia. "Dynamic Provable Data Possession." In proceedings of ACM CCS, 2009.
  • [FairExchange] Alptekin Küpçü and Anna Lysyanskaya. "Usable Optimistic Fair Exchange". In proceedings of CT-RSA, 2010.
  • [FairExchangeJournal] Alptekin Küpçü and Anna Lysyanskaya. "Usable Optimistic Fair Exchange". Computer Networks, 2012, vol. 56, pp. 50-63.
  • [PDP] Giuseppe Ateniese, Randal Burns, Reza Curtmola, Joseph Herring, Lea Kissner, Zachary Peterson, and Dawn Song. "Provable Data Possession at Untrusted Stores". In proceedings of ACM CCS, 2007.
  • [POR] Ari Juels and Burton S. Kaliski. "PORs: Proofs of Retrievability for Large Files". In proceedings of ACM CCS, 2007.
  • [PORAM] David Cash, Alptekin Küpçü, and Daniel Wichs. "Dynamic Proofs of Retrievability via Oblivious RAM". In proceedings of EUROCRYPT, 2013.
  • [ScalablePDP] Giuseppe Ateniese, Roberto Di Pietro, Luigi V. Mancini, and Gene Tsudik. "Scalable and Efficient Provable Data Possession". In proceedings of SecureComm, 2008.
FIRST
PREV
NEXT
LAST
Page(s):
[%= name %]
[%= createDate %]
[%= comment %]
Share this:
Please login to enter a comment:
 

Computing Now Blogs
Business Intelligence
by Keith Peterson
Cloud Computing
A Cloud Blog: by Irena Bojanova
The Clear Cloud: by STC Cloud Computing
Careers
Computing Careers: by Lori Cameron
Display Technologies
Enterprise Solutions
Enterprise Thinking: by Josh Greenbaum
Healthcare Technologies
The Doctor Is In: Dr. Keith W. Vrbicky
Heterogeneous Systems
Hot Topics
NealNotes: by Neal Leavitt
Industry Trends
The Robotics Report: by Jeff Debrosse
Internet Of Things
Sensing IoT: by Irena Bojanova

 

RESET