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.

PDF (Published Version) - Published Version Restricted to Repository staff only

 

2

Abstract

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.

Actions (Repository Staff Only)

Item Control Page