Paper 2008/018
Disjunctive Multi-Level Secret Sharing
Mira Belenkiy
Abstract
A disjunctive multi-level secret sharing scheme divides users into different levels. Each level L is associated with a threshold t_L, and a group of users can only recover the secret if, for some L, there are at least t_L users at levels 0....L in the group. We present a simple ideal disjunctive multi-level secret sharing scheme -- in fact, the simplest and most direct scheme to date. It is the first polynomial-time solution that allows the dealer to add new users dynamically. Our solution is by far the most efficient; the dealer must perform O(t) field operations per user, where t is the highest threshold in the system. We demonstrate the simplicity of our scheme by extending our construction into a distributed commitment scheme using standard techniques.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- secret sharing
- Contact author(s)
- mira @ cs brown edu
- History
- 2008-01-14: received
- Short URL
- https://ia.cr/2008/018
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2008/018,
author = {Mira Belenkiy},
title = {Disjunctive Multi-Level Secret Sharing},
howpublished = {Cryptology ePrint Archive, Paper 2008/018},
year = {2008},
note = {\url{https://eprint.iacr.org/2008/018}},
url = {https://eprint.iacr.org/2008/018}
}
