Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs

DOI10.1109/TIT.2007.907505zbMATH Open1325.94149OpenAlexW2097167239MaRDI QIDQ3548962FDOQ3548962

Zhifang Zhang, Liang Liang Xiao, Mu-Lan Liu

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2007.907505

Mathematics Subject Classification ID

Connectivity (05C40) Authentication, digital signatures and secret sharing (94A62)

Cited In (5)

• Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
• RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS
• Secret sharing schemes based on graphical codes
• Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
• Perfect secret sharing scheme based on vertex domination set

This page was built for publication: Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548962)