A note on secret sharing schemes with three homogeneous access structure

DOI10.1016/J.IPL.2006.08.016MaRDI QIDQ845987zbMATH OpenOpenAlexFDO

Authors Jaume Martí-Farré

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.08.016

zbMATH Keywords

cryptographyinformation ratesecret sharing schemes

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Secret sharing schemes with three or four minimal qualified subsets
• Secret sharing schemes on sparse homogeneous access structures with rank three
• Ideal secret sharing schemes on graph-based 3-homogeneous access structures
• scientific article; zbMATH DE number 1952912
• Secret sharing schemes on access structures with intersection number equal to one

Cites work

• scientific article; zbMATH DE number 4123667 (Why is no real title available?)
• scientific article; zbMATH DE number 708803 (Why is no real title available?)
• scientific article; zbMATH DE number 1952912 (Why is no real title available?)
• An explication of secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• Graph decompositions and secret sharing schemes
• On the classification of ideal secret sharing schemes
• On the size of shares for secret sharing schemes
• Perfect secret sharing schemes on five participants
• Secret sharing schemes on sparse homogeneous access structures with rank three
• Secret sharing schemes with bipartite access structure
• Secret sharing schemes with three or four minimal qualified subsets
• Some improved bounds on the information rate of perfect secret sharing schemes
• Tight bounds on the information rate of secret sharing schemes

Cited in

(6)

• scientific article; zbMATH DE number 1952912 (Why is no real title available?)
• Secret sharing schemes on access structures with intersection number equal to one
• Secret sharing schemes with three or four minimal qualified subsets
• Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
• Ideal secret sharing schemes on graph-based 3-homogeneous access structures
• Secret sharing schemes on sparse homogeneous access structures with rank three

This page was built for publication: A note on secret sharing schemes with three homogeneous access structure

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