一覧に戻る

タイトル
  • en Cross-group Secret Sharing for Secure Cloud Storage Service
作成者
    • en Ke, Chenyutao zh 柯, 陈毓弢
    • 所属 en Graduate School of Information Science and Electrical Engineering, Kyushu University ja 九州大学システム情報科学府情報学専攻
    • en Anada, Hiroaki ja 穴田, 啓晃 ja-Kana アナダ, ヒロアキ
    • 所属 en Institute of Systems, Information Technologies and Nanotechnologies ja 九州先端科学技術研究所
    • en Kawamoto, Junpei ja 川本, 淳平 ja-Kana カワモト, ジュンペイ
    • 所属 en Faculty of Information Science and Electrical Engineering, Kyushu University : Assistant Professor ja 九州大学大学院システム情報科学研究院 : 助教
    • en Morozov, Kirill
    • 所属 en Institute of Mathematics for Industry, Kyushu University : Assistant Professor
    • en Sakurai, Kouichi ja 櫻井, 幸一 ja-Kana サクライ, コウイチ
    • 所属 en Faculty of Information Science and Electrical Engineering, Kyushu University : Professor ja 九州大学大学院システム情報科学研究院 : 教授
アクセス権 open access
主題
  • Other en Storage Service
  • Other en Shamir Secret Sharing
  • Other en Cross-group Secret Sharing
内容注記
  • Abstract en With the spread of the Internet, many mobile devices are used in our daily lives, such as tablets and mobile phones. Then, personal data are often saved on data servers of the storage providers such as Amazon, Google, Yahoo, Baidu and others. In this context, secret sharing can be used to store personal data with several providers, simultaneously reducing the risk of data loss, the data leakage to unauthorized parties, and data falsification. Secret sharing is one of the solutions to combine security and availability in the distributed storage. However, few works considered servers’ affiliations, and specifically, the problem that a malicious provider may recover secret data illegally through manipulation on servers that hold enough shares to recover the secret. In this paper, to resolve the problem, we propose a two-threshold secret sharing scheme in order to enforce a new type of cross-group policy. By combining t-out-of-m providers’ secret sharing scheme and a k-out-of-n servers’ secret sharing scheme via a one-way function or a one-time pad, we construct a scheme that forces k shares to be collected from m groups. Compared with previous work, our scheme can attain the functionalities of proactively updating shares and adding new shares with simple computation.
  • Other en The 10th International Conference on Ubiquitous Information Management and Communication : ACM IMCOM (ICUIMC)2016 : January 4~6, 2016 : Danang, Vietnam
出版者 en ACM
言語
  • eng
資源タイプ conference paper
出版タイプ AM
資源識別子 HDL https://hdl.handle.net/2324/1563374
関連
  • ja http://imcom.org/
収録誌情報
  • en Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication
ファイル
コンテンツ更新日時 2023-12-20