Characterizing Ideal Weighted Threshold Secret Sharing
From MaRDI portal
(Redirected from Publication:3614213)
Recommendations
- Theory of Cryptography
- A characterisation of ideal weighted secret sharing schemes
- Weighted threshold secret sharing schemes
- Distributive weighted threshold secret sharing schemes
- scientific article; zbMATH DE number 5263446
- Optimum general threshold secret sharing
- A scheme for threshold multi-secret sharing
- Remarks on the classical threshold secret sharing schemes
- A new threshold secret sharing scheme
Cited in
(37)- Monotone circuits for monotone weighted threshold functions
- Weighted threshold secret sharing schemes
- Distributive weighted threshold secret sharing schemes
- Growth of dimension in complete simple games
- On the characterization of weighted simple games
- A general hierarchical graph model for conflict resolution with application to greenhouse gas emission disputes between USA and China
- Efficient explicit constructions of compartmented secret sharing schemes
- Roughly weighted hierarchical simple games
- Practical (fully) distributed signatures provably secure in the standard model
- Efficient integer span program for hierarchical threshold access structure
- A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
- Threshold schemes with weights
- Ideal access structures based on a class of minimal linear codes
- Ideal secret sharing schemes for useful multipartite access structures
- How to share a secret
- An asymptotically perfect secret sharing scheme based on the Chinese remainder theorem
- Operations over linear secret sharing schemes
- Ideal hierarchical secret sharing schemes
- Perfect secret sharing scheme based on vertex domination set
- Ideal multipartite secret sharing schemes
- scientific article; zbMATH DE number 2159653 (Why is no real title available?)
- Ideal Multipartite Secret Sharing Schemes
- scientific article; zbMATH DE number 5263446 (Why is no real title available?)
- Theory of Cryptography
- A hierarchical graph model for conflict resolution with sequential moves
- Secret Sharing Schemes for (k, n)-Consecutive Access Structures
- A Basic Hierarchical Graph Model for Conflict Resolution with Application to Water Diversion Conflicts in China
- Cryptography with weights: MPC, encryption and signatures
- Generalized oblivious transfer by secret sharing
- Weighted secret sharing from wiretap channels
- (k, n)-consecutive access structures
- Reducing the share size of weighted threshold secret sharing schemes via Chow parameters approximation
- Efficient representation of lattice path matroids
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- On the optimization of bipartite secret sharing schemes
- A characterisation of ideal weighted secret sharing schemes
- Extensions of access structures and their cryptographic applications
This page was built for publication: Characterizing Ideal Weighted Threshold Secret Sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614213)
