Editing Secret Sharing for Graphs: Extending Capabilities and Enhancing Security

Title: Secret Sharing for Graphs: Extending Capabilities and Enhancing Security

Research Question: How can graph theory be applied to enhance the security of secret sharing schemes?

Methodology: The researchers propose a method to convert graphs into numbers, allowing them to be used in existing secret sharing schemes. They also explore how graph properties can be used to extend the capabilities of these schemes.

Results: The researchers present conditions for "graph to number" conversion methods and show how graph properties can be used to enhance the security of secret sharing schemes. They provide an example of a conversion method and discuss graph properties useful for extended capabilities.

Implications: The research suggests that using graphs in secret sharing schemes can lead to more secure and efficient protocols. It also provides a new perspective on the interaction of protocol parts and can lead to further advancements in the field.

Link to Article: https://arxiv.org/abs/0310052v1
Authors: 
arXiv ID: 0310052v1

[[Category:Computer Science]]
[[Category:Secret]]
[[Category:Sharing]]
[[Category:Can]]
[[Category:Graph]]
[[Category:Schemes]]