Cryptology ePrint Archive: Report 2012/222

A secret sharing scheme of prime numbers based on hardness of factorization

Kai-Yuen Cheong

Abstract: Secret sharing schemes usually have perfect information theoretic security. This implies that each share must be as large as the secret. In this work we propose a scheme where the shares are smaller, while the security becomes computational. The computational security assumption is hardness of factorization, which is a simple and rather standard assumption in cryptography. In our scheme, the shared secret can only be a set of prime numbers.

Category / Keywords: foundations / secret sharing

Date: received 17 Apr 2012, last revised 20 Aug 2012

Contact author: kaiyuen at jaist ac jp

Available format(s): PDF | BibTeX Citation

Note: PDF version uploaded

Version: 20120821:041132 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]