On Cheating Immune Secret Sharing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2004

On Cheating Immune Secret Sharing


The paper addresses the cheating prevention in secret sharing. We consider secret sharing with binary shares. The secret also is binary. This model allows us to use results and constructions from the well developed theory of cryptographically strong boolean functions. In particular, we prove that for given secret sharing, the average cheating probability over all cheating vectors and all original vectors, i.e., 1/n 2^n ∑ _c=1...n ∑ _α ∈V n ρ _c,α , denoted by øverlineρ , satisfies øverlineρ ≥ \frac12 , and the equality holds if and only if ρ _c,α satisfies ρ _c,α = \frac12 for every cheating vector δ _c and every original vector α . In this case the secret sharing is said to be cheating immune. We further establish a relationship between cheating-immune secret sharing and cryptographic criteria of boolean functions.This enables us to construct cheating-immune secret sharing.
Fichier principal
Vignette du fichier
dm060206.pdf (88.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00959007 , version 1 (13-03-2014)



Josef Pieprzyk, Xian-Mo Zhang. On Cheating Immune Secret Sharing. Discrete Mathematics and Theoretical Computer Science, 2004, Vol. 6 no. 2 (2), pp.253-264. ⟨10.46298/dmtcs.321⟩. ⟨hal-00959007⟩


59 View
684 Download



Gmail Facebook X LinkedIn More