A Provably Secure Re-encryption-Based Access Control in Hierarchy

Author(s):  
Gaurav Pareek ◽  
B. R. Purushothama
IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 55382-55397 ◽  
Author(s):  
Ashok Kumar Das ◽  
Mohammad Wazid ◽  
Animi Reddy Yannam ◽  
Joel J. P. C. Rodrigues ◽  
Youngho Park

2014 ◽  
Vol 75 (1) ◽  
pp. 405-424 ◽  
Author(s):  
Mohammad Sabzinejad Farash ◽  
Mahmoud Ahmadian Attari

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Jan Hajny ◽  
Petr Dzurenda ◽  
Lukas Malina

Card-based physical access control systems are used by most people on a daily basis, for example, at work, in public transportation, or at hotels. Yet these systems have often very poor cryptographic protection. User identifiers and keys can be easily eavesdropped on and counterfeited. The privacy-preserving features are almost missing in these systems. To improve this state, we propose a novel cryptographic scheme based on efficient zero-knowledge proofs and Boneh-Boyen signatures. The proposed scheme is provably secure and provides the full set of privacy-enhancing features, that is, the anonymity, untraceability, and unlinkability of users. Furthermore, our scheme supports distributed multidevice authentication with multiple RFID (Radio-Frequency IDentification) user devices. This feature is particularly important in applications for controlling access to dangerous sites where the presence of protective equipment is checked during each access control session. Besides the full cryptographic specification, we also show the results of our implementation on devices commonly used in access control applications, particularly the smart cards and embedded verification terminals. By avoiding costly operations on user devices, such as bilinear pairings, we were able to achieve times comparable to existing systems (around 500 ms), while providing significantly higher security, privacy protection, and features for RFID multidevice authentication.


2019 ◽  
Vol 15 (1) ◽  
pp. 457-468 ◽  
Author(s):  
Sandip Roy ◽  
Ashok Kumar Das ◽  
Santanu Chatterjee ◽  
Neeraj Kumar ◽  
Samiran Chattopadhyay ◽  
...  

2018 ◽  
Vol 42 (6) ◽  
Author(s):  
Anyembe Andrew Omala ◽  
Angolo Shem Mbandu ◽  
Kamenyi Domenic Mutiria ◽  
Chunhua Jin ◽  
Fagen Li

Symmetry ◽  
2018 ◽  
Vol 10 (10) ◽  
pp. 482 ◽  
Author(s):  
Huidong Qiao ◽  
Haihe Ba ◽  
Huaizhe Zhou ◽  
Zhiying Wang ◽  
Jiangchun Ren ◽  
...  

Cryptographic cloud storage (CCS) is a secure architecture built in the upper layer of a public cloud infrastructure. In the CCS system, a user can define and manage the access control of the data by himself without the help of cloud storage service provider. The ciphertext-policy attribute-based encryption (CP-ABE) is considered as the critical technology to implement such access control. However, there still exists a large security obstacle to the implementation of CP-ABE in CCS. That is, how to identify the malicious cloud user who illegally shares his private keys with others or applies his keys to construct a decryption device/black-box, and provides the decryption service. Although several CP-ABE schemes with black-box traceability have been proposed to address the problem, most of them are not practical in CCS systems, due to the absence of scalability and expensive computation cost, especially the cost of tracing. Thus, we present a new black-box traceable CP-ABE scheme that is scalable and high efficient. To achieve a much better performance, our work is designed on the prime order bilinear groups that results in a great improvement in the efficiency of group operations, and the cost of tracing is reduced greatly to O ( N ) or O ( 1 ) , where N is the number of users of a system. Furthermore, our scheme is proved secure in a selective standard model. To the best of our knowledge, this work is the first such practical and provably secure CP-ABE scheme for CCS, which is black-box traceable.


Sign in / Sign up

Export Citation Format

Share Document