scientific article; zbMATH DE number 512874

MaRDI QIDQ4281571zbMATH OpenFDO

Authors Carlo Blundo, Alfredo De Santis, Ugo Vaccaro

Publication date 4 October 1994

zbMATH Keywords

lower boundsmulti-secret sharing schemeoptimal protocol

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Publication:4940693
• Sharing one secret vs. sharing many secrets.
• scientific article; zbMATH DE number 176543
• Sharing multiple secrets: Models, schemes and analysis

Cited in

(29)

• scientific article; zbMATH DE number 1406777 (Why is no real title available?)
• Nearly serial sharing methods
• scientific article; zbMATH DE number 176543 (Why is no real title available?)
• scientific article; zbMATH DE number 1445314 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1676642 (Why is no real title available?)
• 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.
• A secret-sharing protocol modelled in Maude
• scientific article; zbMATH DE number 1834656 (Why is no real title available?)
• 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
• Localised multisecret sharing
• Randomness in distribution protocols
• Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
• Efficient Multiplicative Sharing Schemes

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)