Programs
- Ph. D. in Mechanical Engineering -
- B.Tech. in Artificial Intelligence (AI) and Data Science (Medical Engineering) - Undergraduate
Publication Type : Conference Proceedings
Thematic Areas : Amrita Center for Cybersecurity Systems and Networks
Publisher : Proceedings of ICCD 2014, 1st International Conference on Intelligent Computing, Communication and Devices, AISC
Source : Proceedings of ICCD 2014, 1st International Conference on Intelligent Computing, Communication and Devices, AISC, Springer Advances in Intelligent Systems and Computing, Volume 308 , p.135–143 (2014)
Url : http://link.springer.com/chapter/10.1007/978-81-322-2012-1_15
ISBN : 9788132220114
Keywords : Cryptography, Elliptical curve cryptography, Multilevel secret sharing, Secret sharing
Campus : Amritapuri
School : Centre for Cybersecurity Systems and Networks, Department of Computer Science and Engineering, School of Engineering
Center : Cyber Security
Department : Computer Science, cyber Security
Verified : Yes
Year : 2014
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 : Greeshma 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, AISC, vol. 308 . Springer Advances in Intelligent Systems and Computing, pp. 135–143, 2014.