On the classification of ideal secret sharing schemes

DOI10.1007/BF00196772zbMath0747.94010MaRDI QIDQ1180513

Ernest F. Brickell, Daniel M. Davenport

Publication date: 27 June 1992

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

matroids; nearfields; secret sharing scheme

Mathematics Subject Classification ID

94A60: Cryptography

05B35: Combinatorial aspects of matroids and geometric lattices

Related Items

Matroids Can Be Far from Ideal Secret Sharing, Fully dynamic secret sharing schemes, On the information rate of secret sharing schemes, Lower bounds for monotone span programs, An explication of secret sharing schemes, General information dispersal algorithms, Ideal homomorphic secret sharing schemes over cyclic groups, Matroid representations by partitions, On the size of shares for secret sharing schemes, Geometric secret sharing schemes and their duals, Anonymous secret sharing schemes, On identification secret sharing schemes., Probability of shares in secret sharing schemes, Graph decompositions and secret sharing schemes, On the information rate of perfect secret sharing schemes, Secret sharing schemes on access structures with intersection number equal to one, How to share a secret

Cites Work

• On the efficiency of representability tests for matroids
• How to share a secret
• A Combinatorial Approach to Threshold Schemes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item