On secret sharing for graphs

TL;DR

This paper explores methods for sharing secrets represented as graphs, proposing conversion techniques to adapt existing schemes and leveraging graph properties to enhance secret sharing capabilities.

Contribution

It introduces conditions for converting graphs to numbers, enabling existing schemes to be used, and demonstrates how graph properties can extend secret sharing functionalities.

Findings

Conditions for graph-to-number conversion established

Graph properties can enhance secret sharing schemes

Proposed methods maintain scheme properties during conversion

Abstract

In the paper we discuss how to share the secrets, that are graphs. So, far secret sharing schemes were designed to work with numbers. As the first step, we propose conditions for "graph to number" conversion methods. Hence, the existing schemes can be used, without weakening their properties. Next, we show how graph properties can be used to extend capabilities of secret sharing schemes. This leads to proposal of using such properties for number based secret sharing.