Ideal secret sharing schemes on graph-based $3$-homogeneous access structures
From MaRDI portal
Publication:4958087
DOI10.22108/toc.2021.123661.1739zbMath1488.94086OpenAlexW3136711570MaRDI QIDQ4958087
Bagher Bagherpour, Shahrooz Janbaz, Ali Zaghian
Publication date: 6 September 2021
Full work available at URL: https://doaj.org/article/3d0d0b1c9770463e9ed508c1b1af60e6
cryptographysecret sharingideal access structures3-homogeneous access structuresgraph-based access structures
Applications of graph theory (05C90) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Cites Work
- Perfect secret sharing schemes on five participants
- A note on secret sharing schemes with three homogeneous access structure
- Hierarchical threshold secret sharing
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Multipartite secret sharing by bivariate interpolation
- On the classification of ideal secret sharing schemes
- Tight bounds on the information rate of secret sharing schemes
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs
- Secret sharing schemes with three or four minimal qualified subsets
- Secret sharing schemes on sparse homogeneous access structures with rank three
- Graph decompositions and secret sharing schemes
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
- Secret sharing schemes on access structures with intersection number equal to one
- Secret sharing schemes with bipartite access structure
- Optimal Information Rate of Secret Sharing Schemes on Trees
- How to share a secret
- Decomposition constructions for secret-sharing schemes
This page was built for publication: Ideal secret sharing schemes on graph-based $3$-homogeneous access structures
