Skip to Main content Skip to Navigation
Journal articles

On Cheating Immune Secret Sharing

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, March 13, 2014 - 5:05:41 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:24 AM
Long-term archiving on: : Friday, June 13, 2014 - 12:11:23 PM


Files produced by the author(s)




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



Record views


Files downloads