Flaws in strong t-consistency

Cianciullo, Louis, Ghodosi, Hossein, Thuremilla, Kovel, and Prihandoko, Antonius Cahya (2019) Flaws in strong t-consistency. In: Proceedings of the 2019 International Conference on Computer Science, Information Technology, and Electrical Engineering. 8921313. pp. 118-122. From: ICOMITEE 2019: 2019 International Conference on Computer Science, Information Technology, and Electrical Engineering, 16-17 October 2019, Jember, Indonesia.

[img] PDF (Published Version) - Published Version
Restricted to Repository staff only

View at Publisher Website: https://doi.org/10.1109/ICOMITEE.2019.89...


Secret sharing is a cryptographic primitive used to securely distribute a secret value S among n participants such that only predetermined subsets of these participants (called access sets) can later reconstruct S. Such a scheme is said to be secure in the information theoretic setting if an adversary with unlimited computational power cannot reduce uncertainty regarding S.Harn and Lin proposed a strong (n, t, n) secret sharing scheme which they claim is information theoretic secure. In this paper we show that this is not the case and that the notion of strong t-consistency used by Harn and Lin as well as Liu et al. actually results in an imperfect scheme that is not secure in the information theoretic setting.

Item ID: 61704
Item Type: Conference Item (Research - E1)
ISBN: 978-1-7281-3436-9
Keywords: Secret Sharing, Strong t-consistency, Verifiable Secret Sharing
Copyright Information: © 2019 IEEE.
Date Deposited: 27 Apr 2020 23:54
FoR Codes: 46 INFORMATION AND COMPUTING SCIENCES > 4613 Theory of computation > 461301 Coding, information theory and compression @ 100%
SEO Codes: 89 INFORMATION AND COMMUNICATION SERVICES > 8903 Information Services > 890399 Information Services not elsewhere classified @ 100%
Downloads: Total: 2
More Statistics

Actions (Repository Staff Only)

Item Control Page Item Control Page