Secret sharing scheme for cloud computing using IDs

Satoshi Takahashi, Shiro Kobayashi, Hyunho Kang, Keiichi Iwamura
{"title":"Secret sharing scheme for cloud computing using IDs","authors":"Satoshi Takahashi, Shiro Kobayashi, Hyunho Kang, Keiichi Iwamura","doi":"10.1109/GCCE.2013.6664911","DOIUrl":null,"url":null,"abstract":"Secret sharing schemes can be used in cloud computing to allow many participants to distribute multiple data. However, the application of (k, n) secret sharing to cloud systems causes a large increase in storage capacity, making it unsuitable for systems with many secrets to distribute. Moreover, using the ramp scheme to reduce the required storage capacity causes gradual information leakage. Therefore, in this paper, we propose a new secret sharing scheme that is computationally secure and can reduce the number of shares. We compare the proposed method with conventional schemes.","PeriodicalId":294532,"journal":{"name":"2013 IEEE 2nd Global Conference on Consumer Electronics (GCCE)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 2nd Global Conference on Consumer Electronics (GCCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCCE.2013.6664911","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Secret sharing schemes can be used in cloud computing to allow many participants to distribute multiple data. However, the application of (k, n) secret sharing to cloud systems causes a large increase in storage capacity, making it unsuitable for systems with many secrets to distribute. Moreover, using the ramp scheme to reduce the required storage capacity causes gradual information leakage. Therefore, in this paper, we propose a new secret sharing scheme that is computationally secure and can reduce the number of shares. We compare the proposed method with conventional schemes.
使用id的云计算秘密共享方案
秘密共享方案可用于云计算,以允许许多参与者分发多个数据。然而,在云系统中应用(k, n)秘密共享会导致存储容量的大量增加,使得它不适合有很多秘密分布的系统。此外,使用斜坡方案来减少所需的存储容量会导致逐渐的信息泄漏。因此,在本文中,我们提出了一种新的秘密共享方案,它在计算上是安全的,并且可以减少共享的数量。我们将所提出的方法与传统方案进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信