Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols /

Publication Info: 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

Date: received 12 May 2006, last revised 17 Jul 2007

Contact author: siftene at infoiasi ro

Available format(s): PDF | BibTeX Citation

Version: 20070717:072901 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]