Identity-based provable data possession revisited: Security analysis and generic construction

2017 ◽  
Vol 54 ◽  
pp. 10-19 ◽  
Author(s):  
Hongyu Liu ◽  
Yi Mu ◽  
Jining Zhao ◽  
Chunxiang Xu ◽  
Huaqun Wang ◽  
...  
2015 ◽  
Vol 8 (18) ◽  
pp. 3602-3614 ◽  
Author(s):  
Maryam Rajabzadeh Asaar ◽  
Mahmoud Salmasizadeh ◽  
Colin Boyd

2021 ◽  
Author(s):  
Yilin Yuan ◽  
Jianbiao Zhang ◽  
Wanshan Xu ◽  
Xiao Wang ◽  
Yanhui Liu

Abstract Under the shared big data environment, most of the existing data auditing schemes rarely consider the authorization management of group users. Meanwhile, how to deal with the shared data integrity is a problem that needs to be pondered. Thus, in this paper, we propose a novel remote data checking possession scheme which achieves group authority management while completing the public auditing. To perform authority management work, we introduce a trusted entity – group manager. We formalize a new algebraic structure operator named authorization invisible authenticator (AIA). Meanwhile, we provide two versions of AIA scheme: basic AIA scheme and standard AIA scheme. The standard AIA scheme is constructed based on the basic AIA scheme and user information table (UIT), with advanced security and wider applicable scenarios. By virtue of standard AIA scheme, the group manager can perfectly and easily carry out authority management, including enrolling, revoking, updating. On the basis of the above, we further design a public auditing scheme for non-revoked users’ shared data. The scheme is based on identity-based encryption (IBE), which greatly reduce the necessary certificate management cost. Furthermore, the detailed security analysis and performance evaluation demonstrate that the scheme is safe and feasible.


2018 ◽  
Vol 442-443 ◽  
pp. 158-172 ◽  
Author(s):  
Jia Yu ◽  
Rong Hao ◽  
Hui Xia ◽  
Hanlin Zhang ◽  
Xiangguo Cheng ◽  
...  

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 23277-23283 ◽  
Author(s):  
Ganglin Zhang ◽  
Yongjian Liao ◽  
Yu Fan ◽  
Yikuan Liang

2020 ◽  
Vol 51 ◽  
pp. 102454
Author(s):  
Reyhaneh Rabaninejad ◽  
Mahmoud Ahmadian Attari ◽  
Maryam Rajabzadeh Asaar ◽  
Mohammad Reza Aref

2020 ◽  
Vol 31 (02) ◽  
pp. 175-191
Author(s):  
Yinxia Sun ◽  
Futai Zhang ◽  
Anmin Fu ◽  
Zhe Xia

Certificateless cryptosystems have attracted great interests in cryptographic research since its invention. Because compared with traditional public key cryptosystems or identity-based cryptosystems, they could not only simplify the certificate management, but also alleviate the key escrow problem. In certificateless cryptosystems, user revocation is a challenging issue. To address this issue, one popular method is to update the key via public channels. However, most of the existing schemes in this approach are impractical because of the following two shortcomings. Firstly, the user needs to maintain a list of decryption keys, but the size of the list will keep increasing. Secondly, the revoked user can still recover the plaintexts of the encrypted data prior to revocation, and this is a particular threat in some applications. To solve these problems, this paper presents revocable certificateless encryption with ciphertext evolution. We give a generic construction and then describe how it can be initialized concretely. In our proposed scheme, the user only needs to keep one decryption key, and once a user is revoked, it can no longer decrypt any ciphertext in the server. Moreover, the IND-CCA security model is defined against three types of attacks. And our schemes are formally proved to satisfy these security requirements.


Sign in / Sign up

Export Citation Format

Share Document