Analyzing Relation in Application Semantics and Extended Capabilities for Secret Sharing Schemes
Secret Sharing Schemes (SSS) refers to method for distributing a secret amongst a group of participants, each of whom is allocated a share of the secret. The secret can be reconstructed only when a sufficient number of shares are combined together; individual shares are of no use on their own. Secret sharing has been an active research field for many years by mathematicians as object of intrinsic interest in their own right, cryptographers as important cryptographic primitives and security engineers as technique to employ in distributed security applications. In many circumstances, secret sharing has to provide more flexibility and functionality as per the need of an application. The intent of this paper is analyzing relation in application semantics and extended capabilities such as general access structure, verifiability of shares, cheater identification, enroll and dis-enroll of shareholders, recover lost or corrupted shares and periodically renew shares.
Keywords: Secret Sharing, Network security, Multi functionality, Extended Capabilities, Cryptography
Download Full-Text
ABOUT THE AUTHORS
Sonali Patil
Sonali Patil is currently pursuing her PhD in Computer Engineering. She has received her M.E. and B.E. in Computer Engineering. Her area of interest is Secret Sharing, Cryptography and Parallel Programming.
Dr. Prashant Deshmukh
Dr. Prashant Deshmukh is a professor and head at Sipna College of Engineering and Technology, Amravati, Maharashtra, India.
Sonali Patil
Sonali Patil is currently pursuing her PhD in Computer Engineering. She has received her M.E. and B.E. in Computer Engineering. Her area of interest is Secret Sharing, Cryptography and Parallel Programming.
Dr. Prashant Deshmukh
Dr. Prashant Deshmukh is a professor and head at Sipna College of Engineering and Technology, Amravati, Maharashtra, India.
