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

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

Fingerprint

Access Structure
Secret Sharing Scheme
Secret Sharing
Unconditional Security
Cryptosystem
Notation
Minimise

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

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

Computationally secure robust multi-secret sharing for general access structure. / Das, Angsuman; Roy, Partha Sarathi; Adhikari, Avishek.

Mathematics and Computing - ICMC 2015. ed. / Debasis Giri; Ram N. Mohapatra; Dipanwita Roy Chowdhury. Vol. 139 Springer New York LLC, 2015. p. 123-134.

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

Das, A, Roy, PS & Adhikari, A 2015, Computationally secure robust multi-secret sharing for general access structure. in D Giri, RN Mohapatra & DR Chowdhury (eds), Mathematics and Computing - ICMC 2015. vol. 139, Springer New York LLC, pp. 123-134, 2nd International Conference on Mathematics and Computing, ICMC 2015, Haldia, India, 1/5/15. https://doi.org/10.1007/978-81-322-2452-5_9
Das A, Roy PS, Adhikari A. Computationally secure robust multi-secret sharing for general access structure. In Giri D, Mohapatra RN, Chowdhury DR, editors, Mathematics and Computing - ICMC 2015. Vol. 139. Springer New York LLC. 2015. p. 123-134 https://doi.org/10.1007/978-81-322-2452-5_9
Das, Angsuman ; Roy, Partha Sarathi ; Adhikari, Avishek. / Computationally secure robust multi-secret sharing for general access structure. Mathematics and Computing - ICMC 2015. editor / Debasis Giri ; Ram N. Mohapatra ; Dipanwita Roy Chowdhury. Vol. 139 Springer New York LLC, 2015. pp. 123-134
@inproceedings{cef61c675f6642b491b9ace2297fee9e,
title = "Computationally secure robust multi-secret sharing for general access structure",
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.",
author = "Angsuman Das and Roy, {Partha Sarathi} and Avishek Adhikari",
year = "2015",
month = "1",
day = "1",
doi = "10.1007/978-81-322-2452-5_9",
language = "English",
isbn = "9788132224518",
volume = "139",
pages = "123--134",
editor = "Debasis Giri and Mohapatra, {Ram N.} and Chowdhury, {Dipanwita Roy}",
booktitle = "Mathematics and Computing - ICMC 2015",
publisher = "Springer New York LLC",

}

TY - GEN

T1 - Computationally secure robust multi-secret sharing for general access structure

AU - Das, Angsuman

AU - Roy, Partha Sarathi

AU - Adhikari, Avishek

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84947053150&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947053150&partnerID=8YFLogxK

U2 - 10.1007/978-81-322-2452-5_9

DO - 10.1007/978-81-322-2452-5_9

M3 - Conference contribution

SN - 9788132224518

VL - 139

SP - 123

EP - 134

BT - Mathematics and Computing - ICMC 2015

A2 - Giri, Debasis

A2 - Mohapatra, Ram N.

A2 - Chowdhury, Dipanwita Roy

PB - Springer New York LLC

ER -