Succinct Computational Secret Sharing
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
Abstract
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.
Topics & Concepts
Secret sharingComputer scienceNothingAccess structureScheme (mathematics)Secure multi-party computationHomomorphic secret sharingComputer securityMonotone polygonVerifiable secret sharingTheoretical computer scienceInternet privacyCryptographyMathematicsProgramming languageSet (abstract data type)PhilosophyEpistemologyGeometryMathematical analysisCryptography and Data SecurityComplexity and Algorithms in GraphsPrivacy-Preserving Technologies in Data