Secret Sharing Schemes with Detection of Cheaters for a General Access Structure
Designs, Codes and Cryptography
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure
Information Processing Letters
A Linear Algebraic Approach to Metering Schemes
Designs, Codes and Cryptography
Secret sharing schemes with three or four minimal qualified subsets
Designs, Codes and Cryptography
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
A note on secret sharing schemes with three homogeneous access structure
Information Processing Letters
Ideal Multipartite Secret Sharing Schemes
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
On Linear Secret Sharing for Connectivity in Directed Graphs
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
Designs, Codes and Cryptography
Proceedings of the 5th ACM symposium on QoS and security for wireless and mobile networks
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
Constructing general dynamic group key distribution schemes with decentralized user join
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
On secret sharing schemes, matroids and polymatroids
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Secret sharing schemes on access structures with intersection number equal to one
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
On the optimization of bipartite secret sharing schemes
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
SIAM Journal on Discrete Mathematics
Ideal secret sharing schemes for useful multipartite access structures
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Optimal complexity of secret sharing schemes with four minimal qualified subsets
Designs, Codes and Cryptography
Multipartite secret sharing by bivariate interpolation
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Ideal hierarchical secret sharing schemes
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Characterizing ideal weighted threshold secret sharing
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On codes, matroids and secure multi-party computation from linear secret sharing schemes
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On the optimization of bipartite secret sharing schemes
Designs, Codes and Cryptography
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
On threshold self-healing key distribution schemes
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
On matroids and non-ideal secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Natural generalizations of threshold secret sharing
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Collusion resistant self-healing key distribution in mobile wireless networks
International Journal of Wireless and Mobile Computing
Information Sciences: an International Journal
| Hi-index | 754.84 |
We study the information rate of secret sharing schemes whose access structure is bipartite. In a bipartite access structure there are two classes of participants and all participants in the same class play an equivalent role in the structure. We characterize completely the bipartite access structures that can be realized by an ideal secret sharing scheme. Both upper and lower bounds on the optimal information rate of bipartite access structures are given. These results are applied to the particular case of weighted threshold access structure with two weights