How to Share a Secret, Infinitely

Electronic Colloquium on Computational Complexity (ECCC), Volume 64, Issue 6, 2018, Pages 4179-4190.

Cited by: 17|Bibtex|Views26|Links
EI WOS
Keywords:
CryptographyUpper boundEncodingComplexity theoryElectronic mailMore(2+)

Abstract:

Secret sharing schemes allow a dealer to distribute a secret piece of information among several parties such that only qualified subsets of parties can reconstruct the secret. The collection of qualified subsets is called an access structure. The best known example is the k-threshold access structure, where the qualified subsets are those...More

Code:

Data:

Your rating :
0

 

Tags
Comments