Comparing Security Notions of Secret Sharing Schemes
AbstractDifferent 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
Scifeed alert for new publicationsNever 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
Dai, S.; Guo, D. Comparing Security Notions of Secret Sharing Schemes. Entropy 2015, 17, 1135-1145.
Dai S, Guo D. Comparing Security Notions of Secret Sharing Schemes. Entropy. 2015; 17(3):1135-1145.Chicago/Turabian Style
Dai, Songsong; Guo, Donghui. 2015. "Comparing Security Notions of Secret Sharing Schemes." Entropy 17, no. 3: 1135-1145.