Multi-linear secret-sharing schemes
From MaRDI portal
Recommendations
Cited in
(23)- On the information ratio of non-perfect secret sharing schemes
- Reduced access structures with four minimal qualified subsets on six participants
- Classes of matroids closed under minors and principal extensions
- On ideal homomorphic secret sharing schemes and their decomposition
- On abelian and homomorphic secret sharing schemes
- Quantum multi-secret sharing via trap codes and discrete quantum walks
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
- Common information, matroid representation, and secret sharing for matroid ports
- On group-characterizability of homomorphic secret sharing schemes
- Representability of matroids by c-arrangements is undecidable
- Secret-sharing matroids need not be algebraic
- scientific article; zbMATH DE number 1305506 (Why is no real title available?)
- Linear algebra approach to secret sharing schemes
- On secret sharing with nonlinear product reconstruction
- Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
- A note on representing Dowling geometries by partitions.
- Von Staudt constructions for skew-linear and multilinear matroids
- On ideal and weakly-ideal access structures
- Linear secret sharing schemes and rearrangements of access structures
- Polynomial secret sharing schemes and algebraic matroids
- On entropic and almost multilinear representability of matroids
- Linear multi-secret sharing schemes
- Linear multi-secret sharing schemes based on multi-party computation
This page was built for publication: Multi-linear secret-sharing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746346)