Cheating prevention in secret sharing
Ghodosi, Hossein, and Pieprzyk, Josef (2000) Cheating prevention in secret sharing. Lecture notes in computer science, 1841 . pp. 328-341.
|PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
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.
© 2000 Springer Verlag. The published version of this article can be accessed via Springer Link. Use hypertext links above.
|Keywords:||Secret sharing schemes, Cheating in secret sharing, Perfect secrecy|
|FoR Codes:||08 INFORMATION AND COMPUTING SCIENCES > 0806 Information Systems > 080609 Information Systems Management @ 0%|
01 MATHEMATICAL SCIENCES > 0101 Pure Mathematics > 010101 Algebra and Number Theory @ 0%
08 INFORMATION AND COMPUTING SCIENCES > 0806 Information Systems > 080610 Information Systems Organisation @ 0%
|Deposited On:||28 Sep 2006|
|Last Modified:||02 Nov 2012 08:43|
Last 12 Months: 0
Repository Staff Only: item control page