Secret Sharing and Proactive Renewal of Shares in Hierarchical Groups

Details Secret Sharing and Proactive Renewal of Shares in Hierarchical Groups Secret Sharing and Proactive Renewal of Shares in Hierarchical Groups

2010-06-07

arxiv.org/abs/1006.1192v1

International Journal of Computer Science and Information Technology 2.3 (2010) 160-179

Computer Science

Cryptography and Security

20 Pages

Scientific paper

10.5121/ijcsit.2010.2312

Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direc- tion, this paper presents a novel approach to share a secret among a hierarchy of users while overcoming the limitations of the already exist- ing mechanisms. Our work is based on traditional (k +1; n)-threshold secret sharing, which is secure as long as an adversary can compromise not more than k secret shares. But in real life it is often feasible for an adversary to obtain more than k shares over a long period of time. So, in our work we also present a way to overcome this vulnerability, while implementing our hierarchical secret sharing scheme. The use of Elliptic Curve Cryptography makes the computations easier and faster in our work.

Affiliated with

Also associated with

No associations

Rating

Secret Sharing and Proactive Renewal of Shares in Hierarchical Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Secret Sharing and Proactive Renewal of Shares in Hierarchical Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secret Sharing and Proactive Renewal of Shares in Hierarchical Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-366716