Efficient algorithm to construct phi function in vector space secret sharing scheme and application of secret sharing scheme in Visual Cryptography

<p>Secret Sharing refers to a method through which a secret key <em>K</em> can be shared among a group of authorized participants, such that when they come together later, they can figure out the secret key <em>K</em> to decrypt the encrypted message. Any group which is not authorized cannot determine the secret key <em>K</em>. Some of the important secret schemes are Shamir Threshold Scheme, Monotone Circuit Scheme, and Brickell Vector Space Scheme. Brikell’s vector space secret sharing construction requires the existence of a function from a set of participant <em>P</em> in to vector space <em>Zdp</em>, where <em>p</em> is a prime number and <em>d</em> is a positive number. There is no known algorithm to construct such a function in general. We developed an efficient algorithm to construct function for some special secret sharing scheme. We also give an algorithm to demonstrate how a secret sharing scheme can be used in visual cryptography.</p>

Name thesis:degree_name

Master of Science

Discipline thesis:degree_discipline

Department of Mathematics and Computer Science

Year

2012

Author dc:creator

• Potay, Sunny

Contributors dc:contributor

• Dr. Mustafa Atici, Director, Dr. James Gary, Dr. Qi Li

• Visual cryptography
• Vector space
• Phi function
• Computer Sciences
• Theory and Algorithms

Repository record dc:identifier

https://digitalcommons.wku.edu/theses/1151

OAI identifier oai:identifier

oai:digitalcommons.wku.edu:theses-2154