Skip to main content
SpringerLink
Log in

Generalized Secret Sharing Scheme Based on MDS Codes

  • Conference paper
  • First Online:
ICICCT 2019 – System Reliability, Quality Control, Safety, Maintenance and Management (ICICCT 2019)

Abstract

Secret sharing scheme (SSS) is a well known method with applications in threshold cryptography, e-voting, e-bidding, sensor networks, cloud computing etc. A secret is shared among a set of shareholders or participants by a trusted dealer. Any authorized subset of participants can determine the secret. The set of all such subsets of participants is known as Access Structure. In a generalized access structure, any subset of participants can be an authorized subset. A novel ideal SSS based on MDS codes which realizes a strict generalized access structure is proposed. The proposed scheme has an advantage that the participants can choose their own shares and the trusted dealer can verify whether the shares are valid or not. A set of one-way functions are needed in this scheme. The one-way functions are based on hardness assumption of DLP which is an intractable problem. The proposed scheme is computationally perfect 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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  3. Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. SIAM 8(2), 300–304 (1960)

    MathSciNet  MATH  Google Scholar 

  4. McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Commun. Assoc. Comput. Mach. 24, 583–584 (1981)

    MathSciNet  Google Scholar 

  5. Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Trans. Inf. Theory IT–29(1), 35–41 (1983)

    Article  MathSciNet  Google Scholar 

  6. Singleton, R.C.: Maximum distance q-nary codes. IEEE Trans. Inform. Theory IT–IO, 116–118 (1964)

    Article  MathSciNet  Google Scholar 

  7. McEliece, R.J.: The Theory of Information and Coding. Addison-Wesley, Reading (1977)

    MATH  Google Scholar 

  8. Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. Electron. Commun. Jpn. (Part III: Fundam. Electron. Sci.) 72(9), 56–64 (1989)

    Article  MathSciNet  Google Scholar 

  9. Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology - CRYPTO 1988, Santa Barbara, California, USA, 21–25 August 1988, pp. 27–35 (1988)

    Google Scholar 

  10. Brickell, E.F.: Some ideal secret sharing schemes. J. Comb. Math. Comb. Comput. 9, 105–113 (1989)

    MathSciNet  MATH  Google Scholar 

  11. Stinson, D.R.: An explication of secret sharing schemes. Des. Codes Crypt. 2, 357–390 (1992)

    Article  MathSciNet  Google Scholar 

  12. Saha, T.: A generalized ideal secret sharing scheme. IACR Cryptology ePrint Archive 2016:929 (2016)

    Google Scholar 

  13. Beimel, A.: Secret-sharing schemes: a survey. In: Chee, Y., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) Coding and Cryptology. Lecture Notes in Computer Science, vol. 6639, pp. 11–46. Springer, Heidelberg (2011)

    Google Scholar 

  14. Pattipati, D., Tentu, A., Venkaiah, V.: Ideal and computationally perfect secret sharing schemes for generalized access structures. In: Mauri, J., Thampi, S., Rawat, D., Jin, D. (eds.) Security in Computing and Communications. Communications in Computer and Information Science, vol. 467, pp. 149–161. Springer, Heidelberg (2014)

    Google Scholar 

  15. Vinod, V., Narayanan, A., Srinathan, K., Pandu Rangan, C., Kim, K.: On the power of computational secret sharing. In: Johansson, T., Maitra, S. (eds.) Indocrypt 2003. Lecture Notes in Computer Science, vol. 2904, pp. 162–176. Springer (2003)

    Google Scholar 

  16. Cachin. C: On-line secret sharing. In IMA: IMA Conference on Cryptography and Coding, LNCS lately (earlier: Cryptography and Coding II, Claredon Press, 1992) (1995)

    Google Scholar 

  17. Naidu, T.A., Paul, P., Venkaiah, V.Ch.: Ideal and perfect hierarchical secret sharing schemes based on MDS codes. In: Proceeding of International Conference on Applied and Computational Mathematics, Ankara, Turkey, pp. 256–272 (2012)

    Google Scholar 

  18. Naidu, A., Paul, T.P., Venkaiah, V.Ch.: Computationally perfect secret sharing schemes based on MDS codes. Int. J. Trust Manage. Comput. Commun. (IJTMCC) 2(4), 353–378 (2014)

    Article  Google Scholar 

  19. Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Inf. Theory 29(2), 208–210 (1983)

    Article  MathSciNet  Google Scholar 

  20. Liu, J., Mesnager, S., Chen, L.: Secret sharing schemes with general access structures. In: International Conference on Information Security and Cryptology, pp. 341–360 (2016)

    Chapter  Google Scholar 

Download references

Acknowledgements

I would like to thank Digital India Corporation and Ministry of Electronics and Information Technology(MeitY), Govt of India for supporting this work under Visvesvaraya Ph.D. Scheme for Electronics and IT.

Author information

Authors and Affiliations

  1. University of Hyderabad, Hyderabad, India

    Shivakrishna Nallabothu, N. Rukmarekha & Y. V. Subbarao

Authors
  1. Shivakrishna Nallabothu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Rukmarekha
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Y. V. Subbarao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shivakrishna Nallabothu .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, CMR Institute of Technology, Hyderabad, Telangana, India

    Vinit Kumar Gunjan

  2. Department of Computer Science, University of Oviedo, Oviedo, Spain

    Vicente Garcia Diaz

  3. Faculty of Engineering, Don Bosco University, San Salvador, El Salvador

    Manuel Cardona

  4. Department of Computer Science and Engineering, CMR Institute of Technology (Autonomous), Hyderabad, Telangana, India

    Vijender Kumar Solanki

  5. BVRIT Hyderabad College of Engineering for Women, Hyderabad, Telangana, India

    K. V. N. Sunitha

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nallabothu, S., Rukmarekha, N., Subbarao, Y.V. (2020). Generalized Secret Sharing Scheme Based on MDS Codes. In: Gunjan, V., Garcia Diaz, V., Cardona, M., Solanki, V., Sunitha, K. (eds) ICICCT 2019 – System Reliability, Quality Control, Safety, Maintenance and Management. ICICCT 2019. Springer, Singapore. https://doi.org/10.1007/978-981-13-8461-5_41

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-8461-5_41

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-8460-8

  • Online ISBN: 978-981-13-8461-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation