Hybrid Key Sharing
K E Pavana, P Poornima · 2015
Let us consider the problem of secret sharing with Hierarchical structure. Here the secret will be shared among group of m members, i.e, divided into different levels. Members are said to be authorized if they have atleast m0 members form the highest levels, as well as atleast m1>m0 members from two highest levels and so on. Members will differ in their authority and the presence of higher level member is essential in order to recover the secret. None of the existing system address the setting where a bank transfers should be signed by three employees, where in atleast one of them must be a Department Manager. For this problem we are considering secret sharing scheme which is suitable for the Hierarchical structure. The secret is represented in Shamir’s scheme as free co-efficient of some polynomial.