Computationally secure robust multi-secret sharing for general access structure

Angsuman Das, Partha Sarathi Roy, Avishek Adhikari

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationMathematics and Computing - ICMC 2015
EditorsDebasis Giri, Ram N. Mohapatra, Dipanwita Roy Chowdhury
PublisherSpringer New York LLC
Pages123-134
Number of pages12
Volume139
ISBN (Print)9788132224518
DOIs
Publication statusPublished - Jan 1 2015
Event2nd International Conference on Mathematics and Computing, ICMC 2015 - Haldia, India
Duration: Jan 5 2015Jan 10 2015

Other

Other2nd International Conference on Mathematics and Computing, ICMC 2015
CountryIndia
CityHaldia
Period1/5/151/10/15

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Computationally secure robust multi-secret sharing for general access structure'. Together they form a unique fingerprint.

  • Cite this

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