Perfect secret sharing scheme based on vertex domination set

DOI10.1080/00207160.2014.941360zbMath1325.05123OpenAlexW1984848305MaRDI QIDQ3451391

No author found.

Publication date: 16 November 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://psasir.upm.edu.my/id/eprint/45803/1/RANK.pdf

zbMATH Keywords

rankindependent dominating setinformation ratesecret sharing schemeuniform access structure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

New computational and statistical models in science and economics ⋮ Ideal access structures based on a class of minimal linear codes

Cites Work

• Unnamed Item
• On the information rate of secret sharing schemes
• Hypergraph decomposition and secret sharing
• Some improved bounds on the information rate of perfect secret sharing schemes
• Graph decompositions and secret sharing schemes
• Recursive constructions for perfect secret sharing schemes
• How to share a secret
• Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs
• Characterizing Ideal Weighted Threshold Secret Sharing
• Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

This page was built for publication: Perfect secret sharing scheme based on vertex domination set