On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes

DOI10.1007/978-3-642-21518-6_9zbMath1295.94167OpenAlexW39607791MaRDI QIDQ3019920

Zhanfei Zhou

Publication date: 29 July 2011

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21518-6_9

zbMATH Keywords

independent sequencesecret sharing schemegraph-based access structurealternating cycle-free matching of a bipartite graph

Mathematics Subject Classification ID

Cryptography (94A60)

This page was built for publication: On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes