General Secret Sharing Based on the Chinese Remainder Theorem

Sorin Iftene

Paper 2006/166

General Secret Sharing Based on the Chinese Remainder Theorem

Sorin Iftene

Abstract

In this paper we extend the threshold secret sharing schemes based on the Chinese remainder theorem in order to deal with more general access structures. Aspects like verifiability, secret sharing homomorphisms and multiplicative properties are also discussed.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. An improved version of this paper has appeared in Proceedings of the First Workshop in Information and Computer Security (ICS 2006), Electronic Notes in Theoretical Computer Science, Volume 186 (14 July 2007), Pages 67-84
Contact author(s): siftene @ infoiasi ro
History: 2007-07-17: last of 2 revisions; 2006-05-16: received; See all versions
Short URL: https://ia.cr/2006/166
License: CC BY

BibTeX

@misc{cryptoeprint:2006/166,
      author = {Sorin Iftene},
      title = {General Secret Sharing Based on the Chinese Remainder Theorem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/166},
      year = {2006},
      url = {https://eprint.iacr.org/2006/166}
}