Computationally secure robust multi-secret sharing for general access structure

Angsuman Das, Partha Sarathi Roy, Avishek Adhikari

研究成果: 著書/レポートタイプへの貢献会議での発言

1 引用 (Scopus)

抜粋

Secret sharing scheme plays a crucial role in distributed cryptosystems. Due to its extensive use in numerous applications, an important goal in this area is to minimize trust among the participants. To remove this bottleneck, robust secret sharing, which allows the correct secret to be recovered even when some of the shares presented during an attempted reconstruction are incorrect, can be an efficient tool. However, as unconditional security demands honest majority and share size to be at least equal to the size of the secret, the need for computational security of such schemes has been felt over the years, specially in case of multi-secret sharing schemes. In this paper, we provide a notion of computationally robust multi-secret sharing scheme for general access structure. We also propose a robust multi-secret sharing scheme for general access structure and prove its computational security under the proposed notation.

元の言語英語
ホスト出版物のタイトルMathematics and Computing - ICMC 2015
編集者Debasis Giri, Ram N. Mohapatra, Dipanwita Roy Chowdhury
出版者Springer New York LLC
ページ123-134
ページ数12
139
ISBN(印刷物)9788132224518
DOI
出版物ステータス出版済み - 1 1 2015
イベント2nd International Conference on Mathematics and Computing, ICMC 2015 - Haldia, インド
継続期間: 1 5 20151 10 2015

その他

その他2nd International Conference on Mathematics and Computing, ICMC 2015
インド
Haldia
期間1/5/151/10/15

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

これを引用

Das, A., Roy, P. S., & Adhikari, A. (2015). Computationally secure robust multi-secret sharing for general access structure. : D. Giri, R. N. Mohapatra, & D. R. Chowdhury (版), Mathematics and Computing - ICMC 2015 (巻 139, pp. 123-134). Springer New York LLC. https://doi.org/10.1007/978-81-322-2452-5_9