Cheating prevention in secret sharing over GF(pt)

Josef Pieprzyk, Xian Mo Zhang

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

14 Citations (Scopus)


The work investigates cheating prevention in secret sharing. It is argued that cheating is immune against cheating if the cheaters gain no advantage over honest participants by submitting invalid shares to the combiner. This work addresses the case when shares and the secret are taken from GF(pt). Two models are considered. The first one examines the case when cheaters consistently submit always invalid shares. The second modeldeal s with cheaters who submit a mixture of valid and invalid shares. For these two models, cheating immunity is defined, properties of cheating immune secret sharing are investigated and their constructions are given.

Original languageEnglish
Title of host publicationProgress in Cryptology - INDOCRYPT 2001
Subtitle of host publicationSecond International Conference on Cryptology in India Chennai, India, December 16–20, 2001 Proceedings
EditorsC. Pandu Rangan, Cunsheng Ding
Place of PublicationBerlin; New York
PublisherSpringer, Springer Nature
Number of pages12
ISBN (Electronic)9783540453116
ISBN (Print)9783540430100
Publication statusPublished - Dec 2001
Event2nd International Conference on Cryptology in India, INDOCRYPT - 2001 - Chennai, India
Duration: 16 Dec 200120 Dec 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)03029743
ISSN (Electronic)16113349


Other2nd International Conference on Cryptology in India, INDOCRYPT - 2001


  • Cheating immunity
  • Nonlinear secret sharing
  • Secret sharing

Fingerprint Dive into the research topics of 'Cheating prevention in secret sharing over GF(p<sup>t</sup>)'. Together they form a unique fingerprint.

Cite this