Skip to main content
SpringerLink
Log in
Book cover

Australasian Conference on Information Security and Privacy

ACISP 1998: Information Security and Privacy pp 391–402Cite as

A comment on the efficiency of secret sharing scheme over any finite abelian group

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1438))

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.

Unable to display preview. Download preview PDF.

References

  1. G.R. Blakley. “Safeguarding cryptographic keys”. In Proc. of the AFIPS 1979 National Computer Conference, vol.48, pages 313–317, 1979.

    Google Scholar 

  2. A. Shamir. “How to Share a Secret”. In Communications of the ACM, vol.22, no.11, pages 612–613, 1979.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EE & CS, and the Center of Cryptography, Computer and Network Security, University of Wisconsin, PO Box 784, 53201, Milwaukee, WI, USA

    Yvo Desmedt

  2. Dept. of Mathematics, Royal Holloway, University of London, UK

    Yvo Desmedt

  3. Dept. of Elec. Eng. & Comp. Science, University of Wisconsin, PO Box 784, 53201, Milwaukee, WI, USA

    Brian King

  4. Dept. of Information & Communication Eng., Faculty of Eng., Tamagawa University, 6-1-1 Tamagawa-gakuen, Machida-shi, 194-8610, Tokyo, Japan

    Wataru Kishimoto

  5. Dept. of Electrical and Electronic Eng., Faculty of Eng., Tokyo Institute of Technology, 2-12-1, O-okayama, Meguro-ku, 152-8552, Tokyo, Japan

    Kaoru Kurosawa

Authors
  1. Yvo Desmedt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Brian King
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wataru Kishimoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kaoru Kurosawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Colin Boyd Ed Dawson

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation