TY - GEN
T1 - Hierarchical secret sharing schemes secure against rushing adversary
T2 - 14th International Conference on Information Security Practice and Experience, ISPEC 2018
AU - Roy, Partha Sarathi
AU - Dutta, Sabyasachi
AU - Morozov, Kirill
AU - Adhikari, Avishek
AU - Fukushima, Kazuhide
AU - Kiyomoto, Shinsaku
AU - Sakurai, Kouichi
N1 - Funding Information:
Keywords: Hierarchical secret sharing · Cheater identification Robustness · Rushing adversary · Multi-receiver authentication code Universal hash function The second author is grateful to the NICT, Japan for granting a financial support under the NICT International Exchange Program.
Publisher Copyright:
© Springer Nature Switzerland AG 2018.
Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.
PY - 2018
Y1 - 2018
N2 - Threshold access structures of secret sharing schemes capture a scenario in which all the participants have the same weight (or power) and their contributions are equal. However, in some situations such as gradation among officials in an organization, the participants have different weights. Hierarchical access structures capture those natural scenarios, where different levels of hierarchy are present and a participant belongs precisely to one of them. Although an extensive research addressing the issues of cheater identifiability and robustness have been done for threshold secret sharing, no such research has been carried out for hierarchical secret sharing (HSS). This paper resolves this long-standing open issue by presenting definitions and constructions of both cheater identifiable and robust HSS schemes secure against rushing adversary, in the information-theoretic setting.
AB - Threshold access structures of secret sharing schemes capture a scenario in which all the participants have the same weight (or power) and their contributions are equal. However, in some situations such as gradation among officials in an organization, the participants have different weights. Hierarchical access structures capture those natural scenarios, where different levels of hierarchy are present and a participant belongs precisely to one of them. Although an extensive research addressing the issues of cheater identifiability and robustness have been done for threshold secret sharing, no such research has been carried out for hierarchical secret sharing (HSS). This paper resolves this long-standing open issue by presenting definitions and constructions of both cheater identifiable and robust HSS schemes secure against rushing adversary, in the information-theoretic setting.
UR - http://www.scopus.com/inward/record.url?scp=85054389693&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85054389693&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-99807-7_37
DO - 10.1007/978-3-319-99807-7_37
M3 - Conference contribution
AN - SCOPUS:85054389693
SN - 9783319998060
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 578
EP - 594
BT - Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings
A2 - Kikuchi, Hiroaki
A2 - Su, Chunhua
PB - Springer Verlag
Y2 - 25 September 2018 through 27 September 2018
ER -