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
Article Menu

Export Article

Open AccessArticle
Entropy 2015, 17(3), 1135-1145; doi:10.3390/e17031135

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
Received: 15 January 2015 / Revised: 25 February 2015 / Accepted: 3 March 2015 / Published: 10 March 2015
View Full-Text   |   Download PDF [200 KB, uploaded 10 March 2015]

Abstract

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
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

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

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top