Secret Sharing for n-Colorable Graphs with Application to Public Key Cryptography

Details Secret Sharing for n-Colorable Graphs with Application to Public Key Cryptography Secret Sharing for n-Colorable Graphs with Application to Public Key Cryptography

2003-10-28

arxiv.org/abs/cs/0310053v1

Proceedings of 5th NATO Regional Conference on Military Communication and Information Systems, Capturing New CIS Technologies,

Computer Science

Cryptography and Security

10 pages, 5 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Secret Sharing for n-Colorable Graphs with Application to Public Key Cryptography does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Secret Sharing for n-Colorable Graphs with Application to Public Key Cryptography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secret Sharing for n-Colorable Graphs with Application to Public Key Cryptography will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-136954