Cheating Prevention in Linear Secret Sharing

  • Authors:
  • Josef Pieprzyk;Xian-Mo Zhang

  • Affiliations:
  • -;-

  • Venue:
  • ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cheating detection in linear secret sharing is considered. The model of cheating extends the Tompa-Woll attack and includes cheating during multiple (unsuccessful) recovery of the secret. It is shown that shares in most linear schemes can be split into subshares. Subshares can be used by participants to trade perfectness of the scheme with cheating prevention. Evaluation of cheating prevention is given in the context of different strategies applied by cheaters.