Abstract
An n-player (t,δ)-secure threshold robust secret sharing scheme is a (t,n)-threshold secret sharing scheme with the additional property that the secret can be recovered, with probability at least 1-δ, from the set of all shares even if up to t players provide incorrect shares. The existing constructions of threshold robust secret sharing schemes for the range n/3≤ t
Author supplied keywords
Cite
CITATION STYLE
Jhanwar, M. P., & Safavi-Naini, R. (2013). Unconditionally-secure robust secret sharing with minimum share size. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7859 LNCS, pp. 96–110). https://doi.org/10.1007/978-3-642-39884-1_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
