Succinct Computational Secret Sharing

A secret-sharing scheme enables a dealer to share a secret s among n parties such that only authorized subsets of parties, specified by a monotone access structure f :{0,1} n →{0,1}, can reconstruct s from their shares. Other subsets of parties learn nothing about s .

Authors

• Benny Applebaum
• Amos Beimel
• Yuval Ishai
• Eyal Kushilevitz
• Tianren Liu
• Vinod Vaikuntanathan

Keywords

• Pseudorandom Generators
• Secret Sharing