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...
Saved in:
Main Authors: | Lin, Fuchun, Cheraghchi, Mahdi, Guruswami, Venkatesan, Safavi-Naini, Reihaneh, Wang, Huaxiong |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/142982 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Full threshold change range of threshold changeable secret sharing
by: Ding, Jian, et al.
Published: (2023) -
Bivariate polynomial-based secret sharing schemes with secure secret reconstruction
by: Ding, Jian, et al.
Published: (2022) -
Leakage-resilient secret sharing with constant share size
by: Tjuawinata, Ivan, et al.
Published: (2023) -
Efficient threshold function secret sharing with information-theoretic security
by: Luo, Jinglong, et al.
Published: (2021) -
On Secret Sharing with Nonlinear Product Reconstruction
by: Cascudo, Ignacio, et al.
Published: (2015)