Skip to main content
SpringerLink
Log in

An Ideal and Perfect (t, n) Multi-secret Sharing Scheme Based on Finite Geometry

  • Conference paper
  • First Online:
Information Technology and Applied Mathematics

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 699))

Abstract

Secret sharing has numerous applications in cryptography field and distributed computing. Threshold secret allotment scheme has been well considered a lot for the last three decades and proposed many such efficient schemes. The main objective of allotment sharing scheme is to deliver the secret to some parties so that only desirable subsets of the parties can get back the secrets whereas secret cannot be leaked by other parties. Nowadays, an ideal scheme shares multiple secrets with perfect security is of high demand. In this paper, we have designed a multi-secret sharing scheme on the basis of geometry in Galois field. The scheme is ideal, perfect without information leakage.

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 EPUB and 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

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. Proc. AFIPS 48, 313–317 (1979)

    Google Scholar 

  3. Blakley, G.R., Meadows, C.: Security of ramp schemes. In: Proceedings of CRYPTO ’84, LNCS 196, Springer, pp. 242–269 (1985)

    Google Scholar 

  4. Mignotte, M.: How to share a secret. In: Proceedings of the Conference on Cryptography, pp. 371–375 (1982)

    Google Scholar 

  5. Harn, L.: Efficient sharing (broadcasting) of multiple secrets. IEE Proc. Comput. Digital Techniq. 142(3), 237–240 (1995)

    Article  Google Scholar 

  6. Hwang, R.J., Chang, C.C.: An on-line secret sharing scheme for multi secrets. J. Comput. Commun. 21(13), 1170–1176 (1998)

    Article  Google Scholar 

  7. Chien, H.Y., Jan, J.K., Tseng, Y.M.: A practical (t, n) multi-secret sharing scheme. In: IEICE Transformation of Fundamentals of Electronics, Communications and Computer, pp. 2762–2765 (2000)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. Hwang, R.J., Lee, W.B., Chang, C.C.: A concept of designing cheater identification methods for secret sharing. J. Syst. Softw. 46(1), 7–11 (1999)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  11. Bai, L.: A Strong Ramp Secret Sharing Scheme Using Matrix Projection, Presented at the Second International Workshop on Trust. Security and Privacy for Ubiquitous Computing, Niagara-Falls, Buffalo, NY (2006)

    Google Scholar 

  12. Tang, C., Yao, Z.: A New (t, n)-threshold secret sharing scheme. In: International Conference on Advanced Computer Theory and Engineering, IEEE pp. 920–924 (2008)

    Google Scholar 

  13. Shi, R., Zhong, H.: A secret sharing scheme with the changeable threshold value. In: International Symposium on Information Engineering and Electronic Commerce, IEEE 2009 pp. 233–236

    Google Scholar 

  14. Chou,Y., Chih, H.L., Pao, C.L., Li, Y.C.: A (2, 3) threshold secret sharing scheme using Sudoku. In: Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing. IEEE (2010)

    Google Scholar 

  15. Harn, L., Lin, C.: Strong (n, t, n) verifiable secret sharing scheme. J. Inform. Sci. 180(16), 3059–3064 (2010)

    Article  MathSciNet  Google Scholar 

  16. Liu, Y.X., Harn, L., Yang, C.N., Zhang, Y.Q.: Efficient (n, t, n) secret sharing schemes. J. Syst. Softw. 85(6), 1325–1332 (2012)

    Article  Google Scholar 

  17. Patil, S., Desmukh, P.: A novel (t, n) threshold secret sharing using dot product of linearly independent vectors. Int. J. Adv. Res. Comput. Commun. Eng. 2(7) (2013)

    Google Scholar 

  18. Guo, C., Chang, C.C.: A construction for secret sharing scheme with general access structure. J. Informat. Hiding Multimed. Signal Proc. 4(1) (2013)

    Google Scholar 

  19. Tassa, T.: Hierarchical threshold secret sharing. J. Cryptol. 20(2), 237–264 (2007)

    Article  MathSciNet  Google Scholar 

  20. Zhao, D., Peng, H., Wang, C., Yang, Y.: A secret sharing scheme with a short share realizing the (t, n) threshold and the adversary structure. J. Comput. Math. Appl. 64, 611–615 (2012)

    Article  MathSciNet  Google Scholar 

  21. Su, J., Juan, T., Chuang Y.L., Li, M.J.: An online verifiable and detectable (t, n) multi-secret sharing scheme based on HS-TS. In: Proceedings of Fourth International Conference in Information Technology and Applications (ICITA2007), Harbin, China, EI , vol. I, pp. 56–59 January 15–18, 2007

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  23. Subba Rao, Y.V., Chakravarthy, B.: CRT based threshold multi secret sharing scheme. Int. J. Netw. Security, 16(4), 249–255 (2014)

    Google Scholar 

  24. Yuan, L., Li, M., Guo, C., Choo, K.R., Ren,Y.: Novel threshold changeable secret sharing schemes based on polynomial interpolation. PLoS One 11(10), e0165512 (2016). https://doi.org/10.1371/journal.pone.0165512

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tamralipta Mahavidyalaya, Tamluk, 721636, WB, India

    Barun Duari

  2. Haldia Institute of Technology, Haldia, 721657, WB, India

    Debasis Giri

Authors
  1. Barun Duari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Debasis Giri
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Barun Duari .

Editor information

Editors and Affiliations

  1. Department of Mathematics and Statistics, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India

    Peeyush Chandra

  2. Department of Computer Science and Engineering, Haldia Institute of Technology, Haldia, West Bengal, India

    Debasis Giri

  3. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China

    Fagen Li

  4. Department of Mathematics, National Institute of Technology Durgapur, Durgapur, West Bengal, India

    Samarjit Kar

  5. Department of Applied Sciences, Haldia Institute of Technology, Haldia, West Bengal, India

    Dipak Kumar Jana

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Duari, B., Giri, D. (2019). An Ideal and Perfect (t, n) Multi-secret Sharing Scheme Based on Finite Geometry. In: Chandra, P., Giri, D., Li, F., Kar, S., Jana, D. (eds) Information Technology and Applied Mathematics. Advances in Intelligent Systems and Computing, vol 699. Springer, Singapore. https://doi.org/10.1007/978-981-10-7590-2_6

Download citation

Publish with us

Policies and ethics

Search

Navigation