Skip to main content
SpringerLink
Log in

Verifiable (t, n) Threshold Secret Sharing Scheme Using ECC Based Signcryption

  • Conference paper
Information Systems, Technology and Management (ICISTM 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 54))

Abstract

In this paper, a secured (t, n) threshold secret sharing scheme has been proposed which prevents cheating from participants as well as from trusted dealer (TD) (which distributes shared secrets and reconstructs shared secret key). Here, a signcryption scheme based on elliptic curve cryptography (ECC) which incorporates both the digital signature and encryption scheme in a single logical step is used which helps to protect authenticity of the participants of the scheme and confidentiality of the secret shares being transferred through the network. The participants transfer their secret shares to the dealer when they require reconstruction of the secret key after acquiring confidence that the dealer is not compromised or captured. Before reconstruction of secret key (using t out of n secret shares), the dealer detects and identifies the dishonest participants (cheaters) assuming that more than t participants will submit their secret shares to the dealer. The dealer uses the concept of consistency and majority of secrets as proposed by Lein Harn et al.[17]. The proposed scheme helps to prevent cheating of dishonest participants, captured or compromised trusted dealer. It also reduces computational cost and communication overhead as the proposed scheme uses ECC based signcryption scheme.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  2. Blakley, G.: Safeguarding cryptographic keys. In: Proceedings of AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317 (1979)

    Google Scholar 

  3. Chaum, D.: Computer Systems Established, Maintained, and Trusted by Mutually Suspicious Groups. Tech. Rep., Memorandum No. UCB/ERL M/79/10, University of California, Berkeley, CA (February 1979)

    Google Scholar 

  4. Koblitz, N., Menezes, A., Vanstone, S.: The state of elliptic curve cryptography. Designs, Codes and Cryptography 19(2-3), 173–193 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Tompa, M., Woll, H.: How to Share a Secret with Cheaters. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 261–265. Springer, Heidelberg (1987)

    Google Scholar 

  6. Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

    Google Scholar 

  7. Araki, T.: Efficient (k, n) Threshold Secret Sharing Schemes Secure Against Cheating from n-1 Cheaters. LNCS, vol. 4586. Springer, Heidelberg (2007)

    Google Scholar 

  8. McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Comm. ACM 24, 583–584 (1981)

    Article  MathSciNet  Google Scholar 

  9. Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: Secret sharing schemes with veto capabilities. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S.N. (eds.) Algebraic Coding 1993. LNCS, vol. 781, pp. 82–89. Springer, Heidelberg (1994)

    Google Scholar 

  10. Lin, H.Y., Harn, L.: A generalized secret sharing scheme with cheater detection. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol. 739, pp. 149–158. Springer, Heidelberg (1993)

    Google Scholar 

  11. Pieprazyk, J., Li, C.H.: Multiparty key agreement protocols. Proceedings of Computers and Digital Techniques 147(4) (July 2000)

    Google Scholar 

  12. Tartary, C., Wang, H.: Dynamic threshold and cheater resistance for shamir secret sharing scheme. In: Lipmaa, H., Yung, M., Lin, D. (eds.) Inscrypt 2006. LNCS, vol. 4318, pp. 103–117. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Wei, C., Xiang, L.: A new Dynamic Threshold Secret Sharing Scheme from Bilinear Maps. In: International Conference on parallel Workshops, ICPPW 2007 (2007)

    Google Scholar 

  14. Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pp. 427–437. IEEE, Los Alamitos (1987)

    Google Scholar 

  15. Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)

    Google Scholar 

  16. Simmons, G.: An introduction to shared secret schemes and their applications. Sandia Reports, SAND 88-2298 (1988)

    Google Scholar 

  17. Harn, L., Lin, C.: Detecting and identification of cheaters in (t, n) secret sharing scheme. Designs, Codes and Cryptography 52, 15–24 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  18. Zheng, Y.: Digital signcryption or how to achieve cost (Signature & encryption) < < cost(Signature) + cost(Encryption). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 165–179. Springer, Heidelberg (1997)

    Google Scholar 

  19. Zheng, Y., Imai, H.: How to construct efficient signcryption schemes on elliptic curves. Information Processing Letters 68(5), 227–233 (1998)

    Article  MathSciNet  Google Scholar 

  20. Chaggen, P., Xiang, L.: Threshold Signcryption Scheme Based on Elliptic Curve Cryptosystem and Verifiable Secret Sharing. In: Proceedings of International conference on Wireless Communications, Networking and Mobile Computing, September 23-26, vol. 2 (2005)

    Google Scholar 

  21. Hu, C.-J., Zhang, Q.-F.: An Improved Authenticated (T,N) Threshold Signature Encryption Scheme Based on ECC. In: Proceedings of the Fifth International Conference on Machine Learning and Cybernetics, Dalian, 13-16, pp. 2674–2678 (2006)

    Google Scholar 

  22. Pedersen, T.P.: Distributed provers with applications to undeniable signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 221–242. Springer, Heidelberg (1991)

    Google Scholar 

  23. Lee, W.B., Chang, C.C.: Authenticated encryption scheme without using a one-way hash function. Electronic letters 31(19), 1656–1657 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India

    Atanu Basu & Indranil Sengupta

Authors
  1. Atanu Basu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Indranil Sengupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Georgia State University, 34 Peachtree Street, 30303, Atlanta, GA, USA

    Sushil K. Prasad

  2. Tata Research, Development and Design Center (TRDDC), Pune, India

    Harrick M. Vin

  3. CISE Department, CSE 301, University of Florida, FL 32611, Gainesville, USA

    Sartaj Sahni

  4. Management Development Institute (MDI), Mehrauli Road, Sukhrali, Gurgaon, India

    Mahadeo P. Jaiswal

  5. Dept. of Computer Engineering, King Mongkut’s University of Technology, Thonburi, 10140, Bangkok, Thailand

    Bundit Thipakorn

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Basu, A., Sengupta, I. (2010). Verifiable (t, n) Threshold Secret Sharing Scheme Using ECC Based Signcryption. In: Prasad, S.K., Vin, H.M., Sahni, S., Jaiswal, M.P., Thipakorn, B. (eds) Information Systems, Technology and Management. ICISTM 2010. Communications in Computer and Information Science, vol 54. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12035-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12035-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12034-3

  • Online ISBN: 978-3-642-12035-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation