On the graph coloring check-digit scheme with applications to verifiable secret sharing
| dc.creator | Kulesza, Kamil | |
| dc.creator | Kotulski, Zbigniew | |
| dc.date | 2002-08-06 | |
| dc.date.accessioned | 2026-07-07T03:18:46Z | |
| dc.date.available | 2026-07-07T03:18:46Z | |
| dc.description | 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 result concerning properties of n-colorable graphs is stated and proven. From this result we derive graph coloring check-digit scheme. Feasibility of proposed scheme increases with the size of the number, which digits are checked and overall probability of errors. The check-digit scheme is used to build shares verification method that does not require cooperation of the third party. It allows implementing verification structure different from the access structure. It does not depend on particular secret sharing method. It can be used as long as the secret shares can be represented by numbers or graphs. | |
| dc.identifier | https://arxiv.org/abs/cs/0208007 | |
| dc.identifier | http://arxiv.org/abs/cs/0208007 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31251 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Combinatorics | |
| dc.subject | D.4.6; E.4 | |
| dc.title | On the graph coloring check-digit scheme with applications to verifiable secret sharing | |
| dc.type | text |