Skip to main content
SpringerLink
Log in

A (k, n) Multi Secret Sharing Scheme Using Two Variable One Way Function with Less Public Values

  • Conference paper
  • First Online:
Book cover Information Systems Security (ICISS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9478))

Included in the following conference series:

Abstract

In this paper we have proposed a perfect (k, n) multi secret sharing scheme based on YCH scheme. The YCH method shares m secrets at a time and it publishes \((n+1)\) data (or \((n+m-k+1)\) data) as public values when \(m \le k\) (or \(m>k\)). Our method requires to publish no public values for \(m \le k\) and \((m-k)\) public values for \(m>k\). In the proposed method a special binary matrix is used to generate the secret shadows for the participants. The secret shadows are generated in such a way that the GCD of k or more such shadows generate r while less than k such generate r.d, where \(d>1\). We have also proved that the scheme is a secure one.

S. Kandar—Please note that the LNCS Editorial assumes that all authors have used the western naming convention, with given names preceding surnames. This determines the structure of the names in the running heads and the author index.

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

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Blakley, G.R.: Safeguarding cryptographic keys: Proc. Natl. Comput. Conf. 48, 313–317 (1979)

    Google Scholar 

  3. Chien, H.-Y., Jan, J.-K., Tseng, Y.-M.: A practical (t, n) multi-secret sharing scheme. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 83(12), 2762–2765 (2000)

    Google Scholar 

  4. Jackson, W.-A., Martin, K.M., O’Keefe, C.M.: On sharing many secrets. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol. 917. Springer, Heidelberg (1995)

    Google Scholar 

  5. He, J., Dawson, E.: Multistage secret sharing based on one-way function. Electron. Lett. 30(19), 1591–1592 (1994)

    Article  Google Scholar 

  6. He, J., Dawson, E.: Multisecret-sharing scheme based on one-way function. Electron. Lett. 31(2), 93–95 (1995)

    Article  Google Scholar 

  7. Yang, C.-C., Chang, T.-Y., Hwang, M.-S.: A (t, n) multi-secret sharing scheme. Appl. Math. Comput. 151(2), 483–490 (2004)

    MATH  MathSciNet  Google Scholar 

  8. Pang, L.-J., Wang, Y.-M.: A new (t, n) multi-secret sharing scheme based on shamir’s secret sharing. Appl. Math. Comput. 167(2), 840–848 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Tan, X., Wang, Z.: A new (t, n) multi-secret sharing scheme. In: ICCEE 2008 Computer and Electrical Engineering, pp. 861–865. IEEE (2008)

    Google Scholar 

  10. Lin, H.-Y., Yeh, Y.-S.: Dynamic multi-secret sharing scheme. Int. J. Contemp. Math. Sci. 3(1), 37–42 (2008)

    MATH  MathSciNet  Google Scholar 

  11. Das, A., Adhikari, A.: An efficient multi-use multi-secret sharing scheme based on hash function. Appl. Math. Lett. 23(9), 993–996 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  12. Bai, L.: A reliable (k, n) image secret sharing scheme. In: 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing, pp. 31–36. IEEE (2006)

    Google Scholar 

  13. Radu, V.: Application. In: Radu, V. (ed.) Stochastic Modeling of Thermal Fatigue Crack Growth. ACM, vol. 1, pp. 63–70. Springer, Heidelberg (2015)

    Google Scholar 

  14. Herranz, J., Ruiz, A., Sez, G.: New results and applications for multi-secret sharing schemes. Des. Codes Crypt. 73(3), 841–864 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  15. Hsu, C.-F., Cheng, Q., Tang, X., Zeng, B.: An ideal multi-secret sharing scheme based on MSP. Inf. Sci. 181(7), 1403–1409 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  16. Subha, R., Bhagvati, C.: CRT based threshold multi secret sharing scheme. Int. J. Netw. Secur. 16(4), 249–255 (2014)

    Google Scholar 

  17. Dong, X.: A multi-secret sharing scheme based on the CRT and RSA. Int. J. Netw. Secur. 2(2), 69–72 (2015)

    Google Scholar 

  18. Endurthi, A., Bidyapati Chanu, O., Naidu Tentu, A., Venkaiah, V.C.: Reusable multi-stage multi-secret sharing schemes based on CRT. J. Commun. Softw. Syst. 11(1), 15–24 (2015)

    Article  Google Scholar 

  19. Dastanian, R., Shahhoseini, H.S.: Multi secret sharing scheme for encrypting two secret images into two shares. In: International Conference on Information and Electronics Engineering IPCSIT, vol. 6. IEEE, Washington (2011)

    Google Scholar 

  20. Chen, T.-H., Chang-Sian, W.: Efficient multi-secret image sharing based on boolean operations. Sig. Process. 91(1), 90–97 (2011)

    Article  MATH  Google Scholar 

  21. Tentu, A.N., Rao, A.A.: Efficient verifiable multi-secret sharing based on YCH scheme. In: Cryptography and Security Systems, pp. 100–109. Springer, Heidelberg (2014)

    Google Scholar 

  22. Hu, C., Liao, X., Cheng, X.: Verifiable multi-secret sharing based on LFSR sequences. Theoret. Comput. Sci. 445, 52–62 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  23. Mashhadi, S., Dehkordi, M.H.: Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem. Inf. Sci. 294, 31–40 (2015)

    Article  MATH  MathSciNet  Google Scholar 

  24. Eslami, Z., Ahmadabadi, J.Z.: A verifiable multi-secret sharing scheme based on cellular automata. Inf. Sci. 180(15), 2889–2894 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  25. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. Adv. Cryptology, pp. 10–18. Springer, Heidelberg (1985)

    Google Scholar 

  26. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, Indian Institute of Engineering Science and Technology, Shibpur, 711103, West Bengal, India

    Shyamalendu Kandar

  2. Department of Information Technology, Jadavpur Univesity, Salt Lake Campus, Kolkata, 700098, West Bengal, India

    Bibhas Chandra Dhara

Authors
  1. Shyamalendu Kandar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bibhas Chandra Dhara
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shyamalendu Kandar .

Editor information

Editors and Affiliations

  1. Center for Secure Information Systems, Fairfax, Virginia, USA

    Sushil Jajoda

  2. Jadavpur University, Kolkata, India

    Chandan Mazumdar

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kandar, S., Dhara, B.C. (2015). A (k, n) Multi Secret Sharing Scheme Using Two Variable One Way Function with Less Public Values. In: Jajoda, S., Mazumdar, C. (eds) Information Systems Security. ICISS 2015. Lecture Notes in Computer Science(), vol 9478. Springer, Cham. https://doi.org/10.1007/978-3-319-26961-0_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26961-0_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26960-3

  • Online ISBN: 978-3-319-26961-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation