Nonlinear secret sharing immune against cheating

Pieprzyk, Josef & Zhang, Xian-Mo (2001) Nonlinear secret sharing immune against cheating. In International Workshop on Cryptology and Network Security, 26 - 28 September 2001, Taipei, Taiwan.

View at publisher (open access)


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.

Impact and interest:

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: 74279
Item Type: Conference Paper
Refereed: No
Divisions: Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2001 [please consult the author]
Deposited On: 23 Jul 2014 01:39
Last Modified: 23 Jul 2014 01:39

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page