Cheating prevention in secret sharing over GF(pt)

14Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Pieprzyk, J., & Zhang, X. M. (2001). Cheating prevention in secret sharing over GF(pt). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2247, pp. 79–90). Springer Verlag. https://doi.org/10.1007/3-540-45311-3_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free