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. © Springer India 2015.
CITATION STYLE
Sarath, G., Deepu, S., Sundararajan, S., & Achuthan, K. (2015). ESEC: An Ideal Secret Sharing Scheme. In Advances in Intelligent Systems and Computing (Vol. 308 AISC, pp. 135–143). Springer Verlag. https://doi.org/10.1007/978-81-322-2012-1_15
Mendeley helps you to discover research relevant for your work.