scientific article; zbMATH DE number 4123667
From MaRDI portal
Publication:4204100
Recommendations
Cited in
(80)- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Multipartite secret sharing by bivariate interpolation
- An impossibility result on graph secret sharing
- On the classification of ideal secret sharing schemes
- Some improved bounds on the information rate of perfect secret sharing schemes
- Strongly ideal secret sharing schemes
- An explication of secret sharing schemes
- On the information ratio of non-perfect secret sharing schemes
- Generation of key predistribution schemes using secret sharing schemes
- Randomness in secret sharing and visual cryptography schemes
- Graph decompositions and secret sharing schemes
- A note on optimal metering schemes.
- Some democratic secret sharing schemes
- On the information rate of perfect secret sharing schemes
- On constructing privileged coalitions in Shamir's type scheme
- Generalized threshold secret sharing and finite geometry
- On abelian and homomorphic secret sharing schemes
- Quadratic secret sharing and conditional disclosure of secrets
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
- New generalized secret-sharing schemes with points on a hyperplane using a Wronskian matrix
- Efficient explicit constructions of compartmented secret sharing schemes
- Roughly weighted hierarchical simple games
- Local bounds for the optimal information ratio of secret sharing schemes
- Sharing many secrets with computational provable security
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- Secret sharing schemes on access structures with intersection number equal to one
- On ASGS framework: general requirements and an example of implementation
- Ideal hierarchical secret sharing and lattice path matroids
- Secret sharing on regular bipartite access structures
- Secret sharing schemes for dense forbidden graphs
- On the information level of modular secret-sharing schemes
- On dynamic distribution of private keys over MANETs
- Conjunctive hierarchical secret sharing scheme based on MDS codes
- Remarks on the classical threshold secret sharing schemes
- Secret-sharing schemes for very dense graphs
- Robust vector space secret sharing schemes
- Secret-Sharing Schemes: A Survey
- Ideal secret sharing schemes for useful multipartite access structures
- Ideal hierarchical secret sharing schemes
- scientific article; zbMATH DE number 5158890
- Dynamic vector space secret sharing based on certificates
- On Linear Secret Sharing for Connectivity in Directed Graphs
- scientific article; zbMATH DE number 1189396 (Why is no real title available?)
- scientific article; zbMATH DE number 68924 (Why is no real title available?)
- New results and applications for multi-secret sharing schemes
- scientific article; zbMATH DE number 708819 (Why is no real title available?)
- scientific article; zbMATH DE number 1031005 (Why is no real title available?)
- Ideal multipartite secret sharing schemes
- scientific article; zbMATH DE number 1498786 (Why is no real title available?)
- Linear threshold multisecret sharing schemes
- Linear algebra approach to secret sharing schemes
- scientific article; zbMATH DE number 2108154 (Why is no real title available?)
- Universally ideal secret-sharing schemes
- Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
- Perfect secret sharing schemes based on generalized Kirkman squares
- Mapping enlargements preserving identification property
- Secret sharing schemes for compartmented access structures
- scientific article; zbMATH DE number 4193603 (Why is no real title available?)
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- Matroids Can Be Far from Ideal Secret Sharing
- Non-admissible tracks in Shamirs scheme
- A key sharing scheme over \(\mathrm{GF}(2^5)\) to use in ECC
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
- Approximation and decomposition in lattices of clutters
- Access structures determined by uniform polymatroids
- Admissible tracks in Shamir's scheme
- Ideal uniform multipartite secret sharing schemes
- A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations
- Generalized oblivious transfer by secret sharing
- Restricted adaptive oblivious transfer
- New method to compute bounds on the optimal information rate of secret sharing schemes
- Reducing the share size of weighted threshold secret sharing schemes via Chow parameters approximation
- Efficient representation of lattice path matroids
- Three-level secret sharing schemes from the twisted cubic
- Polynomial secret sharing schemes and algebraic matroids
- On the optimization of bipartite secret sharing schemes
- Multilevel secret sharing schemes arising from the normal rational curve
- A note on secret sharing schemes with three homogeneous access structure
- Extensions of access structures and their cryptographic applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4204100)
