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 条
  • [41] Secret Sharing Schemes with Three or Four Minimal Qualified Subsets
    Jaume Martí-Farré
    Carles Padró
    Designs, Codes and Cryptography, 2005, 34 : 17 - 34
  • [42] Secret sharing schemes with detection of cheaters for a general access structure
    Cabello, S
    Padró, C
    Sáez, G
    FUNDAMENTALS OF COMPUTATION THEORY, 1999, 1684 : 185 - 194
  • [43] Secret sharing schemes with three or four minimal qualified subsets
    Martí-Farré, J
    Padró, C
    DESIGNS CODES AND CRYPTOGRAPHY, 2005, 34 (01) : 17 - 34
  • [44] Constructions of some secret sharing schemes based on linear codes
    Ratseev, S. M.
    IZVESTIYA OF SARATOV UNIVERSITY MATHEMATICS MECHANICS INFORMATICS, 2024, 24 (03): : 330 - 341
  • [45] Secret sharing schemes for graph-based prohibited structures
    Sun, HM
    Shieh, SP
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1998, 36 (07) : 131 - 140
  • [46] A note on secret sharing schemes with three homogeneous access structure
    Marti-Farre, Jaume
    INFORMATION PROCESSING LETTERS, 2007, 102 (04) : 133 - 137
  • [47] Local bounds for the optimal information ratio of secret sharing schemes
    Oriol Farràs
    Jordi Ribes-González
    Sara Ricci
    Designs, Codes and Cryptography, 2019, 87 : 1323 - 1344
  • [48] Secret sharing and visual cryptography schemes -: A randomness preserving transformation
    De Bonis, A
    De Santis, A
    TRUSTED INFORMATION: THE NEW DECADE CHALLENGE, 2001, 65 : 123 - 137
  • [49] A Partition Based Visual Secret Sharing Schemes for Large Images
    Mishra, Abhishek
    Gupta, Ashutosh
    2015 1ST INTERNATIONAL CONFERENCE ON NEXT GENERATION COMPUTING TECHNOLOGIES (NGCT), 2015, : 885 - 890
  • [50] A probability model for reconstructing secret sharing under the internet environment
    Lee, CY
    Yeh, YS
    Chen, DJ
    Ku, KL
    INFORMATION SCIENCES, 1999, 116 (2-4) : 109 - 127
12345