A note on secret sharing schemes with three homogeneous access structure

DOI10.1016/J.IPL.2006.08.016zbMath1189.94053OpenAlexW2092328651MaRDI QIDQ845987

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)

Related Items (2)

Ideal secret sharing schemes on graph-based $3$-homogeneous access structures ⋮ Ideal secret sharing schemes whose minimal qualified subsets have at most three participants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect secret sharing schemes on five participants
• On the classification of ideal secret sharing schemes
• Some improved bounds on the information rate of perfect secret sharing schemes
• An explication of secret sharing schemes
• On the size of shares for secret sharing schemes
• Tight bounds on the information rate of secret sharing schemes
• Secret sharing schemes with three or four minimal qualified subsets
• Secret sharing schemes on sparse homogeneous access structures with rank three
• Graph decompositions and secret sharing schemes
• Secret sharing schemes with bipartite access structure
• Decomposition constructions for secret-sharing schemes

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