Open AccessCHEATING DETECTION AND CHEATER IDENTIFICATION IN CRT-BASED SECRET SHARING SCHEMES
Author(s) -
Daniel Pasailă,
Vlad Alexa,
Sorin Iftene
Publication year - 2010
Publication title -
computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 11
eISSN - 2312-5381
pISSN - 1727-6209
DOI - 10.47839/ijc.9.2.702
Subject(s) - cheating , secret sharing , chinese remainder theorem , computer science , identification (biology) , scheme (mathematics) , theoretical computer science , verifiable secret sharing , computer security , mathematics , algorithm , cryptography , psychology , social psychology , programming language , mathematical analysis , botany , biology , set (abstract data type)
In this paper we analyze the cheating detection and cheater identification problems for the secret sharing schemes based on the Chinese remainder theorem (CRT), more exactly for Mignotte [1] and Asmuth-Bloom [2] schemes. We prove that the majority of the solutions for Shamir’s scheme [3] can be translated to these schemes and, moreover, there are some interesting specific solutions.