Breaking the circuit-size barrier in secret sharing
Name
2018-333.pdf
Description
Submitted version
Size
434.34 KB
Format
Adobe PDF
Checksum (MD5)
1b779ed7337d20e7c62e66400645f534
Author(s)
Liu, Tianren
Vaikuntanathan, Vinod
Date Issued
2018
Journal
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
Publisher
Association for Computing Machinery (ACM)
Citation
Liu, Tianren and Vaikuntanathan, Vinod. "Breaking the circuit-size barrier in secret sharing." Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2018), June 2018, Los Angeles, CA, edited by Ilias Diakonikolas, David Kempe, and Monika Henzinger, Association for Computing Machinery, 2018
Version
Original manuscript
Abstract
We study secret sharing schemes for general (non-threshold) access structures. A general secret sharing scheme for n parties is associated to a monotone function F: {0, 1}n → {0, 1}. In such a scheme, a dealer distributes shares of a secret s among n parties. Any subset of parties T ⊆ [n] should be able to put together their shares and reconstruct the secret s if F(T) = 1, and should have no information about s if F(T) = 0. One of the major long-standing questions in information-theoretic cryptography is to minimize the (total) size of the shares in a secret-sharing scheme for arbitrary monotone functions F. Keywords: Information-theoretic techniques; Security and privacy; Cryptography; Theory of computation; Computational complexity and cryptography; Circuit complexity; Communication complexity; Cryptographic protocols
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3188745.3188936
