Enhancing Distributed Authorization With Lagrange Interpolation And Attribute-Based Encryption

TL;DR

This paper proposes a novel distributed authorization framework combining Lagrange interpolation and attribute-based encryption to reduce server overhead and enhance data security in access control systems.

Contribution

It introduces two approaches: an involution function stream cipher for encryption and a Shamir secret sharing scheme with Lagrange interpolation for key distribution and reconstruction.

Findings

Reduced server computational overhead during data access

Efficient encryption and decryption times demonstrated

Enhanced security through secret sharing and attribute-based encryption

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.