Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study the access structure and multiplicativity of linear secret sharing schemes based on codes from complete graphs. First,  describe the access structure of the schemes based on cut-set and cycle codes. Second,  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,  show that  can obtain ideal multiplicative linear secret sharing scheme based on the dual of an augmented extended cycle code.
['Ying Gao', 'Romar dela Cruz']
I am writing a research paper on a idea Secret sharing schemes based on graphical codes
[{"from": "human", "value": "I am writing a research paper on a idea Secret sharing schemes based on graphical codes"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study the access structure and multiplicativity of linear secret sharing schemes based on codes from complete graphs. First,  describe the access structure of the schemes based on cut-set and cycle codes. Second,  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,  show that  can obtain ideal multiplicative linear secret sharing scheme based on the dual of an augmented extended cycle code."}]