Cheating immune secret sharing

Xian-Mo Zhang, Josef Pieprzyk

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

11 Citations (Scopus)

Abstract

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 Σnc=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.

Original languageEnglish
Title of host publicationInformation and communications security
Subtitle of host publicationThird International Conference, ICICS 2001, Xian, China, November 13-16, 2001 : proceedings
EditorsSihan Qing, Tatsuaki Okamoto, Jianying Zhou
Place of PublicationNew York
PublisherSpringer, Springer Nature
Pages144-149
Number of pages6
Volume2229
ISBN (Print)3540428801
DOIs
Publication statusPublished - 2001
EventInternational Conference on Information and Communications Security (3rd : 2001) - Xi'an, China
Duration: 13 Nov 200116 Nov 2001

Publication series

NameLecture notes in computer science
PublisherSpringer-Verlag
Volume2229

Conference

ConferenceInternational Conference on Information and Communications Security (3rd : 2001)
CityXi'an, China
Period13/11/0116/11/01

Fingerprint Dive into the research topics of 'Cheating immune secret sharing'. Together they form a unique fingerprint.

Cite this