Paper 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.

Note: PDF version uploaded

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
secret sharing
Contact author(s)
kaiyuen @ jaist ac jp
History
2012-08-21: revised
2012-04-30: received
See all versions
Short URL
https://ia.cr/2012/222
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2012/222}},
      url = {https://eprint.iacr.org/2012/222}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.