Towards breaking the exponential barrier for general secret sharing

A secret-sharing scheme for a monotone Boolean (access) function F: {0, 1}[superscript n] → {0, 1} is a randomized algorithm that on input a secret, outputs n shares s[subscript 1]., s[subscript n] such that for any (x[subscript 1]., x[subscript n]) ∈ {0, 1}[superscript n] the collection of shares {...

Full description

Bibliographic Details
Main Authors: Liu, Tianren (Author), Vaikuntanathan, Vinod (Author), Wee, Hoeteck (Author)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer, 2020-04-30T20:00:05Z.
Subjects:
Online Access:Get fulltext

Similar Items