Publication Type:

Conference Proceedings

Source:

Proceedings of ICCD 2014, 1st International Conference on Intelligent Computing, Communication and Devices, Springer Advances in Intelligent Systems and Computing, p.135–143 (2014)

ISBN:

9788132220114

URL:

http://link.springer.com/chapter/10.1007/978-81-322-2012-1_15

Keywords:

Cryptography, Elliptical curve cryptography, Multilevel secret sharing, Secret sharing

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.

Cite this Research Publication

G. Sarath, Deepu, S., Sundararajan, S., and Achuthan, K., “ESEC: An Ideal Secret Sharing Scheme”, Proceedings of ICCD 2014, 1st International Conference on Intelligent Computing, Communication and Devices. Springer Advances in Intelligent Systems and Computing, pp. 135–143, 2014.

207
PROGRAMS
OFFERED
5
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
9th
RANK(INDIA):
NIRF 2017
150+
INTERNATIONAL
PARTNERS