Skip to main content

A (tn) Multi-secret Sharing Scheme with Updated Secret Shadows

  • 821 Accesses

Part of the Lecture Notes in Networks and Systems book series (LNNS,volume 24)

Abstract

In multi-secret sharing, a number of secrets are shared among a group of participants in a single-secret sharing process. Each participant gets only one share from the sharing process and secrecy of one secret does not depend on the reconstruction of any other secrets. YCH method is a well-known multi-secret sharing scheme proposed by Yang, Chang, and Hwang. This scheme has used two-variable one-way function. Among these two variables, one is made public and another is a randomly distributed secret shadow for each participant. In the current work, YCH method is extended where the “public variable” is shared and each participant gets one of them. The shadows are updated periodically to prevent any adversary from collecting all the secret shadows within a stipulated time period.

Keywords

  • Multi-secret sharing
  • Secret shadow
  • One-way function
  • Updated secret shadow

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-981-10-6890-4_60
  • Chapter length: 9 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   329.00
Price excludes VAT (USA)
  • ISBN: 978-981-10-6890-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   419.00
Price excludes VAT (USA)

References

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

    Google Scholar 

  2. Blakley, George Robert.: Safeguarding cryptographic keys. Proceedings of the national computer conference. Vol. 48, pp. 313–317 (1979)

    Google Scholar 

  3. Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE transactions on information theory, 30(2), 208–210 (1983)

    Google Scholar 

  4. He, Jingmin, and Edward Dawson.: Multistage secret sharing based on one-way function. Electronics Letters 30.19, 1591–1592 (1994)

    Google Scholar 

  5. Chien, Hung-Yu, J. A. N. Jinn-Ke, and Yuh-Min Tseng.: A practical (t, n) multi-secret sharing scheme. IEICE transactions on fundamentals of electronics, communications and computer sciences 83.12, 2762–2765 (2000)

    Google Scholar 

  6. Yang, Chou-Chen, Ting-Yi Chang, Min-Shiang Hwang: A (t, n) multi-secret sharing scheme. Applied Mathematics and Computation 151.2, 483–490. (2004)

    Google Scholar 

  7. Kandar, Shyamalendu, Bibhas Chandra Dhara: A (k, n) Multi Secret Sharing Scheme Using Two Variable One Way Function with Less Public Values. International Conference on Information Systems Security. Springer International Publishing, 532–541. (2015)

    Google Scholar 

  8. Mashhadi, Samaneh, Massoud Hadian Dehkordi.: Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem. Information Sciences 294, 31–40 (2015)

    Google Scholar 

  9. Lin, Han-Yu, Yi-Shiung Yeh.: Dynamic multi-secret sharing scheme. Int. J. Contemp. Math. Sciences 3.1, 37–42. (2008)

    Google Scholar 

  10. Song, Yun, Zhihui Li, Yongming Li, Jing Li.: A new multi-use multi-secret sharing scheme based on the duals of minimal linear codes., Security and Communication Networks 8, no. 2, 202–211, (2015)

    Google Scholar 

  11. Tentu, Appala Naidu, V. Kamakshi Prasad, V. Ch Venkaiah.: Multi-Stage Secret Sharing Schemes Based on Asmuths Bloom Sequence, Networking and Communication Engineering 8, no. 3, 75–79, (2016)

    Google Scholar 

  12. Rao Subha, Bhagvati, C.: CRT based threshold multi secret sharing scheme. International Journal of Network Security 16.4, 249–255 (2014)

    Google Scholar 

  13. Endurthi, A., Bidyapati Chanu, O., Naidu Tentu, A., Venkaiah, V. C.: Reusable Multi-Stage Multi-Secret Sharing Schemes Based on CRT. Journal of Communications Software and Systems, 11.1 (2015)

    Google Scholar 

  14. Dong, Xuedong.: A Multi-secret Sharing Scheme Based on the CRT and RSA. International Journal of Network Security 2.2, 69–72 (2015)

    Google Scholar 

  15. Thien, C. C., Lin, J. C.: Secret image sharing. Computers and Graphics, 26(5), 765–770, (2002)

    Google Scholar 

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

    Google Scholar 

  17. Das, S. K., Dhara, B. C.: An Image Secret Sharing Technique with Block Based Image Coding. Communication Systems and Network Technologies (CSNT), 2015 Fifth International Conference, IEEE, 648–652, (2015)

    Google Scholar 

  18. Zarepour-Ahmadabadi, Jamal, MohammadEbrahim Shiri Ahmadabadi, AliMohammad Latif.: An adaptive secret image sharing with a new bitwise steganographic property., Information Sciences 369, 467–480, (2016)

    Google Scholar 

  19. Rajput, Mohit, Maroti Deshmukh.: Secure (n, n+ 1) Multi Secret Image Sharing Scheme Using Additive Modulo, Procedia Computer Science 89 677–683, (2016)

    Google Scholar 

  20. Deshmukh, M., Nain, N., Ahmed, M.: An (n, n) Multi Secret Image Sharing Scheme Using Boolean XOR and Modular Arithmetic, 30th International Conference on Advanced Information Networking and Applications(AINA), IEEE, 690–697, (2016)

    Google Scholar 

  21. Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. Proceedings of the tenth annual ACM symposium on Principles of distributed computing, ACM, 51–59, (1991)

    Google Scholar 

  22. Herzberg, Amir, Stanislaw Jarecki, Hugo Krawczyk, Moti Yung.: Proactive secret sharing or: How to cope with perpetual leakage. In Annual International Cryptology Conference, Springer Berlin Heidelberg, 339–352, (1995)

    Google Scholar 

  23. Feldman, Paul.: A practical scheme for non-interactive verifiable secret sharing, Foundations of Computer Science, 1987, 28th Annual Symposium on, IEEE, 427–438, (1987)

    Google Scholar 

  24. Pedersen, Torben Pryds.: Non-interactive and information-theoretic secure verifiable secret sharing. Annual International Cryptology Conference, Springer Berlin Heidelberg, 129–140, (1991)

    Google Scholar 

  25. Gan, Yuanju, Lihua Wang, Licheng Wang, Ping Pan, Yixian Yang.: Publicly Verifiable Secret Sharing Scheme with Provable Security against Chosen Secret Attacks, International Journal of Distributed Sensor Networks (2013)

    Google Scholar 

  26. Harn, Lein, Miao Fuyou, Chin-Chen Chang.: Verifiable secret sharing based on the Chinese remainder theorem., Security and Communication Networks 7, no. 6, 950–957, (2014)

    Google Scholar 

  27. Rivest, Ronald L., Adi Shamir, Len Adleman.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21.2, 120–126, (1978)

    Google Scholar 

  28. ElGamal, Taher: A public key cryptosystem and a signature scheme based on discrete logarithms. Advances in cryptology. 10–18 Springer Berlin Heidelberg, (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shyamalendu Kandar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Kandar, S., Dhara, B.C. (2018). A (tn) Multi-secret Sharing Scheme with Updated Secret Shadows. In: Mandal, J., Saha, G., Kandar, D., Maji, A. (eds) Proceedings of the International Conference on Computing and Communication Systems. Lecture Notes in Networks and Systems, vol 24. Springer, Singapore. https://doi.org/10.1007/978-981-10-6890-4_60

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6890-4_60

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6889-8

  • Online ISBN: 978-981-10-6890-4

  • eBook Packages: EngineeringEngineering (R0)