Strong security of linear ramp secret sharing schemes with general access structures
From MaRDI portal
Recommendations
Cites work
- A general decomposition construction for incomplete secret sharing schemes
- Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes
- Decomposition constructions for secret-sharing schemes
- Determinantal identities: Gauss, Schur, Cauchy, Sylvester, Kronecker, Jacobi, Binet, Laplace, Muir, and Cayley
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- How to share a secret
- scientific article; zbMATH DE number 3912274 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1023999 (Why is no real title available?)
- scientific article; zbMATH DE number 1024083 (Why is no real title available?)
- scientific article; zbMATH DE number 1394291 (Why is no real title available?)
- scientific article; zbMATH DE number 1406777 (Why is no real title available?)
- Ideal multipartite secret sharing schemes
- Maximum distance<tex>q</tex>-nary codes
- New results and applications for multi-secret sharing schemes
- On secret sharing systems
- On the information ratio of non-perfect secret sharing schemes
- On the optimization of bipartite secret sharing schemes
- Optimal Uniform Secret Sharing
- Security of Ramp Schemes
- Sharing multiple secrets: Models, schemes and analysis
- Strongly secure ramp secret sharing schemes for general access structures
Cited in
(3)
This page was built for publication: Strong security of linear ramp secret sharing schemes with general access structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2203603)