Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

DOI10.1137/080733802zbMath1213.94137OpenAlexW2028217078WikidataQ59485004 ScholiaQ59485004MaRDI QIDQ5392916

Josef Pieprzyk, Hung-Min Sun, Bying-He Ku, Huaxiong Wang

Publication date: 15 April 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080733802

zbMATH Keywords

linear programminginformation ratesecret sharing schemegraph access structure

Mathematics Subject Classification ID

Linear programming (90C05) Cryptography (94A60) Entropy in general topology (54C70) Directed graphs (digraphs), tournaments (05C20) Authentication, digital signatures and secret sharing (94A62)

Related Items

Secret-sharing schemes for very dense graphs ⋮ Perfect secret sharing scheme based on vertex domination set ⋮ Reduced access structures with four minimal qualified subsets on six participants