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] Providing anonymity in unconditionally secure secret sharing schemes
    Guillermo, M
    Martin, KM
    O'Keefe, CM
    DESIGNS CODES AND CRYPTOGRAPHY, 2003, 28 (03) : 227 - 245
  • [32] NEW BOUNDS ON THE INFORMATION RATE OF SECRET SHARING SCHEMES
    BIUNDO, C
    DESANTIS, A
    GAGGIA, AG
    VACCARO, U
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (02) : 549 - 554
  • [33] Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
    Chen, Qi
    Tang, Chunming
    Lin, Zhiqiang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (01) : 601 - 631
  • [34] EXPRESSIVE SHARES VISUAL SECRET SHARING USING DISCRETE COSINE TRANSFORM FOR IMPROVED EXTRACTED SECRET QUALITY
    Chaturvedi, Ratnesh
    Thepade, Sudeep D.
    Ahirrao, Swati
    JOURNAL OF ENGINEERING SCIENCE AND TECHNOLOGY, 2021, 16 (01): : 275 - 290
  • [35] Providing Anonymity in Unconditionally Secure Secret Sharing Schemes
    Mida Guillermo
    Keith M. Martin
    Christine M. O'Keefe
    Designs, Codes and Cryptography, 2003, 28 : 227 - 245
  • [36] Secret sharing schemes from three classes of linear codes
    Yuan, J
    Ding, CS
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (01) : 206 - 212
  • [37] A unified approach to secret sharing schemes with low distribution cost
    Chien, HY
    Jan, JK
    Tseng, YM
    JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 2002, 25 (06) : 723 - 733
  • [38] Local bounds for the optimal information ratio of secret sharing schemes
    Farras, Oriol
    Ribes-Gonzalez, Jordi
    Ricci, Sara
    DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (06) : 1323 - 1344
  • [39] Secret sharing schemes with detection of cheaters for a general access structure
    Cabello, S
    Padró, C
    Sáez, G
    DESIGNS CODES AND CRYPTOGRAPHY, 2002, 25 (02) : 175 - 188
  • [40] Properties and constraints of cheating-immune secret sharing schemes
    D'Arco, P
    Kishimoto, W
    Stinson, DR
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (02) : 219 - 233
12345