Paper 2023/289
Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs
Abstract
A secret-sharing scheme enables a dealer, holding a secret string, to distribute shares to parties such that only pre-defined authorized subsets of parties can reconstruct the secret. The collection of authorized sets is called an access structure. There is a huge gap between the best known upper bounds on the share size of a secret-sharing scheme realizing an arbitrary access structure and the best known lower bounds on the size of these shares. For an arbitrary
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. ITC 2023
- DOI
- 10.4230/LIPIcs.ITC.2023.16
- Keywords
- Secret SharingShare SizeHypergraphsMonotone Circuits
- Contact author(s)
- amos beimel @ gmail com
- History
- 2023-07-31: last of 3 revisions
- 2023-02-26: received
- See all versions
- Short URL
- https://ia.cr/2023/289
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/289, author = {Amos Beimel}, title = {Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/289}, year = {2023}, doi = {10.4230/LIPIcs.ITC.2023.16}, url = {https://eprint.iacr.org/2023/289} }