Secret Sharing for n-Colorable Graphs with Application to Public Key Cryptography
<|reference_start|>Secret Sharing for n-Colorable Graphs with Application to Public Key Cryptography: 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 graph is described and converted to the form, where colors assigned to vertices form the number with entries from Zn. A secret sharing scheme (SSS) for the graph coloring is proposed. The proposed method is applied to the public-key cryptosystem called "Polly Cracker". In this case the graph structure is a public key, while proper 3-colouring of the graph is a private key. We show how to share the private key. Sharing particular n-coloring (color-to-vertex assignment) for the known-structure graph is presented next.<|reference_end|>
@article{kulesza2003secret,
    title={Secret Sharing for n-Colorable Graphs with Application to Public Key
  Cryptography},
    author={Kamil Kulesza and Zbigniew Kotulski},
    journal={Proceedings of 5th NATO Regional Conference on Military
  Communication and Information Systems, Capturing New CIS Technologies, RCMIS
  2003. 22-24 pazdziernik 2003},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0310053},
    primaryClass={cs.CR}
}