{"id":{"repo_id":"wku-diss","oai_identifier":"oai:digitalcommons.wku.edu:theses-2154"},"canonical_url":"https://search.dev.ndltd.org/etd/wku-diss/oai:digitalcommons.wku.edu:theses-2154","repository":{"repo_id":"wku-diss","name":"Western Kentucky University","base_url":"https://digitalcommons.wku.edu/do/oai/"},"display":{"title":"Efficient algorithm to construct phi function in vector space secret sharing scheme and application of secret sharing scheme in Visual Cryptography","abstract":"<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>","abstract_html":"&lt;p&gt;Secret Sharing refers to a method through which a secret key &lt;em&gt;K&lt;/em&gt; can be shared among a group of authorized participants, such that when they come together later, they can figure out the secret key &lt;em&gt;K&lt;/em&gt; to decrypt the encrypted message. Any group which is not authorized cannot determine the secret key &lt;em&gt;K&lt;/em&gt;. 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 &lt;em&gt;P&lt;/em&gt; in to vector space &lt;em&gt;Zdp&lt;/em&gt;, where &lt;em&gt;p&lt;/em&gt; is a prime number and &lt;em&gt;d&lt;/em&gt; 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.&lt;/p&gt;","abstract_has_math":false,"creators":["Potay, Sunny"],"institution":null,"degree_name":"Master of Science","degree_level":null,"degree_discipline":"Department of Mathematics and Computer Science","degree_department":null,"school":null,"contributors":["Dr. Mustafa Atici, Director, Dr. James Gary, Dr. Qi Li"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-05-01T07:00:00Z","date_published":"2012-05-01T07:00:00Z","updated_at":"2026-07-24T06:08:16Z","subjects":["Visual cryptography","Vector space","Phi function","Computer Sciences","Theory and Algorithms"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.wku.edu/theses/1151","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Dr. Mustafa Atici, Director, Dr. James Gary, Dr. Qi Li"]},{"key":"dc:creator","label":"Author","values":["Potay, Sunny"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Mathematics and Computer Science"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Visual cryptography","Vector space","Phi function","Computer Sciences","Theory and Algorithms"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.wku.edu/theses/1151"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<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>"]},{"key":"dc:title","label":"Title","values":["Efficient algorithm to construct phi function in vector space secret sharing scheme and application of secret sharing scheme in Visual Cryptography"]}]}],"canonical_facts":{"dc:contributor":["Dr. Mustafa Atici, Director, Dr. James Gary, Dr. Qi Li"],"dc:creator":["Potay, Sunny"],"dc:description.abstract":["<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>"],"dc:identifier":["https://digitalcommons.wku.edu/theses/1151"],"dc:subject":["Visual cryptography","Vector space","Phi function","Computer Sciences","Theory and Algorithms"],"dc:title":["Efficient algorithm to construct phi function in vector space secret sharing scheme and application of secret sharing scheme in Visual Cryptography"],"dc:type":["Thesis"],"thesis:degree_discipline":["Department of Mathematics and Computer Science"],"thesis:degree_name":["Master of Science"]},"updated_at":"2026-07-24T06:08:16Z"}