Cheating immune secret sharing

Zhang, Xian-Mo & Pieprzyk, Josef (2001) Cheating immune secret sharing. Lecture Notes in Computer Science : Information and Communications Security, 2229, pp. 144-149.

View at publisher


We consider secret sharing with binary shares. This model allows us to use the well developed theory of cryptographically strong boolean functions. We prove that for given secret sharing, the average cheating probability over all cheating and original vectors, i.e., ρ ¯= 1 n ⋅ 2 −n ∑ n c=1 ∑ α∈Vn ρ c,α , satisfies ρ ¯⩾ 1 2 , and the equality holds ⇔ ρc,α satisfies ρc,α = 1/2 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.

Impact and interest:

10 citations in Scopus
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 73322
Item Type: Journal Article
Refereed: Yes
DOI: 10.1007/3-540-45600-7_16
ISSN: 0302-9743
Divisions: Current > QUT Faculties and Divisions > Science & Engineering Faculty
Deposited On: 03 Jul 2014 02:45
Last Modified: 21 Jun 2017 20:02

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page