TY - GEN
T1 - Computationally secure cheating identifiable multi-secret sharing for general access structure
AU - Sarathi Roy, Partha
AU - Das, Angsuman
AU - Adhikari, Avishek
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2015
Y1 - 2015
N2 - Secret sharing scheme is a key component of distributed cryptosystems. In its basic form, secret sharing schemes can tolerate honest but curious adversary. But, in modern open system environment, adversary can behave maliciously i.e., the adversary can do anything according to his available computational resources. To get rid of such adversary, cheating identifiable (multi) secret sharing scheme plays an important role. Informally, cheating identifiable (multi) secret sharing scheme can identify the cheating participants, who are under the control of malicious adversary, and recover the correct secret whenever possible. However, to achieve unconditional security against such adversary, share size should be at least equal to the size of the secret. As a result, the need for computational notion of security of such schemes, which can accommodate smaller share size, has been felt over the years, specially in case of multi-secret sharing schemes. In this paper, we propose a notion of security for computationally secure cheating identifiable multi-secret sharing scheme for general access structure along with a construction which is secure under this new notion.
AB - Secret sharing scheme is a key component of distributed cryptosystems. In its basic form, secret sharing schemes can tolerate honest but curious adversary. But, in modern open system environment, adversary can behave maliciously i.e., the adversary can do anything according to his available computational resources. To get rid of such adversary, cheating identifiable (multi) secret sharing scheme plays an important role. Informally, cheating identifiable (multi) secret sharing scheme can identify the cheating participants, who are under the control of malicious adversary, and recover the correct secret whenever possible. However, to achieve unconditional security against such adversary, share size should be at least equal to the size of the secret. As a result, the need for computational notion of security of such schemes, which can accommodate smaller share size, has been felt over the years, specially in case of multi-secret sharing schemes. In this paper, we propose a notion of security for computationally secure cheating identifiable multi-secret sharing scheme for general access structure along with a construction which is secure under this new notion.
UR - http://www.scopus.com/inward/record.url?scp=84922360841&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84922360841&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-14977-6_27
DO - 10.1007/978-3-319-14977-6_27
M3 - Conference contribution
AN - SCOPUS:84922360841
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 278
EP - 287
BT - Distributed Computing and InternetTechnology - 11th International Conference, ICDCIT 2015, Proceedings
A2 - Natarajan, Raja
A2 - Barua, Gautam
A2 - Patra, Manas Ranjan
PB - Springer Verlag
T2 - 11th International Conference on Distributed Computing and Internet Technology, ICDCIT 2015
Y2 - 5 February 2015 through 8 February 2015
ER -