Probability of shares in secret sharing schemes

被引：3

作者：

Blundo, C ^{[1
]}

De Santis, A ^{[1
]}

Gaggia, AG ^{[1
]}

机构：

[1] Univ Salerno, Dipartimento Informat & Applicaz, I-84081 Baronissi, SA, Italy

来源：

INFORMATION PROCESSING LETTERS | 1999年 / 72卷 / 5-6期

关键词：

safety/security in digital systems; cryptography; probability;

D O I：

10.1016/S0020-0190(99)00153-2

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A secret sharing scheme is a protocol to share a secret s among a set P of participants in such a way that only qualified subsets, pooling together their information, can reconstruct the secret s, but subsets of participants that are not enabled to recover the secret have no information on it. In this paper we analyze the sample space of shares for any set of participants. In particular, we prove tight bounds on the probability of shares and on the size of the space of shares in terms of the size of the secret set. (C) 1999 Published by Elsevier Science B.V. All rights reserved.

引用

页码：169 / 175

页数：7

共 50 条

[31] Robust Secret Image Sharing Resistant to Noise in Shares
Yan, Xuehu
Liu, Lintao
Li, Longlong
Lu, Yuliang
ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS, 2021, 17 (01)
[32] On generating meaningful shares in visual secret sharing scheme
Tsai, D. S.
Chen, T.
Horng, G.
IMAGING SCIENCE JOURNAL, 2008, 56 (01): : 49 - 55
[33] On general perfect secret sharing schemes
Blakley, GR
Kabatianski, GA
ADVANCES IN CRYPTOLOGY - CRYPTO '95, 1995, 963 : 367 - 371
[34] Security of Selected Secret Sharing Schemes
Ogiela, Urszula
Takizawa, Makoto
Ogiela, Lidia
INNOVATIVE MOBILE AND INTERNET SERVICES IN UBIQUITOUS COMPUTING, IMIS-2017, 2018, 612 : 395 - 400
[35] Fully dynamic secret sharing schemes
Universita di Salerno, Baronissi, Italy
Theor Comput Sci, 2 (407-440):
[36] Veto is impossible in secret sharing schemes
Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo 152, Japan
Inf. Process. Lett., 6 (293-295):
[37] Strongly ideal secret sharing schemes
Phillips, Steven J.
Phillips, Nicholas C.
Journal of Cryptology, 1992, 5 (03) : 185 - 191
[38] On the information rate of secret sharing schemes
Blundo, C
DeSantis, A
Gargano, L
Vaccaro, U
THEORETICAL COMPUTER SCIENCE, 1996, 154 (02) : 283 - 306
[39] Ideal Hierarchical Secret Sharing Schemes
Farras, Oriol
Padro, Carles
THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2010, 5978 : 219 - 236
[40] On the information rate of secret sharing schemes
Universita di Salerno, Baronissi, Italy
Theor Comput Sci, 2 (283-306):

← 1 2 3 4 5 →