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

DOI10.1016/J.IPL.2006.01.016zbMATH Open1184.94249OpenAlexW2156218425MaRDI QIDQ845708FDOQ845708

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

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

cryptographyinformation ratesecret sharing

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1107673
• Decomposition constructions for secret-sharing schemes
• A general decomposition construction for incomplete secret sharing schemes
• On ideal homomorphic secret sharing schemes and their decomposition
• Efficient explicit constructions of compartmented secret sharing schemes
• Efficient explicit constructions of multipartite secret sharing schemes
• Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
• scientific article; zbMATH DE number 637269
• New results and applications for multi-secret sharing schemes
• scientific article; zbMATH DE number 1612523

Cites work

• scientific article; zbMATH DE number 708804 (Why is no real title available?)
• A general decomposition construction for incomplete secret sharing schemes
• A linear construction of secret sharing schemes
• An explication of secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• Graph decompositions and secret sharing schemes
• On the classification of ideal secret sharing schemes
• On the information rate of perfect secret sharing schemes
• Some improved bounds on the information rate of perfect secret sharing schemes

Cited in

(11)

• An impossibility result on graph secret sharing
• On ideal homomorphic secret sharing schemes and their decomposition
• On the optimization of bipartite secret sharing schemes
• Optimal linear secret sharing schemes for graph access structures on six participants
• Optimal complexity of secret sharing schemes with four minimal qualified subsets
• Optimal assignment schemes for general access structures based on linear programming
• On secret sharing schemes, matroids and polymatroids
• 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
• Reduced access structures with four minimal qualified subsets on six participants

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845708)