scientific article; zbMATH DE number 512874
From MaRDI portal
Publication:4281571
zbMATH Open0796.94007MaRDI QIDQ4281571FDOQ4281571
Authors: Carlo Blundo, Alfredo De Santis, Ugo Vaccaro 
Publication date: 4 October 1994
Title of this publication is not available (Why is that?)
Recommendations
Cited In (29)
- Title not available (Why is that?)
- Nearly serial sharing methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- On secret sharing schemes
- Multi-secret sharing scheme for level-ordered access structures
- On the information rate of secret sharing schemes
- An ideal multi-secret sharing scheme based on MSP
- On the size of shares for secret sharing schemes
- Linear multi-secret sharing schemes based on multi-party computation
- Title not available (Why is that?)
- Probability of shares in secret sharing schemes
- Sharing multiple secrets: Models, schemes and analysis
- Optimal assignment schemes for general access structures based on linear programming
- The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures
- Visual cryptography on graphs
- Graph decompositions and secret sharing schemes
- Strongly secure ramp secret sharing schemes for general access structures
- Sharing many secrets with computational provable security
- Sharing one secret vs. sharing many secrets.
- Title not available (Why is that?)
- A secret-sharing protocol modelled in Maude
- An Efficient Group-Based Secret Sharing Scheme
- Privacy-preserving outsourcing of image feature extraction in cloud computing
- A simple combinatorial treatment of constructions and threshold gaps of ramp schemes
- Randomness in distribution protocols
- Localised multisecret sharing
- Efficient Multiplicative Sharing Schemes
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
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 Q4281571)
