The lower bound and exact value of the information rate of some developed graph access structures

DOI10.22199/issn.0717-6279-2020-04-0063zbMath1453.94132OpenAlexW3042694319MaRDI QIDQ5145937

Abbas Cheraghi

Publication date: 22 January 2021

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22199/issn.0717-6279-2020-04-0063

zbMATH Keywords

information rateperfect secret sharing schemegraph access structure

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
• Perfect secret sharing schemes on five participants
• Some improved bounds on the information rate of perfect secret sharing schemes
• Graph decompositions and secret sharing schemes
• On the information rate of perfect secret sharing schemes
• The complexity of the graph access structures on six participants
• Finding lower bounds on the complexity of secret sharing schemes by linear programming
• Exact information ratios for secret sharing on small graphs with girth at least 5
• Perfect secret sharing schemes for graph access structures on six participants
• How to share a secret
• Cryptography

This page was built for publication: The lower bound and exact value of the information rate of some developed graph access structures