CaltechAUTHORS
  A Caltech Library Service

How to Best Share a Big Secret

Shor, Roman and Yadgar, Gala and Huang, Wentao and Yaakobi, Eitan and Bruck, Jehoshua (2018) How to Best Share a Big Secret. In: Proceedings of the 11th ACM International Systems and Storage Conference. Association for Computing Machinery , New York, NY, pp. 76-88. ISBN 978-1-4503-5849-1. https://resolver.caltech.edu/CaltechAUTHORS:20180828-142513016

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20180828-142513016

Abstract

When sensitive data is stored in the cloud, the only way to ensure its secrecy is by encrypting it before it is uploaded. The emerging multi-cloud model, in which data is stored redundantly in two or more independent clouds, provides an opportunity to protect sensitive data with secret-sharing schemes. Both data-protection approaches are considered computationally expensive, but recent advances reduce their costs considerably: (1) Hardware acceleration methods promise to eliminate the computational complexity of encryption, but leave clients with the challenge of securely managing encryption keys. (2) Secure RAID, a recently proposed scheme, minimizes the computational overheads of secret sharing, but requires non-negligible storage overhead and random data generation. Each data-protection approach offers different tradeoffs and security guarantees. However, when comparing them, it is difficult to determine which approach will provide the best application-perceived performance, because previous studies were performed before their recent advances were introduced. To bridge this gap, we present the first end-to-end comparison of state-of-the-art encryption-based and secret sharing data protection approaches. Our evaluation on a local cluster and on a multi-cloud prototype identifies the tipping point at which the bottleneck of data protection shifts from the computational overhead of encoding and random data generation to storage and network bandwidth and global availability.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1145/3211890.3211896DOIArticle
ORCID:
AuthorORCID
Huang, Wentao0000-0003-0963-3624
Additional Information:© 2018 Association for Computing Machinery.
Record Number:CaltechAUTHORS:20180828-142513016
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20180828-142513016
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:89260
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:28 Aug 2018 22:34
Last Modified:03 Oct 2019 20:14

Repository Staff Only: item control page