STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An explication of secret sharing schemes
Designs, Codes and Cryptography
Communications of the ACM
Representing Small Identically Self-Dual Matroids by Self-Dual Codes
SIAM Journal on Discrete Mathematics
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Covering and secret sharing with linear codes
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Secret-sharing schemes: a survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Algebraic geometric secret sharing schemes and secure multi-party computations over small fields
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
IEEE Transactions on Information Theory
Minimal vectors in linear codes
IEEE Transactions on Information Theory
Graph theoretic error-correcting codes
IEEE Transactions on Information Theory
Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs
IEEE Transactions on Information Theory
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
IEEE Transactions on Information Theory
Universally ideal secret-sharing schemes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We study the access structure and multiplicativity of linear secret sharing schemes based on codes from complete graphs. First, we describe the access structure of the schemes based on cut-set and cycle codes. Second, we show that the class of access structures based on odd cycles cannot be realized by ideal multiplicative linear secret sharing schemes over any finite field. This can be seen as a contribution to the characterization of access structures of ideal multiplicative schemes. The access structure based on odd cycles corresponds to the scheme based on the dual of the extended cycle code. Finally, we show that we can obtain ideal multiplicative linear secret sharing scheme based on the dual of an augmented extended cycle code.