Corniaux, Christian L.F., and Ghodosi, Hossein (2014) An entropy-based demonstration of the security of Shamir's secret sharing scheme. In: Proceedings of the International Conference on Information Science, Electronics and Electrical Engineering (1) pp. 46-48. From: ISEEE 2014: International Conference on Information Science, Electronics and Electrical Engineering, 26-28 April 2014, Sapporo, Japan.

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

Abstract

In a k-threshold secret sharing scheme, a dealer who holds a secret s distributes parts of this secret (the shares) to n players; If k or more of these players pool their shares, they are able to determine s, but if less than k of them pool their shares, they cannot infer any information on s. In 1979, Shamir introduced such a scheme, based on polynomial interpolation in a finite field. This scheme is widely used in other cryptographic protocols, because it is simple, elegant and above all information-theoretically secure. There are a few proofs of the scheme's security, but to our knowledge, none of them is entirely based on the information-theoretical entropy function introduced by Shannon in 1948. We propose such a demonstration.

Item ID:	38602
Item Type:	Conference Item (Research - E1)
ISBN:	978-1-4799-3196-5
Keywords:	information security, cryptography, cryptographic protocol, information theory, secret sharing scheme, Shamir
Date Deposited:	29 Apr 2015 23:40
FoR Codes:	08 INFORMATION AND COMPUTING SCIENCES > 0804 Data Format > 080401 Coding and Information Theory @ 100%
SEO Codes:	97 EXPANDING KNOWLEDGE > 970108 Expanding Knowledge in the Information and Computing Sciences @ 100%
Downloads:	Total: 4
	More Statistics