Vector space secret sharing and an efficient algorithm to construct a φ function

  • Authors:
  • Mustafa Atici

  • Affiliations:
  • Western Kentucky University, Bowling Green, KY

  • Venue:
  • Proceedings of the 51st ACM Southeast Conference
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The threshold scheme, the monotone circuit construction, and the vector space construction are some of the well-known secret sharing schemes in cryptography. The threshold and monotone circuit secret sharing schemes are fairly easy to construct for any given access structure Γ. The construction of a secret sharing scheme realizing a given access structure Γ with Vector Space Construction requires the existence of a function φ from a set of participants into a vector space, that is, φ: P → (Zp)d. This function φ must satisfy certain conditions. There is no known algorithm to construct such a function φ in general. Constructions are mainly done by trial and error. In this paper, we develop polynomial algorithms to construct φ functions for vector space secret sharing scheme realizing certain types of access structures. Some examples are given to illustrate the algorithms.