Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational and Information Science

CIS 2005: Computational Intelligence and Security pp 532–537Cite as

A Secure and Efficient (t, n) Threshold Verifiable Multi-secret Sharing Scheme

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3802))

Abstract

Ting-Yi Chang et al.(2005) have proposed an efficient (t, n) threshold verifiable multi-secret sharing (VMSS) scheme, which is more secure than the one adopted in Lin and Wu (1999) and it can provide more efficient performance than the other VMSS schemes in terms of computational complexity. However, this paper will show that Chang et al.’s scheme is in fact insecure by presenting a conspiracy attack on it. Furthermore, a more secure scheme is proposed.

Supported by the National Natural Science Foundation of China under Grant No.10271069; the Natural Science Research Program of Shaanxi Province of China under Grant No.2004A14; Postgraduates initiative funds of Shaanxi Normal University.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Harn, L.: Efficient sharing (broadcasting) of multiple secret. IEE Proc. Comput. Digit. Tech. 142(3), 237–240 (1995)

    Article  Google Scholar 

  2. Chen, L., Gollmann, D., Mitchell, C.J., Wild, P.: Secret sharing with reusable polynomials. In: Proceedings of ACISP’s 1997, pp. 183–193 (1997)

    Google Scholar 

  3. Lin, T.Y., Wu, T.C. (t, n) threshold verifiable multi-secret sharing scheme based on factorization intractability and discrete logarithm modulo a composite problems. IEE Proc. Comput. Digit. Tech. 146(5), 264–268 (1999)

    Article  Google Scholar 

  4. Chang, T.-Y., Hwang, M.-S., Yang, W.-P.: An improvement on the Lin-Wu (t, n) threshold verifiable multi-secret sharing scheme. Applied Mathematics and Computation 163, 169–178 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Li, C.-M., Hwang, T., Lee, N.-Y.: Remark on the Threshold RSA Signature Scheme. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 413–419. Springer, Heidelberg (1994)

    Google Scholar 

  6. Adleman, L., McCurley, K.: Open Problems in Number Theoretic Complexity. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 291–322. Springer, Heidelberg (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Mathematics and Information, Shaanxi Normal University, Xi’an, 710061, China

    Mei-juan Huang & Jian-zhong Zhang

  2. Department of Applied Mathematics and Physics, Xi’an Institute of Post and Telecommunication, Xi’an, 710061, China

    Shu-cui Xie

Authors
  1. Mei-juan Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian-zhong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shu-cui Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronic Instiute, Xidian University, 710071, Xi’an, China

    Yue Hao

  2. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jiming Liu

  3. School of Computer Science and Technology, Xidian University, Xi’an, China

    Yu-Ping Wang

  4. Department of Computer Science, Hong Kong Baptist University, Hong Kong,  

    Yiu-ming Cheung

  5. School of Electrical and Electronic Engineering, University of Manchester, UK

    Hujun Yin

  6. Life Science Research Center, School of Electronic Engineering, Xidian University, 710071, Xi’an, Shaanxi, China

    Licheng Jiao

  7. Key Laboratory of Computer Networks and Information Security(Ministry of Education), Xidian University, 710071, Xi’an, China

    Jianfeng Ma

  8. National Laboratory of Antennas and Microwave Technology, Xidian University, 710071, Xi’an, Shanxi, P.R. China

    Yong-Chang Jiao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, Mj., Zhang, Jz., Xie, Sc. (2005). A Secure and Efficient (t, n) Threshold Verifiable Multi-secret Sharing Scheme. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596981_78

Download citation

  • DOI: https://doi.org/10.1007/11596981_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30819-5

  • Online ISBN: 978-3-540-31598-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation