3 citations · 7 across the 5 of their papers we have counts for
Showing cs.CRShow all
3 papers · 1 filter
cs.CR2003
Secret Sharing for n-Colorable Graphs with Application to Public Key Cryptography
Kamil Kulesza, Zbigniew Kotulski
At the beginning some results from the field of graph theory are presented. Next we show how to share a secret that is proper n-coloring of the graph, with the known structure. The…
cs.CR2003★ 3 cited
On secret sharing for graphs
Kamil Kulesza, Zbigniew Kotulski
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 "…
cs.CR2002★ 1 cited
On the graph coloring check-digit scheme with applications to verifiable secret sharing
Kamil Kulesza, Zbigniew Kotulski
In the paper we apply graph vertex coloring for verification of secret shares. We start from showing how to convert any graph into the number and vice versa. Next, theoretical resu…