Paper 2009/426

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

Daniel Pasaila, 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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
secret sharingcheating detectioncheater identification
Contact author(s)
siftene @ info uaic ro
History
2009-09-04: received
Short URL
https://ia.cr/2009/426
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/426,
      author = {Daniel Pasaila and Vlad Alexa and Sorin Iftene},
      title = {Cheating Detection and Cheater Identification in CRT-based Secret Sharing Schemes},
      howpublished = {Cryptology ePrint Archive, Paper 2009/426},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/426}},
      url = {https://eprint.iacr.org/2009/426}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.