Advertisement

ESEC: An Ideal Secret Sharing Scheme

  • Greeshma Sarath
  • Deepu S. 
  • Sudharsan Sundararajan
  • Krishnashree Achuthan
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 308)

Abstract

Secret sharing techniques have been used to ensure data confidentiality and enable secure reconstruction of data. In this paper, we propose a novel secret sharing scheme called ESEC based on Elliptic Curve Cryptography (ECC). The proposed scheme is to distribute a secret to a non-intersecting group of participants with different privilege levels. In our implementation, we have three phases involving share generation, distribution, and secret regeneration. The threshold of different privilege levels is different and for reconstruction of the secret all participants will have to be from the same privilege level. The proposed scheme is a perfect and ideal secret sharing scheme.

Keywords

Secret sharing Elliptical curve cryptography Multilevel secret sharing Cryptography 

References

  1. 1.
    Hankerson, D., Menezes, A., Vanstone, S.: Guide to elliptic curve cryptography, published by Springer, Berlin (2004)Google Scholar
  2. 2.
    Shamir, A.: How to share a secret. Commun. ACM 22, 612–613 (1979)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the AFIPS National Computer Conference, pp. 313–317 (1979)Google Scholar
  4. 4.
    Yamamoto, H.: On secret sharing systems using (k, L, n) threshold scheme. IECE. Trans., vol. J68–A(9), pp. 945–952, 1985 (in Japanese). English translation: Electronics and Communications in Japan, Part I, vol. 69(9), pp. 46–54, Scripta Technica, Inc., 1986Google Scholar
  5. 5.
    Xu, C., Xiao, G.: A threshold multiple secret sharing scheme. Acta Electronica Sin. 10(32), 1387–1689 (2004)Google Scholar
  6. 6.
    Sun, H., Zheng, X., Yu, Y.: A proactive secret sharing scheme based on elliptic curve cryptography 1st International Workshop on Education Technology and Computer Science, vol. 2, pp. 666–669 (2009)Google Scholar
  7. 7.
    Hua, S., Aimin, W.: A multi-secret sharing scheme with general access structures based on elliptic curve (2010)Google Scholar
  8. 8.
    Chen, H., Ling, S., Xing, C.: Access structures of elliptic secret sharing schemes (2008)Google Scholar
  9. 9.
    Farras, O., Padr´o, C.: Ideal secret sharing schemes for useful multipartite access structures IEEE, Springer, Berlin (2007)Google Scholar
  10. 10.
    Farràs, O., Padró, C.: Ideal hierarchical secret sharing schemes. IEEE Trans. Inf. theor. 58(5) (2012)Google Scholar
  11. 11.
    Beimel, A.: Secret-sharing schemes: A survey, Springer LNCS 6639, pp. 11–46 (2011)Google Scholar
  12. 12.
    Chen, H., Ling, S., Xing, C.: Access structures of elliptic secret sharing schemes. IEEE Trans. Inf. Theor. 54(2) (2008)Google Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  • Greeshma Sarath
    • 1
  • Deepu S. 
    • 2
  • Sudharsan Sundararajan
    • 2
  • Krishnashree Achuthan
    • 2
  1. 1.Department of Computer Science and EngineeringAmrita Vishwa VidyapeethamAmritapuri, KollamIndia
  2. 2.Department of Cyber Security Systems and NetworksAmrita Vishwa VidyapeethamAmritapuri, KollamIndia

Personalised recommendations