How to Best Share a Big Secret

被引:6
|
作者
Shor, Roman [1 ]
Yadgar, Gala [1 ]
Huang, Wentao [2 ]
Yaakobi, Eitan [1 ]
Bruck, Jehoshua [3 ]
机构
[1] Technion, Comp Sci Dept, Haifa, Israel
[2] Snap Inc, Los Angeles, CA USA
[3] CALTECH, Pasadena, CA 91125 USA
关键词
CODES;
D O I
10.1145/3211890.3211896
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:76 / 88
页数:13
相关论文
共 50 条
  • [1] HOW TO SHARE A SECRET
    SHAMIR, A
    [J]. COMMUNICATIONS OF THE ACM, 1979, 22 (11) : 612 - 613
  • [2] HOW TO SHARE A SECRET
    MIGNOTTE, M
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1983, 149 : 371 - 375
  • [3] How to share a quantum secret
    Cleve, R
    Gottesman, D
    Lo, HK
    [J]. PHYSICAL REVIEW LETTERS, 1999, 83 (03) : 648 - 651
  • [4] HOW TO (REALLY) SHARE A SECRET
    SIMMONS, GJ
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 403 : 390 - 448
  • [5] How to Share a Secret, Infinitely
    Komargodski, Ilan
    Naor, Moni
    Yogev, Eylon
    [J]. THEORY OF CRYPTOGRAPHY, TCC 2016-B, PT II, 2016, 9986 : 485 - 514
  • [6] HOW TO SHARE A SECRET WITH CHEATERS
    TOMPA, M
    WOLL, H
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 263 : 261 - 265
  • [7] How to Share a Secret, Infinitely
    Komargodski, Ilan
    Naor, Moni
    Yogev, Eylon
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (06) : 4179 - 4190
  • [8] How to share a cake with a secret agent
    Cheze, Guillaume
    [J]. MATHEMATICAL SOCIAL SCIENCES, 2019, 100 : 13 - 15
  • [9] How to Share Secret Efficiently over Networks
    Harn, Lein
    Hsu, Ching-Fang
    Xia, Zhe
    Zhou, Junwei
    [J]. SECURITY AND COMMUNICATION NETWORKS, 2017,
  • [10] HOW TO SHARE YOUR BEST ASSET - YOUR EXPERIENCE
    HSIA, P
    [J]. IEEE SOFTWARE, 1991, 8 (06) : 6 - 6