Conjunctive and Disjunctive Compartmented Secret Sharing Schemes Using Elliptic Curves

Abstract This article considers two secret sharing schemes, namely, conjunctive compartmented and disjunctive compartmented. Suppose a group of companies having many compartments is working on a project. In the conjunctive compartmented scheme, a specified number of users from each compartment of every company has to collaborate to access the secret key. While in a disjunctive compartmented scheme, any company with a predetermined number of users from each compartment can get the secret key. The schemes we have proposed use elliptic curves and bilinear pairings. Our schemes are verifiable and efficient. The proposed schemes are illustrated in full detail by concrete examples using SageMath.