Work

Conjunctive and Disjunctive Compartmented Secret Sharing Schemes Using Elliptic Curves

Year: 2025

Type: article

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.

Source: Tatra Mountains Mathematical Publications

DOI: 10.2478/tmmp-2025-0028

Authors: Mohan Chintamani, Prabal Paul, Laba Sa

Institutions: University of Hyderabad, Birla Institute of Technology and Science, Pilani - Goa Campus, Birla Institute of Technology and Science, Pilani, Mahaveer Academy of Technology and Science University

Language: English

Topic: Cryptography and Data Security

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W7124864027

FWCI:

Cites: 22

Cited by:

Related to: