Nothing Special   »   [go: up one dir, main page]

Skip to main content

Abstract

The security of a key often determines the security of a communication system, so a secure and effective key distribution management method can effectively ensure the security of the communication system. The key distribution method based on a trusted key distribution center is prone to the collapse of the cryptographic system due to a single point of failure. Therefore, a distributed and decentralized key distribution method has become a requirement. And threshold key sharing technology is able to effectively and securely complete decentralized key distribution work, becoming an effective solution for key sharing. This article proposes a distributed, verifiable, and easy to update key sharing scheme based on Shamir’s threshold key sharing technology and homomorphic encryption technology. In this scheme, through threshold secret sharing technology, internal nodes in the system can collaborate and generate common keys in a distributed manner. The use of homomorphic encryption technology can effectively solve the problem of key update. When reconstructing the key, the sub-secret values are not disclosed, so there is no need to modify the secret values by redistributing the sub-secret values twice to update the key, thereby improving the efficiency of key update.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613

    Article  MathSciNet  Google Scholar 

  2. Blakley GR (1979) Safeguarding cryptographic keys. In: Proceedings of AFIPS 1979 national computer conference, vol 48. pp 313–317

    Google Scholar 

  3. Desmedt Y (1987) Society and group oriented cryptography: a new concept//conference on the theory and application of cryptographic techniques. Berlin, Heidelberg, Springer, pp 120–127

    Google Scholar 

  4. Desmedt YG (1994) Threshold cryptography. Eur Trans Telecommun 5(4):449–458

    Article  Google Scholar 

  5. Asmuth C, Bloom J (1983) A modular approach to key safe-guarding. IEEE Trans Inf Theory 29:208–210

    Article  Google Scholar 

  6. Karmin ED, Green JW, Hellman ME (1983) On sharing secret systems. IEEE Trans Inf Theory 29(1):35–41

    Article  Google Scholar 

  7. Chor B, Goldwasser S, Micali S, et al. (1985) Verifiable secret sharing and achieving simulataneity in the presence of faults. In: IEEE Annual symposium on foundations of computer science, vol 54, pp 383–395

    Google Scholar 

  8. Laih CS, Harn L, Lee JY, et al. (1990) Dynamic threshold scheme based on the definition of cross-product in an-dimensional linear space. In: Advances in cryptology-CRYTO’89 proceedings, Springer, New York, pp 286–298

    Google Scholar 

  9. Keju M, Fuyou M, Yue Y (2019) A secure and efficient on-line/off-line group key distribution protocol. Designs, Codes and Cryptography 87(7):1601–1620

    Google Scholar 

  10. Soumya B, Alin T, Ittai A, Dahlia M, Michael KR, Emin GS (2019) Efficient Verifiable secret sharing with share recovery in BFT protocols. In: Proceedings of the 2019 ACM SIGSAC conference on computer and communications security (CCS ‘19). Association for Computing Machinery, New York, NY, USA, 2387–2402

    Google Scholar 

  11. Yuan J, Li L (2019) A fully dynamic secret sharing scheme. Inf Sci 496:42–52

    Article  MathSciNet  Google Scholar 

  12. Meng K, Miao F, Huang W et al (2019) Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem. Discret Appl Math 268:152–163

    Article  MathSciNet  Google Scholar 

  13. Jia X, Wang D, Nie D et al (2019) A new threshold changeable secret sharing scheme based on the Chinese remainder theorem. Inf Sci 473:13–30

    Article  MathSciNet  Google Scholar 

  14. Hadian Dehkordi M, Oraei H (2019) How to construct a verifiable multi-secret sharing scheme based on graded encoding schemes. IET Inf Secur 13(4):343–351

    Article  Google Scholar 

  15. Chen D, Lu W, Xing W et al (2019) An efficient verifiable threshold multi-secret sharing scheme with different stages. IEEE Access 7:107104–107110

    Article  Google Scholar 

  16. Rivest RL, Adleman L, Dertouzos ML (1978) On data banks and privacy homomorphisms. Found Secure Comput 4(11):169–180

    MathSciNet  Google Scholar 

Download references

Acknowledgements

This work is supported in part by the Haikou Science and Technology Special Fund (No.2022-040) and the Science Project of Hainan University (KYQD(ZR)20021).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jun Ye .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhao, C., Chen, J., Ye, J. (2024). Verifiable Secret Key Sharing Scheme Based on Threshold Cryptosystem. In: Jansen, B.J., Zhou, Q., Ye, J. (eds) Proceedings of the 3rd International Conference on Cognitive Based Information Processing and Applications—Volume 3. CIPA 2023. Lecture Notes on Data Engineering and Communications Technologies, vol 198. Springer, Singapore. https://doi.org/10.1007/978-981-97-1983-9_51

Download citation

Publish with us

Policies and ethics