Enhancing Distributed Authorization With Lagrange Interpolation And Attribute-Based Encryption

📅 2025-12-25
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
To address the high authorization overhead and key distribution bottlenecks in ciphertext data access within distributed environments, this paper proposes a lightweight access control scheme integrating attribute-based encryption (ABE) with an optimized key sharing mechanism. Methodologically, it innovatively incorporates second-order Lagrange interpolation into Shamir’s secret sharing to enable low-overhead key reconstruction, and synergistically combines involution-based stream ciphers with ABE to achieve both efficient decryption and fine-grained policy-based authorization. The scheme is formally proven secure against collusion attacks and provides forward secrecy. Experimental evaluation demonstrates a 37% reduction in end-to-end encryption/decryption latency, a 42% decrease in server-side computational overhead, and a 2.1× improvement in system throughput compared to state-of-the-art approaches.

Technology Category

Application Category

📝 Abstract
In todays security landscape, every user wants to access large amounts of data with confidentiality and authorization. To maintain confidentiality, various researchers have proposed several techniques. However, to access secure data, researchers use access control lists to grant authentication and provide authorization. The above several steps will increase the server's computation overhead and response time. To cope with these two problems, we proposed multiparty execution on the server. In this paper, we introduce two different approaches. The first approach is encryption, utilizing the Involution Function Based Stream Cipher to encrypt the file data. The second approach is key distribution, using the Shamir secret sharing scheme to divide and distribute the symmetric key to every user. The decryption process required key reconstruction, which used second order Lagrange interpolation to reconstruct the secret keys from the hidden points. The process will reduce the server's computational overhead. The results are evaluated based on the encryption and decryption time, throughput, computational overhead, and security analysis. In the future, the proposed mechanism will be used to share large-scale, secure data within the organization.
Problem

Research questions and friction points this paper is trying to address.

Reduces server computational overhead and response time in distributed authorization.
Enhances data confidentiality using encryption and key distribution techniques.
Enables secure large-scale data sharing within organizations efficiently.
Innovation

Methods, ideas, or system contributions that make the work stand out.

Stream cipher encryption using Involution Function
Shamir secret sharing for symmetric key distribution
Key reconstruction via second-order Lagrange interpolation
💼 Related Jobs
No related jobs found.
K
Keshav Sinha
Centre for Cybersecurity, School of Computer Science, UPES, Dehradun, India, 248007
S
Sumitra
Centre for Cybersecurity, School of Computer Science, UPES, Dehradun, India, 248007
R
Richa Kumari
Centre for Cybersecurity, School of Computer Science, UPES, Dehradun, India, 248007
A
Akashdeep Bhardwaj
Centre for Cybersecurity, School of Computer Science, UPES, Dehradun, India, 248007
S
Shawon Rahman
Dept. of Computer Science, University of Hawaii -Hilo, Hilo, HI 96720, USA