Josef Pieprzyk ; Xian-Mo Zhang - On Cheating Immune Secret Sharing

dmtcs:321 - Discrete Mathematics & Theoretical Computer Science, January 1, 2004, Vol. 6 no. 2 - https://doi.org/10.46298/dmtcs.321
On Cheating Immune Secret Sharing

Authors: Josef Pieprzyk 1; Xian-Mo Zhang 1

  • 1 Centre for Advanced Computing - Algorithms and Cryptography

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.


Volume: Vol. 6 no. 2
Published on: January 1, 2004
Imported on: March 26, 2015
Keywords: Secret Sharing,Cheating Prevention,Cheating Immune,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 207 times.
This article's PDF has been downloaded 204 times.