Secret Sharing for Graphs: Extending Capabilities and Enhancing Security: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:4514:45, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,169 bytes +1,169‎ Created page with "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..."
Retrieved from "https://simplesci.org/wiki/Secret_Sharing_for_Graphs:_Extending_Capabilities_and_Enhancing_Security"