Skip to main content
SpringerLink
Log in

Computationally Secure Robust Multi-secret Sharing for General Access Structure

  • Conference paper
  • First Online:
Mathematics and Computing

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 139))

Abstract

Secret sharing scheme plays a crucial role in distributed cryptosystems. Due to its extensive use in numerous applications, an important goal in this area is to minimize trust among the participants. To remove this bottleneck, robust secret sharing, which allows the correct secret to be recovered even when some of the shares presented during an attempted reconstruction are incorrect, can be an efficient tool. However, as unconditional security demands honest majority and share size to be at least equal to the size of the secret, the need for computational security of such schemes has been felt over the years, specially in case of multi-secret sharing schemes. In this paper, we provide a notion of computationally robust multi-secret sharing scheme for general access structure. We also propose a robust multi-secret sharing scheme for general access structure and prove its computational security under the proposed notation.

Research supported in part by National Board for Higher Mathematics, Department of Atomic Energy, Government of India (No 2/48(10)/2013/NBHM(R.P.)/R&D II/695).

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
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 172–184 (2007)

    Google Scholar 

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

    Google Scholar 

  3. Chang, T.Y., Hwang, M.S., Yang, W.P.: An improvement on the Lin-Wu (t, n) threshold verifiable multi-secret sharing scheme. Appl. Math. Comput. 163, 169–178 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. Damgard, I., Jakobsen, T.P., Nielsen, J.B., Pagter, J.I.: Secure key management in the cloud. In: Cryptography and Coding, pp. 270–289. Springer, Heidelberg (2013)

    Google Scholar 

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

    Google Scholar 

  6. Dehkordi, M.H., Mashhadi, S.: An efficient threshold verifiable multi-secret sharing. Comp. Stand. Inter. 30, 187–190 (2008)

    Google Scholar 

  7. Geng, Y.J., Fan, X.H., Hong, F.: A new multi-secret sharing scheme with multi-policy. In: The 9th International Conference on Advanced Communication Technology, Vol. 3, pp. 1515–1517 (2007)

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. Herranz, J., Ruiz, A., Saez, G.: New results and applications for multi-secret sharing schemes. In: Design, Codes and Cryptography, pp. 1–24, Springer, Heidelberg (2013)

    Google Scholar 

  11. Herranz, J., Ruiz, A., Saez, G.: Sharing many secrets with computational provable security. Inf. Process. Lett. 113, 572–579 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  12. Krawczyk, H.: Distributed ngerprints and secure information dispersal. In: 12th Annual ACM Symposium on Principles of Distributed Computing (PODC 1993), ACM Press, Austria, pp. 207–218 (1993)

    Google Scholar 

  13. Martin, K.M.: Challenging the adversary model in secret sharing schemes. In: Coding and Cryptography II, Proceedings of the Royal Flemish Academy of Belgium for Science and the Arts, pp. 45–63 (2008)

    Google Scholar 

  14. McEliece, R., Sarwate, D.: On sharing secrets and reed-solomon codes. Commun. ACM 24(9), 583–584 (1981)

    Article  MathSciNet  Google Scholar 

  15. Pang, L.J., Li, H., Wang, Y.: An efficient and secure multi-secret sharing scheme scheme with general access structure. J. Wuhan Univ. Natur. Sci. 11(6) (2006)

    Google Scholar 

  16. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). STOC 1989, 73–85 (1989)

    Google Scholar 

  17. Roy, P.S., Adhikari, A.: Multi-use multi-secret sharing scheme for general access structure. Annals of the University of Craiova, Math. Comput. Sci. Ser. 37(4), 50–57 (2010)

    Google Scholar 

  18. Roy, P.S., Adhikari, A., Xu, R., Kirill, M., Sakurai, K.: An efficient robust secret sharing scheme with optimal cheater resiliency. SPACE. LNCS 8804, 47–58 (2014)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  20. Shao, J.: Efficient verifiable multi-secret sharing scheme based on hash function. Inf. Sci. 278, 104–109 (2014)

    Article  Google Scholar 

  21. Wei, Y., Zhong, P., Xiong, G.: A Multi-stage secret sharing scheme with general access structures. In: Wireless Communications, Networking and Mobile Computing, Beijing, pp. 1–4 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, St. Xavier’s College, Kolkata, India

    Angsuman Das

  2. Department of Pure Mathematics, University of Calcutta, Kolkata, India

    Partha Sarathi Roy & Avishek Adhikari

Authors
  1. Angsuman Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Partha Sarathi Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Avishek Adhikari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Avishek Adhikari .

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Central Florida, Orlando, Florida, USA

    Ram N. Mohapatra

  2. Indian Institute of Technology Kharagpur Dept. Computer Science & Engineering, Kharagpur, West Bengal, India

    Dipanwita Roy Chowdhury

  3. Dept of Computer Science & Engineering, Haldia Institute of Technology, Haldia, West Bengal, India

    Debasis Giri

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer India

About this paper

Cite this paper

Das, A., Roy, P.S., Adhikari, A. (2015). Computationally Secure Robust Multi-secret Sharing for General Access Structure. In: Mohapatra, R., Chowdhury, D., Giri, D. (eds) Mathematics and Computing. Springer Proceedings in Mathematics & Statistics, vol 139. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2452-5_9

Download citation

Publish with us

Policies and ethics

Search

Navigation