Abstract
Attribute based encryption (ABE) has been widely applied for secure data protection in various data sharing systems. However, the efficiency of existing ABE schemes is not high enough since running encrypt and decrypt algorithms need frequent bilinear pairing operations, which may occupy too much computing resources on terminal devices. What’s more, since different users may share the same attributes in the system, a single user’s private key exposure will threaten the security and confidentiality of the whole system. Therefore, to further decrease the computation cost in attribute based cryptosystem as well as provide secure protection when key exposure happens, in this paper, we firstly propose a high efficient key-insulated ABE algorithm without pairings. The key-insulated mechanism guarantees both forward security and backward security when key exposure or user revocation happens. Besides, during the running of algorithms in our scheme, users and attribute authority needn’t run any bilinear pairing operations, which will increase the efficiency to a large extent. The high efficiency and security analysis indicate that our scheme is more appropriate for secure protection in data sharing systems.
Highlights
With the continuing increase of network information resources, users are confronted with urgent challenges such as how to make secure data sharing with others efficiently
The efficiency of current attribute based encryption (ABE) schemes is still not high enough compared to traditional public key cryptosystem
To better guarantee the security during the process of data sharing as well as minimize the total computation cost, in the paper, we do the following research: We propose a high efficient key-insulated ABE scheme without pairings (KI-ABEWP)
Summary
With the continuing increase of network information resources, users are confronted with urgent challenges such as how to make secure data sharing with others efficiently. To help users achieve secure and flexible data access control, Sahai and Waters (2005) proposed a new notion called attribute based encryption (ABE). In this cryptosystem, data receiver’s access privileges are described by a certain number of attributes. To better guarantee the security during the process of data sharing as well as minimize the total computation cost, in the paper, we do the following research: We propose a high efficient key-insulated ABE scheme without pairings (KI-ABEWP). Only part of the private key has to be updated and the system public parameters remain unchanged This saves a lot of computation and transmission load when attribute revocation or key exposure happens. We conclude our paper and make prospects on future directions in “Conclusion” section
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
