Abstract
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.
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 language | English |
---|---|
Title of host publication | DMS 2001 |
Subtitle of host publication | Seventh International Conference on Distributed Multimedia Systems : workshop proceedings |
Place of Publication | Taipei, Taiwan |
Publisher | Tamkang University |
Pages | 154-161 |
Number of pages | 8 |
Publication status | Published - 2001 |
Event | International Workshop on Cryptology and Network Security - Taipei Duration: 26 Sep 2001 → 28 Sep 2001 |
Workshop
Workshop | International Workshop on Cryptology and Network Security |
---|---|
City | Taipei |
Period | 26/09/01 → 28/09/01 |