Cryptology ePrint Archive: Report 2009/426

Cheating Detection and Cheater Identification in CRT-based Secret Sharing Schemes

Daniel Pasaila and Vlad Alexa and Sorin Iftene

Abstract: 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.

Category / Keywords: cryptographic protocols / secret sharing, cheating detection, cheater identification

Date: received 1 Sep 2009

Contact author: siftene at info uaic ro

Available format(s): PDF | BibTeX Citation

Version: 20090904:053907 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]