Secret Sharing Schemes for Very Dense Graphs

DOI10.1007/978-3-642-32009-5_10zbMath1296.94079OpenAlexW2084674842MaRDI QIDQ2914258

Yuval Mintz, Amos Beimel, Oriol Farràs

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_10

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Density (toughness, etc.) (05C42)

Related Items (3)

Erdős-Pyber theorem for hypergraphs and secret sharing ⋮ Exact information ratios for secret sharing on small graphs with girth at least 5 ⋮ Secret sharing on the \(d\)-dimensional cube

This page was built for publication: Secret Sharing Schemes for Very Dense Graphs