CryptoDB
Disjunctive Multi-Level Secret Sharing
| Authors: | |
|---|---|
| Download: | |
| 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. |
BibTeX
@misc{eprint-2008-17695,
title={Disjunctive Multi-Level Secret Sharing},
booktitle={IACR Eprint archive},
keywords={foundations / secret sharing},
url={http://eprint.iacr.org/2008/018},
note={ mira@cs.brown.edu 13889 received 11 Jan 2008},
author={Mira Belenkiy},
year=2008
}