Universally ideal secret-sharing schemes

DOI10.1109/18.335890MaRDI QIDQ4838633zbMATH OpenOpenAlexFDO

Authors Amos Beimel, Benny Chor

Publication date 12 July 1995

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.335890

zbMATH Keywords

access structurecryptographymatroidssecret-sharing schemeuniversally ideal

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 708819
• scientific article; zbMATH DE number 4195886
• scientific article; zbMATH DE number 4123667
• On the classification of ideal secret sharing schemes
• Strongly ideal secret sharing schemes

Cited in

(34)

• Strongly ideal secret sharing schemes
• Ideal homomorphic secret sharing schemes over cyclic groups
• Matroid representations by partitions
• Measuring, simulating and exploiting the head concavity phenomenon in BKZ
• Optimal linear multiparty conditional disclosure of secrets protocols
• Classes of matroids closed under minors and principal extensions
• Randomness in secret sharing and visual cryptography schemes
• On ideal homomorphic secret sharing schemes and their decomposition
• Secret sharing schemes based on graphical codes
• Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems
• Optimal assignment schemes for general access structures based on linear programming
• Efficient explicit constructions of compartmented secret sharing schemes
• Ideal secret sharing schemes with multiple secrets
• Secret sharing schemes for dense forbidden graphs
• Secret-sharing schemes for very dense graphs
• Secret-Sharing Schemes: A Survey
• Ideal secret sharing schemes for useful multipartite access structures
• Threshold Secret Sharing Requires a Linear Size Alphabet
• On Linear Secret Sharing for Connectivity in Directed Graphs
• Complexity of universal access structures
• scientific article; zbMATH DE number 4123667 (Why is no real title available?)
• scientific article; zbMATH DE number 708819 (Why is no real title available?)
• Threshold secret sharing requires a linear-size alphabet
• Matroids Can Be Far from Ideal Secret Sharing
• Secret sharing schemes for ports of matroids of rank 3.
• Information Security and Cryptology
• The use of mathematical linguistic methods in creating secret sharing threshold algorithms
• On ideal and weakly-ideal access structures
• How to recover a secret with O(n) additions
• Ideal uniform multipartite secret sharing schemes
• A fully dynamic multi-secret sharing scheme with redundant authorization
• Lower bounds for monotone span programs
• Secret-sharing schemes for high slices
• Polynomial secret sharing schemes and algebraic matroids

This page was built for publication: Universally ideal secret-sharing schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838633)