Welcome to the resource topic for 2012/222
Title:
A secret sharing scheme of prime numbers based on hardness of factorization
Authors: 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.
ePrint: https://eprint.iacr.org/2012/222
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .