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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Hankerson, D., Menezes, A., Vanstone, S.: Guide to elliptic curve cryptography, published by Springer, Berlin (2004)
Shamir, A.: How to share a secret. Commun. ACM 22, 612–613 (1979)
Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the AFIPS National Computer Conference, pp. 313–317 (1979)
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., 1986
Xu, C., Xiao, G.: A threshold multiple secret sharing scheme. Acta Electronica Sin. 10(32), 1387–1689 (2004)
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)
Hua, S., Aimin, W.: A multi-secret sharing scheme with general access structures based on elliptic curve (2010)
Chen, H., Ling, S., Xing, C.: Access structures of elliptic secret sharing schemes (2008)
Farras, O., Padr´o, C.: Ideal secret sharing schemes for useful multipartite access structures IEEE, Springer, Berlin (2007)
Farrà s, O., Padró, C.: Ideal hierarchical secret sharing schemes. IEEE Trans. Inf. theor. 58(5) (2012)
Beimel, A.: Secret-sharing schemes: A survey, Springer LNCS 6639, pp. 11–46 (2011)
Chen, H., Ling, S., Xing, C.: Access structures of elliptic secret sharing schemes. IEEE Trans. Inf. Theor. 54(2) (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer India
About this paper
Cite this paper
Sarath, G., Deepu, S., Sundararajan, S., Achuthan, K. (2015). ESEC: An Ideal Secret Sharing Scheme. In: Jain, L., Patnaik, S., Ichalkaranje, N. (eds) Intelligent Computing, Communication and Devices. Advances in Intelligent Systems and Computing, vol 308. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2012-1_15
Download citation
DOI: https://doi.org/10.1007/978-81-322-2012-1_15
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2011-4
Online ISBN: 978-81-322-2012-1
eBook Packages: EngineeringEngineering (R0)