Next Article in Journal
Maximum Relative Entropy Updating and the Value of Learning
Next Article in Special Issue
Information Hiding Method Using Best DCT and Wavelet Coefficients and Its Watermark Competition
Previous Article in Journal
Projective Synchronization for a Class of Fractional-Order Chaotic Systems with Fractional-Order in the (1, 2) Interval
Previous Article in Special Issue
Message Authentication over Noisy Channels
Open AccessArticle

Comparing Security Notions of Secret Sharing Schemes

Department of Electronic Engineering, Xiamen University, Xiamen 361005, China
*
Author to whom correspondence should be addressed.
Academic Editors: James Park and Wanlei Zhou
Entropy 2015, 17(3), 1135-1145; https://doi.org/10.3390/e17031135
Received: 15 January 2015 / Revised: 25 February 2015 / Accepted: 3 March 2015 / Published: 10 March 2015
Different security notions of secret sharing schemes have been proposed by different information measures. Entropies, such as Shannon entropy and min entropy, are frequently used in the setting security notions for secret sharing schemes. Different to the entropies, Kolmogorov complexity was also defined and used in study the security of individual instances for secret sharing schemes. This paper is concerned with these security notions for secret sharing schemes defined by the variational measures, including Shannon entropy, guessing probability, min entropy and Kolmogorov complexity. View Full-Text
Keywords: cryptography; secret sharing scheme; information theoretic security; entropy; Kolmogorov complexity cryptography; secret sharing scheme; information theoretic security; entropy; Kolmogorov complexity
MDPI and ACS Style

Dai, S.; Guo, D. Comparing Security Notions of Secret Sharing Schemes. Entropy 2015, 17, 1135-1145.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop