On the size of shares for secret sharing schemes
From MaRDI portal
Publication:1310452
DOI10.1007/BF00198463zbMath0786.68030MaRDI QIDQ1310452
Ugo Vaccaro, Alfredo De Santis, Luisa Gargano, Renato M. Capocelli
Publication date: 3 January 1994
Published in: Journal of Cryptology (Search for Journal in Brave)
Related Items
Matroids Can Be Far from Ideal Secret Sharing, Fully dynamic secret sharing schemes, On the information rate of secret sharing schemes, Lower bounds for monotone span programs, Secret sharing schemes with partial broadcast channels, General information dispersal algorithms, A note on dynamic threshold schemes, Anonymous secret sharing schemes, Sharing one secret vs. sharing many secrets., On identification secret sharing schemes., Probability of shares in secret sharing schemes, Weighted decomposition construction for perfect secret sharing schemes, Secret sharing schemes with three or four minimal qualified subsets, A lower bound on the encoding length in lossy transmission, Graph decompositions and secret sharing schemes, Lower bounds on the information rate of secret sharing schemes with homogeneous access structure., On the information rate of perfect secret sharing schemes, Recursive constructions for perfect secret sharing schemes, A general approach to robust web metering, Secret sharing schemes on access structures with intersection number equal to one, Sharing multiple secrets: Models, schemes and analysis, How to share a secret, On Linear Secret Sharing for Connectivity in Directed Graphs
Cites Work
