Abstract
In this paper, we show an efficient (k,n) threshold secret sharing scheme over any finite Abelian group such that the size of share is q/2 (where q is a prime satisfying n ≤ q < 2n), which is a half of that of Desmedt and Frankel's scheme. Consequently, we can obtain a threshold RSA signature scheme in which the size of shares of each signer is only a half.
A part of this research has been supported by NSF Grant NCR-9508528.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G.R. Blakley. “Safeguarding cryptographic keys”. In Proc. of the AFIPS 1979 National Computer Conference, vol.48, pages 313–317, 1979.
A. Shamir. “How to Share a Secret”. In Communications of the ACM, vol.22, no.11, pages 612–613, 1979.
Y. Desmedt and Y Prankel. “Threshold Cryptosystem”. In Proc. of Crypto'89, Lecture Notes in Computer Science, LNCS 435, Springer Verlag, pages 307–315, 1990.
Y. Desmedt and Y. Frankel. “Homomorphi zero-knowledge threshold schemes over any finite Abelian group”. In SIAM J. on Discrete Math., vol.7, no.4, pages 667–679, 1994.
A. De Santis, Y. Desmedt, Y. Prankel, and M. Yung. “How to share a funciton securely”. In Proc. of STOC'94, pages 522–533, 1994.
Y. Desmedt, G. Di Crescenzo, and M. Burmester. “Multiplicative non-abelian sharing schemes and their application to threshold cryptography”. In Proc. of Asiacrypt'94, Lecture Notes in Computer Science, LNCS 917, Springer Verlag, pages 21–32, 1995.
S. Blackburn, M. Burmester, Y. Desmedt, and P. Wild. “Efficient multiplicative sharing scheme”. In Proc. of Eurocrypt'96, Lecture Notes in Computer Science, LNCS 1070, Springer Verlag, pages 107–118, 1996.
A. Luetbecher, and G. Niklasch. “On cliques of exceptional units and Lenstra's construction of Euclidean Fields”. In Number Theory, Ulm 1987 Lecture Notes in Mathematics 1380, Springer-Verlag pages 150–178, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Desmedt, Y., King, B., Kishimoto, W., Kurosawa, K. (1998). A comment on the efficiency of secret sharing scheme over any finite abelian group. In: Boyd, C., Dawson, E. (eds) Information Security and Privacy. ACISP 1998. Lecture Notes in Computer Science, vol 1438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053750
Download citation
DOI: https://doi.org/10.1007/BFb0053750
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64732-4
Online ISBN: 978-3-540-69101-3
eBook Packages: Springer Book Archive