A construction of practical secret sharing schemes using linear block codes
From MaRDI portal
Recommendations
Cited in
(36)- How to build robust shared control systems
- A linear construction of secret sharing schemes
- Upslices, downslices, and secret-sharing with complexity of 1.5ⁿ
- Quadratic secret sharing and conditional disclosure of secrets
- On group-characterizability of homomorphic secret sharing schemes
- The optimal linear secret sharing scheme for any given access structure
- Cryptographic algorithms for privacy-preserving online applications
- Secret sharing schemes for dense forbidden graphs
- Remarks on the classical threshold secret sharing schemes
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Research of secret reconstruction based on coding theory
- Secret-Sharing Schemes: A Survey
- Blakley type secret sharing scheme based on the intersection of subspaces
- Secret sharing schemes with nice access structures
- Secret sharing schemes from three classes of linear codes
- A linear construction of perfect secret sharing schemes
- scientific article; zbMATH DE number 2040937 (Why is no real title available?)
- Secret sharing with linear codes
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- On the construction of \((n,k)\)-schemes of visual cryptography using a class of linear hash functions over a binary field
- ACE with compact ciphertext size and decentralized sanitizers
- On the composition of secret sharing schemes related to codes
- On ideal and weakly-ideal access structures
- Private evaluation of a decision tree based on secret sharing
- Secret sharing schemes from binary linear codes
- The access structure of some secret-sharing schemes
- Improved polynomial secret-sharing schemes
- On Boolean functions derived from linear maps over \(\mathbb{Z}_4\) and their application to secret sharing
- Lower bounds for monotone span programs
- Efficient robust secret sharing from expander graphs
- Fully anonymous secret sharing
- Polynomial secret sharing schemes and algebraic matroids
- Traceable secret sharing revisited
- Secret sharing, slice formulas, and monotone real circuits
- Multilevel secret sharing schemes arising from the normal rational curve
- Computing sharp recovery structures for locally recoverable codes
This page was built for publication: A construction of practical secret sharing schemes using linear block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4341674)
