Hierarchical secret sharing schemes secure against rushing adversary: Cheater identification and robustness

Partha Sarathi Roy, Sabyasachi Dutta, Kirill Morozov, Avishek Adhikari, Kazuhide Fukushima, Shinsaku Kiyomoto, Kouichi Sakurai

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

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationInformation Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings
EditorsHiroaki Kikuchi, Chunhua Su
PublisherSpringer Verlag
Pages578-594
Number of pages17
ISBN (Print)9783319998060
DOIs
Publication statusPublished - Jan 1 2018
Event14th International Conference on Information Security Practice and Experience, ISPEC 2018 - Tokyo, Japan
Duration: Sep 25 2018Sep 27 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11125 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other14th International Conference on Information Security Practice and Experience, ISPEC 2018
CountryJapan
CityTokyo
Period9/25/189/27/18

Fingerprint

Access Structure
Secret Sharing Scheme
Secret Sharing
Robustness
Scenarios
Identifiability
Hierarchical Structure
Resolve
Hierarchy

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Roy, P. S., Dutta, S., Morozov, K., Adhikari, A., Fukushima, K., Kiyomoto, S., & Sakurai, K. (2018). Hierarchical secret sharing schemes secure against rushing adversary: Cheater identification and robustness. In H. Kikuchi, & C. Su (Eds.), Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings (pp. 578-594). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11125 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-99807-7_37

Hierarchical secret sharing schemes secure against rushing adversary : Cheater identification and robustness. / Roy, Partha Sarathi; Dutta, Sabyasachi; Morozov, Kirill; Adhikari, Avishek; Fukushima, Kazuhide; Kiyomoto, Shinsaku; Sakurai, Kouichi.

Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings. ed. / Hiroaki Kikuchi; Chunhua Su. Springer Verlag, 2018. p. 578-594 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11125 LNCS).

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

Roy, PS, Dutta, S, Morozov, K, Adhikari, A, Fukushima, K, Kiyomoto, S & Sakurai, K 2018, Hierarchical secret sharing schemes secure against rushing adversary: Cheater identification and robustness. in H Kikuchi & C Su (eds), Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11125 LNCS, Springer Verlag, pp. 578-594, 14th International Conference on Information Security Practice and Experience, ISPEC 2018, Tokyo, Japan, 9/25/18. https://doi.org/10.1007/978-3-319-99807-7_37
Roy PS, Dutta S, Morozov K, Adhikari A, Fukushima K, Kiyomoto S et al. Hierarchical secret sharing schemes secure against rushing adversary: Cheater identification and robustness. In Kikuchi H, Su C, editors, Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings. Springer Verlag. 2018. p. 578-594. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-99807-7_37
Roy, Partha Sarathi ; Dutta, Sabyasachi ; Morozov, Kirill ; Adhikari, Avishek ; Fukushima, Kazuhide ; Kiyomoto, Shinsaku ; Sakurai, Kouichi. / Hierarchical secret sharing schemes secure against rushing adversary : Cheater identification and robustness. Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings. editor / Hiroaki Kikuchi ; Chunhua Su. Springer Verlag, 2018. pp. 578-594 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a628411a0d98459f9648152662c6de64,
title = "Hierarchical secret sharing schemes secure against rushing adversary: Cheater identification and robustness",
abstract = "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.",
author = "Roy, {Partha Sarathi} and Sabyasachi Dutta and Kirill Morozov and Avishek Adhikari and Kazuhide Fukushima and Shinsaku Kiyomoto and Kouichi Sakurai",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-99807-7_37",
language = "English",
isbn = "9783319998060",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "578--594",
editor = "Hiroaki Kikuchi and Chunhua Su",
booktitle = "Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Hierarchical secret sharing schemes secure against rushing adversary

T2 - Cheater identification and robustness

AU - Roy, Partha Sarathi

AU - Dutta, Sabyasachi

AU - Morozov, Kirill

AU - Adhikari, Avishek

AU - Fukushima, Kazuhide

AU - Kiyomoto, Shinsaku

AU - Sakurai, Kouichi

PY - 2018/1/1

Y1 - 2018/1/1

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

ER -