Strongly ideal secret sharing schemes

被引：3
|
作者：
Phillips, Steven J. [1 ]
Phillips, Nicholas C. [1 ]
机构：
[1] Computer Science Dep, Stanford, United States
来源：
Journal of Cryptology | 1992年 / 5卷 / 03期
关键词：
Access structures - Ideal schemes - Perfect security - Secret sharing;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We define strongly ideal secret sharing schemes to be ideal secret sharing schemes in which certain natural requirements are placed on the decoder. We prove an information-theoretic characterization of perfect schemes, and use it to determine which access structures can be encoded by strongly ideal schemes. We also discuss a hierarchy of secret sharing schemes that are more powerful than strongly ideal schemes.
引用
下载
收藏
页码：185 / 191
相关论文
共 50 条
  • [41] Anonymous secret sharing schemes
    Blundo, C
    Stinson, DR
    DISCRETE APPLIED MATHEMATICS, 1997, 77 (01) : 13 - 28
  • [42] Explication of secret sharing schemes
    Stinson, D.R.
    Designs, Codes, and Cryptography, 1992, 2 (04)
  • [43] Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes
    Martinez-Penas, Umberto
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (06) : 4191 - 4206
  • [44] Visual secret sharing schemes for plural secret images
    Iwamoto, M
    Yamamoto, H
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 283 - 283
  • [45] Verifiable Secret Redistribution for Proactive Secret Sharing Schemes
    于佳
    孔凡玉
    李大兴
    Journal of Shanghai Jiaotong University(Science), 2006, (02) : 236 - 241
  • [46] Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
    Jaume Martí-Farré
    Carles Padró
    Designs, Codes and Cryptography, 2009, 52 : 1 - 14
  • [47] 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
  • [48] On general perfect secret sharing schemes
    Blakley, GR
    Kabatianski, GA
    ADVANCES IN CRYPTOLOGY - CRYPTO '95, 1995, 963 : 367 - 371
  • [49] Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
    Marti-Farre, Jaume
    Padro, Carles
    SECURITY AND CRYPTOGRAPHY FOR NETWORKS, PROCEEDINGS, 2006, 4116 : 201 - 215
  • [50] Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
    Marti-Farre, Jaume
    Padro, Carles
    DESIGNS CODES AND CRYPTOGRAPHY, 2009, 52 (01) : 1 - 14
12345