Threshold Cryptography Based on Asmuth-Bloom Secret Sharing
In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present two novel function sharing schemes, one for the RSA signature and the other for the ElGamal decryption functions, based on the Asmuth-Bloom scheme. To the best of our knowledge, these are the first threshold cryptosystems realized using the Asmuth-Bloom secret sharing. The proposed schemes compare favorably to the earlier function sharing schemes in performance as well as in certain theoretical aspects.
KeywordsSecret Sharing Sharing Scheme Secret Sharing Scheme Chinese Remainder Theorem Function Sharing
Unable to display preview. Download preview PDF.
- 2.Blakley, G.: Safeguarding cryptographic keys. In: Proc. of AFIPS National Computer Conference (1979)Google Scholar
- 4.Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1990)Google Scholar
- 7.De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely? In: Proc. of STOC 1994, pp. 522–533 (1994)Google Scholar