Ideal secret sharing schemes on graph-based 3-homogeneous access structures

DOI10.22108/TOC.2021.123661.1739MaRDI QIDQ4958087zbMATHOpenAlexFDO

Authors Shahrooz Janbaz, Bagher Bagherpour, Ali Zaghian

Publication date 6 September 2021

Full work available at URL https://doaj.org/article/3d0d0b1c9770463e9ed508c1b1af60e6

zbMATH Keywords

cryptographysecret sharingideal access structures3-homogeneous access structuresgraph-based access structures

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Ideal homogeneous access structures constructed from graphs
• Secret sharing schemes on sparse homogeneous access structures with rank three
• A note on secret sharing schemes with three homogeneous access structure
• Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants
• Ideal secret sharing schemes whose minimal qualified subsets have at most three participants

Cites work

• A note on secret sharing schemes with three homogeneous access structure
• Decomposition constructions for secret-sharing schemes
• Graph decompositions and secret sharing schemes
• Hierarchical threshold secret sharing
• How to share a secret
• Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
• Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
• Multipartite secret sharing by bivariate interpolation
• On the classification of ideal secret sharing schemes
• Optimal Information Rate of Secret Sharing Schemes on Trees
• Optimal information ratio of secret sharing schemes on Dutch windmill graphs
• Perfect secret sharing schemes on five participants
• Secret sharing schemes on access structures with intersection number equal to one
• Secret sharing schemes on sparse homogeneous access structures with rank three
• Secret sharing schemes with bipartite access structure
• Secret sharing schemes with three or four minimal qualified subsets
• Tight bounds on the information rate of secret sharing schemes

Cited in

(4)

• An efficient publicly verifiable and proactive secret sharing scheme
• Ideal homogeneous access structures constructed from graphs
• A note on secret sharing schemes with three homogeneous access structure
• Secret sharing schemes on sparse homogeneous access structures with rank three

This page was built for publication: Ideal secret sharing schemes on graph-based 3-homogeneous access structures

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