Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions

DOI10.1016/j.ipl.2006.01.016zbMath1184.94249OpenAlexW2156218425MaRDI QIDQ845708

Pim Tuyls, Tom Kevenaar, Marten van Dijk, Geert-Jan Schrijen

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.01.016

zbMATH Keywords

cryptographysecret sharinginformation rate

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

Optimal linear secret sharing schemes for graph access structures on six participants ⋮ On an infinite family of graphs with information ratio \(2 - 1/k\) ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Secret-Sharing Schemes: A Survey ⋮ On ideal homomorphic secret sharing schemes and their decomposition ⋮ Optimal assignment schemes for general access structures based on linear programming ⋮ Optimal complexity of secret sharing schemes with four minimal qualified subsets ⋮ On secret sharing schemes, matroids and polymatroids ⋮ Reduced access structures with four minimal qualified subsets on six participants ⋮ On the optimization of bipartite secret sharing schemes ⋮ An impossibility result on graph secret sharing

Cites Work

• Unnamed Item
• On the classification of ideal secret sharing schemes
• Some improved bounds on the information rate of perfect secret sharing schemes
• An explication of secret sharing schemes
• A general decomposition construction for incomplete secret sharing schemes
• A linear construction of secret sharing schemes
• Graph decompositions and secret sharing schemes
• On the information rate of perfect secret sharing schemes
• Decomposition constructions for secret-sharing schemes

This page was built for publication: Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions