Cheating Prevention in Secret Sharing
Ghodosi, H., and Pieprzyk, J. (2000) Cheating Prevention in Secret Sharing. Lecture Notes in Computer Science. 5th Australasian Conference ACISP 2000 , 10 - 12 July 2000, Brisbane, Qld , pp. 328-341.
|PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
View at Publisher Website: http://dx.doi.org/10.1007/10718964_27
The commonly used technique for cheating detection requires that extra information be given to each participant. However, in a secret sharing scheme when the size of shares increases the security of the system degrades. In this paper we study the cheating problem in Shamir's scheme (in the sense of Tompa and Woll  attack) and present alternative solutions to this problem. First we consider cheating prevention via longer shares. Next we introduce redundant secret sharing schemes and show how they can be used for cheating prevention. Nonlinear secret sharing offers also some protection against cheaters. The work concludes with a discussion about a combined approach.
|Item Type:||Conference Item (Refereed Research Paper - E1)|
|FoR Codes:||08 INFORMATION AND COMPUTING SCIENCES > 0899 Other Information and Computing Sciences > 089999 Information and Computing Sciences not elsewhere classified @ 100%|
|SEO Codes:||89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 100%|
|Deposited On:||22 Aug 2012 12:06|
|Last Modified:||22 Aug 2012 18:05|
Last 12 Months: 1
Repository Staff Only: item control page