Paper 2012/222 Original: eprint.iacr.org/2012/222 ↗
A secret sharing scheme of prime numbers based on hardness of factorization
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2012-08-21: last updated
- 2012-04-30: published
- Short URL
- https://ia.cr/2012/222
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2012/222,
author = {Kai-Yuen Cheong},
title = {A secret sharing scheme of prime numbers based on hardness of factorization},
howpublished = {Cryptology {ePrint} Archive, Paper 2012/222},
year = {2012},
url = {https://eprint.iacr.org/2012/222}
}