
arXiv: 1103.2544
Splitting a secret s between several participants, we generate (for each value of s) shares for all participants. The goal: authorized groups of participants should be able to reconstruct the secret but forbidden ones get no information about it. In this paper we introduce several notions of non- perfect secret sharing, where some small information leak is permitted. We study its relation to the Kolmogorov complexity version of secret sharing (establishing some connection in both directions) and the effects of changing the secret size (showing that we can decrease the size of the secret and the information leak at the same time).
Acknowledgments added
FOS: Computer and information sciences, Computer Science - Cryptography and Security, Computer Science - Information Theory, Information Theory (cs.IT), non-perfect secret sharing schemes, Information Theory, [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], Kolmogorov Complexity, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], Secret sharing, Cryptography and Security (cs.CR)
FOS: Computer and information sciences, Computer Science - Cryptography and Security, Computer Science - Information Theory, Information Theory (cs.IT), non-perfect secret sharing schemes, Information Theory, [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], Kolmogorov Complexity, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], Secret sharing, Cryptography and Security (cs.CR)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
