On the graph coloring check-digit scheme with applications to verifiable secret sharing

Details On the graph coloring check-digit scheme with applications to verifiable secret sharing On the graph coloring check-digit scheme with applications to verifiable secret sharing

2002-08-06

arxiv.org/abs/cs/0208007v1

Computer Science

Cryptography and Security

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the graph coloring check-digit scheme with applications to verifiable secret sharing 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 On the graph coloring check-digit scheme with applications to verifiable secret sharing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the graph coloring check-digit scheme with applications to verifiable secret sharing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427650