Nonlinear secret sharing immune against cheating

Josef Pieprzyk, Xian-Mo Zhang

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review


The paper investigates the design of secret sharing that is immune against cheating (as defined by the Tompa-Woll attack). We examine secret sharing with binary shares and secrets. Bounds on the probability of successful cheating are
given for two cases. The first case relates to secret sharing based on bent functions and results in a non-perfect scheme. The second case considers perfect secret sharing built on highly nonlinear balanced Boolean functions.
Original languageEnglish
Title of host publicationDMS 2001
Subtitle of host publicationSeventh International Conference on Distributed Multimedia Systems : workshop proceedings
Place of PublicationTaipei, Taiwan
PublisherTamkang University
Number of pages8
Publication statusPublished - 2001
EventInternational Workshop on Cryptology and Network Security - Taipei
Duration: 26 Sep 200128 Sep 2001


WorkshopInternational Workshop on Cryptology and Network Security


Dive into the research topics of 'Nonlinear secret sharing immune against cheating'. Together they form a unique fingerprint.

Cite this