article

Some improved bounds on the information rate of perfect secret sharing schemes

Authors:

E. F. Brickell,

D. R. StinsonAuthors Info & Claims

Journal of Cryptology, Volume 5, Issue 3

Pages 153 - 166

https://doi.org/10.1007/BF02451112

Published: 01 June 1992 Publication History

Abstract

No abstract available.

Cited By

View all

Applebaum BBeimel AIshai YKushilevitz ELiu TVaikuntanathan VSaha BServedio R(2023)Succinct Computational Secret SharingProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585127(1553-1566)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585127
Jafari AKhazaei S(2023)Partial Secret Sharing SchemesIEEE Transactions on Information Theory10.1109/TIT.2023.326509369:8(5364-5385)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1109/TIT.2023.3265093
Ligeti PSziklai PTakáts M(2021)Generalized threshold secret sharing and finite geometryDesigns, Codes and Cryptography10.1007/s10623-021-00900-989:9(2067-2078)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1007/s10623-021-00900-9
Show More Cited By

Index Terms

Some improved bounds on the information rate of perfect secret sharing schemes

Recommendations

On the Information Ratio of Non-perfect Secret Sharing Schemes

A secret sharing scheme is non-perfect if some subsets of players that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum length of the shares and the ...
Ideal Perfect Multilevel Threshold Secret Sharing Scheme
IAS '09: Proceedings of the 2009 Fifth International Conference on Information Assurance and Security - Volume 02

Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme. In our first modification, each shareholder keeps both $x$-coordinate ...
Improved schemes for visual secret sharing based on random grids

Random grid (RG) is an alternative approach to realize a visual secret sharing (VSS) scheme. RG-based VSS has merits such as no pixel expansion and no tailor-made matrix requirement. Recently, many investigations on RG-based VSS are made. However, they ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Journal of Cryptology Volume 5, Issue 3

1992

53 pages

ISSN:0933-2790

Editor:
Gilles Brassard
Univ. de Montre´al, Montreal, Quebec, Canada

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 June 1992

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

48
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Applebaum BBeimel AIshai YKushilevitz ELiu TVaikuntanathan VSaha BServedio R(2023)Succinct Computational Secret SharingProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585127(1553-1566)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585127
Jafari AKhazaei S(2023)Partial Secret Sharing SchemesIEEE Transactions on Information Theory10.1109/TIT.2023.326509369:8(5364-5385)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1109/TIT.2023.3265093
Ligeti PSziklai PTakáts M(2021)Generalized threshold secret sharing and finite geometryDesigns, Codes and Cryptography10.1007/s10623-021-00900-989:9(2067-2078)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1007/s10623-021-00900-9
Gyarmati MLigeti P(2020)Smallest Graphs Achieving the Stinson BoundIEEE Transactions on Information Theory10.1109/TIT.2020.296510266:7(4609-4612)Online publication date: 18-Jun-2020
https://dl.acm.org/doi/10.1109/TIT.2020.2965102
Csirmaz LLigeti P(2019)Secret sharing on large girth graphsCryptography and Communications10.1007/s12095-018-0338-x11:3(399-410)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/s12095-018-0338-x
Lu HFu H(2017)The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphsDiscrete Applied Mathematics10.1016/j.dam.2017.08.006233:C(131-142)Online publication date: 31-Dec-2017
https://dl.acm.org/doi/10.1016/j.dam.2017.08.006
Song YLi ZLi YXin R(2015)The optimal information rate for graph access structures of nine participantsFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-015-3255-69:5(778-787)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1007/s11704-015-3255-6
Csirmaz L(2015)Secret sharing on the d-dimensional cubeDesigns, Codes and Cryptography10.1007/s10623-013-9888-274:3(719-729)Online publication date: 1-Mar-2015
https://dl.acm.org/doi/10.1007/s10623-013-9888-2
Li QLi XLai XChen K(2015)Optimal assignment schemes for general access structures based on linear programmingDesigns, Codes and Cryptography10.1007/s10623-013-9879-374:3(623-644)Online publication date: 1-Mar-2015
https://dl.acm.org/doi/10.1007/s10623-013-9879-3
Liu JMesnager SChen L(2015)Secret Sharing Schemes with General Access StructuresRevised Selected Papers of the 11th International Conference on Information Security and Cryptology - Volume 958910.1007/978-3-319-38898-4_20(341-360)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1007/978-3-319-38898-4_20
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

On the Information Ratio of Non-perfect Secret Sharing Schemes

Ideal Perfect Multilevel Threshold Secret Sharing Scheme

Improved schemes for visual secret sharing based on random grids

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations