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.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2004, 6 (2), pp.253-264
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00959007
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : jeudi 13 mars 2014 - 17:05:41
Dernière modification le : mercredi 29 novembre 2017 - 10:26:24
Document(s) archivé(s) le : vendredi 13 juin 2014 - 12:11:23

Fichier

dm060206.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00959007, version 1

Collections

Citation

Josef Pieprzyk, Xian-Mo Zhang. On Cheating Immune Secret Sharing. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2004, 6 (2), pp.253-264. 〈hal-00959007〉

Partager

Métriques

Consultations de la notice

96

Téléchargements de fichiers

149