Ideal Threshold Schemes from Orthogonal Arrays

  • Authors:

  • Josef Pieprzyk;Xiam-Mo Zhang

  • Affiliations:

  • -;-

  • Venue:
  • ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

The work investigates the design of ideal threshold secret sharing in the context of cheating prevention. We showed that each orthogonal array is exactly a defining matrix of an ideal threshold scheme. To prevent cheating, defining matrices should be nonlinear so both the cheaters and honest participants have the same chance of guessing of the valid secret. The last part of the work shows how to construct nonlinear secret sharing based on orthogonal arrays.