Overcoming security limitations of Secret Share techniques: The Nested Secret Share

Antonino Galletta; Javid Taheri; Maria Fazio; Antonio Celesti; Massimo Villari

doi:10.1109/TrustCom53373.2021.00054

Overcoming security limitations of Secret Share techniques: The Nested Secret Share

Antonino Galletta, Javid Taheri, Maria Fazio, Antonio Celesti, Massimo Villari

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

8 Citations (Scopus)

Abstract

Secret Share (SS) is becoming a very hot topic within the scientific community. It allows us to split a secret into fragments and to share them among parties in such a way that a subset can recompose the original information. SS techniques assure a high redundancy degree, but the security level is fixed. Therefore, if a minimum number of peers collude then attackers can recompose the secret easily. A possible approach to improve the security of SS is designing nest fragment sharing techniques. In this paper, we propose the Nested Secret Share (NSS) as a more reliable and scalable strategy. In particular, we discuss the security of NSS considering the number of recomposition attempts that an attacker has to perform to retrieve the secret and then we deeply analyse the impact of the redundancy and the number of peers on the secret management against the percentage of compromised nodes. Experiments were promising and showed that the redundancy degree of SS can be highly improved by NSS.

Original language	English
Title of host publication	Proceedings - 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021
Editors	Liang Zhao, Neeraj Kumar, Robert C. Hsu, Deqing Zou
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	289-296
Number of pages	8
ISBN (Electronic)	9781665416580
ISBN (Print)	9781665416597
DOIs	https://doi.org/10.1109/TrustCom53373.2021.00054
Publication status	Published - 09 Mar 2022
Externally published	Yes
Event	20th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021 - Shenyang, China Duration: 20 Oct 2021 → 22 Oct 2021

Publication series

Name	Proceedings - IEEE International Conference on Trust, Security and Privacy in Computing and Communications
ISSN (Print)	2324-898X
ISSN (Electronic)	2324-9013

Conference

Conference	20th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021
Country/Territory	China
City	Shenyang
Period	20/10/2021 → 22/10/2021

Bibliographical note

Publisher Copyright:
© 2021 IEEE.

Keywords

Data Availability
Distributed Storage
Nested Secret Share
Secret Share
Security

ASJC Scopus subject areas

Computer Networks and Communications
Information Systems
Information Systems and Management
Safety, Risk, Reliability and Quality

Access to Document

10.1109/TrustCom53373.2021.00054Licence: Unspecified

Cite this

Galletta, A., Taheri, J., Fazio, M., Celesti, A., & Villari, M. (2022). Overcoming security limitations of Secret Share techniques: The Nested Secret Share. In L. Zhao, N. Kumar, R. C. Hsu, & D. Zou (Eds.), Proceedings - 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021 (pp. 289-296). (Proceedings - IEEE International Conference on Trust, Security and Privacy in Computing and Communications). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/TrustCom53373.2021.00054

Galletta, Antonino ; Taheri, Javid ; Fazio, Maria et al. / Overcoming security limitations of Secret Share techniques: The Nested Secret Share. Proceedings - 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021. editor / Liang Zhao ; Neeraj Kumar ; Robert C. Hsu ; Deqing Zou. Institute of Electrical and Electronics Engineers Inc., 2022. pp. 289-296 (Proceedings - IEEE International Conference on Trust, Security and Privacy in Computing and Communications).

@inproceedings{60331691743e4493b3b4268a465e0b90,

title = "Overcoming security limitations of Secret Share techniques: The Nested Secret Share",

abstract = "Secret Share (SS) is becoming a very hot topic within the scientific community. It allows us to split a secret into fragments and to share them among parties in such a way that a subset can recompose the original information. SS techniques assure a high redundancy degree, but the security level is fixed. Therefore, if a minimum number of peers collude then attackers can recompose the secret easily. A possible approach to improve the security of SS is designing nest fragment sharing techniques. In this paper, we propose the Nested Secret Share (NSS) as a more reliable and scalable strategy. In particular, we discuss the security of NSS considering the number of recomposition attempts that an attacker has to perform to retrieve the secret and then we deeply analyse the impact of the redundancy and the number of peers on the secret management against the percentage of compromised nodes. Experiments were promising and showed that the redundancy degree of SS can be highly improved by NSS.",

keywords = "Data Availability, Distributed Storage, Nested Secret Share, Secret Share, Security",

author = "Antonino Galletta and Javid Taheri and Maria Fazio and Antonio Celesti and Massimo Villari",

note = "Publisher Copyright: {\textcopyright} 2021 IEEE.; 20th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021 ; Conference date: 20-10-2021 Through 22-10-2021",

year = "2022",

month = mar,

day = "9",

doi = "10.1109/TrustCom53373.2021.00054",

language = "English",

isbn = "9781665416597",

series = "Proceedings - IEEE International Conference on Trust, Security and Privacy in Computing and Communications",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "289--296",

editor = "Liang Zhao and Neeraj Kumar and Hsu, {Robert C.} and Deqing Zou",

booktitle = "Proceedings - 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021",

address = "United States",

}

Galletta, A, Taheri, J, Fazio, M, Celesti, A & Villari, M 2022, Overcoming security limitations of Secret Share techniques: The Nested Secret Share. in L Zhao, N Kumar, RC Hsu & D Zou (eds), Proceedings - 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021. Proceedings - IEEE International Conference on Trust, Security and Privacy in Computing and Communications, Institute of Electrical and Electronics Engineers Inc., pp. 289-296, 20th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021, Shenyang, China, 20/10/2021. https://doi.org/10.1109/TrustCom53373.2021.00054

Overcoming security limitations of Secret Share techniques: The Nested Secret Share. / Galletta, Antonino; Taheri, Javid; Fazio, Maria et al.
Proceedings - 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021. ed. / Liang Zhao; Neeraj Kumar; Robert C. Hsu; Deqing Zou. Institute of Electrical and Electronics Engineers Inc., 2022. p. 289-296 (Proceedings - IEEE International Conference on Trust, Security and Privacy in Computing and Communications).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Overcoming security limitations of Secret Share techniques: The Nested Secret Share

AU - Galletta, Antonino

AU - Taheri, Javid

AU - Fazio, Maria

AU - Celesti, Antonio

AU - Villari, Massimo

PY - 2022/3/9

Y1 - 2022/3/9

N2 - Secret Share (SS) is becoming a very hot topic within the scientific community. It allows us to split a secret into fragments and to share them among parties in such a way that a subset can recompose the original information. SS techniques assure a high redundancy degree, but the security level is fixed. Therefore, if a minimum number of peers collude then attackers can recompose the secret easily. A possible approach to improve the security of SS is designing nest fragment sharing techniques. In this paper, we propose the Nested Secret Share (NSS) as a more reliable and scalable strategy. In particular, we discuss the security of NSS considering the number of recomposition attempts that an attacker has to perform to retrieve the secret and then we deeply analyse the impact of the redundancy and the number of peers on the secret management against the percentage of compromised nodes. Experiments were promising and showed that the redundancy degree of SS can be highly improved by NSS.

AB - Secret Share (SS) is becoming a very hot topic within the scientific community. It allows us to split a secret into fragments and to share them among parties in such a way that a subset can recompose the original information. SS techniques assure a high redundancy degree, but the security level is fixed. Therefore, if a minimum number of peers collude then attackers can recompose the secret easily. A possible approach to improve the security of SS is designing nest fragment sharing techniques. In this paper, we propose the Nested Secret Share (NSS) as a more reliable and scalable strategy. In particular, we discuss the security of NSS considering the number of recomposition attempts that an attacker has to perform to retrieve the secret and then we deeply analyse the impact of the redundancy and the number of peers on the secret management against the percentage of compromised nodes. Experiments were promising and showed that the redundancy degree of SS can be highly improved by NSS.

KW - Data Availability

KW - Distributed Storage

KW - Nested Secret Share

KW - Secret Share

KW - Security

U2 - 10.1109/TrustCom53373.2021.00054

DO - 10.1109/TrustCom53373.2021.00054

M3 - Conference contribution

AN - SCOPUS:85127434284

SN - 9781665416597

T3 - Proceedings - IEEE International Conference on Trust, Security and Privacy in Computing and Communications

SP - 289

EP - 296

BT - Proceedings - 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021

A2 - Zhao, Liang

A2 - Kumar, Neeraj

A2 - Hsu, Robert C.

A2 - Zou, Deqing

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 20th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021

Y2 - 20 October 2021 through 22 October 2021

ER -

Galletta A, Taheri J, Fazio M, Celesti A, Villari M. Overcoming security limitations of Secret Share techniques: The Nested Secret Share. In Zhao L, Kumar N, Hsu RC, Zou D, editors, Proceedings - 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2021. Institute of Electrical and Electronics Engineers Inc. 2022. p. 289-296. (Proceedings - IEEE International Conference on Trust, Security and Privacy in Computing and Communications). doi: 10.1109/TrustCom53373.2021.00054

Overcoming security limitations of Secret Share techniques: The Nested Secret Share

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this