Secret sharing with binary shares
Shamir’s celebrated secret sharing scheme provides an efficient method for encoding a secret of arbitrary length ℓ among any N ≤ 2ℓ players such that for a threshold parameter t, (i) the knowledge of any t shares does not reveal any information about the secret and, (ii) any choice of t+ 1 shares fu...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/142982 |