scientific article; zbMATH DE number 553905

zbMATH Open0788.94013MaRDI QIDQ4288075FDOQ4288075

Authors: Keith M. Martin 

Publication date: 21 April 1994

Title of this publication is not available (Why is that?)

Recommendations

• Recursive constructions for perfect secret sharing schemes
• An explication of secret sharing schemes
• New bounds on the information rate of secret sharing schemes
• On the size of shares for secret sharing schemes
• Some improved bounds on the information rate of perfect secret sharing schemes

zbMATH Keywords

access structuresperfect secret sharing schememeasure of efficiencyoptimal information rates

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (17)

• Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes
• A nonlinear secret sharing scheme
• Weighted decomposition construction for perfect secret sharing schemes
• Rearrangements of access structures and their realizations in secret sharing schemes
• More information theoretical inequalities to be used in secret sharing?
• Randomness in secret sharing and visual cryptography schemes
• Secret sharing schemes based on extension fields
• A new approach to construct secret sharing schemes based on field extensions
• On the information rate of secret sharing schemes
• Operations over linear secret sharing schemes
• An explication of secret sharing schemes
• Reduced access structures with four minimal qualified subsets on six participants
• Anonymous secret sharing schemes
• Optimal assignment schemes for general access structures based on linear programming
• On the information rate of perfect secret sharing schemes
• Graph decompositions and secret sharing schemes
• The access structure of some secret-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 Q4288075)