Improved constructions of secret sharing schemes by applying ( , )-decompositions
From MaRDI portal
Publication:845708
DOI10.1016/J.IPL.2006.01.016zbMATH Open1184.94249OpenAlexW2156218425MaRDI QIDQ845708FDOQ845708
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
Cites Work
- Title not available (Why is that?)
- 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
- On the information rate of perfect secret sharing schemes
- Decomposition constructions for secret-sharing schemes
- Graph decompositions and secret sharing schemes
- A linear construction of secret sharing schemes
- A general decomposition construction for incomplete secret sharing schemes
Cited In (11)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- On ideal homomorphic secret sharing schemes and their decomposition
- An impossibility result on graph secret sharing
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Reduced access structures with four minimal qualified subsets on six participants
- Optimal assignment schemes for general access structures based on linear programming
- On the optimization of bipartite secret sharing schemes
- On an infinite family of graphs with information ratio \(2 - 1/k\)
- Optimal linear secret sharing schemes for graph access structures on six participants
- On secret sharing schemes, matroids and polymatroids
- Secret-Sharing Schemes: A Survey
Recommendations
- Decomposition constructions for secret-sharing schemes 👍 👎
- New results and applications for multi-secret sharing schemes 👍 👎
- Efficient explicit constructions of multipartite 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 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
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)
