Comparing Security Notions of Secret Sharing Schemes

Entropy

Songsong Dai²  Donghui Guo¹  James Park² 

[1] Department of Electronic Engineering, Xiamen University, Xiamen 361005, China; E-Mail

关键词: cryptography;    secret sharing scheme;    information theoretic security;    entropy;    Kolmogorov complexity;   

DOI  :  10.3390/e17031135

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY   
© 2015 by the authors; licensee MDPI, Basel, Switzerland