Security Analysis of a Multi-use Identity Based CCA-Secure Proxy Re-encryption Scheme

2012 ◽  
Author(s):  
Jindan Zhang ◽  
Xu An Wang
Keyword(s):  
Security Analysis ◽  
Encryption Scheme ◽  
Identity Based

SECURITY ANALYSIS OF A FUZZY IDENTITY-BASED ENCRYPTION SCHEME

2014 ◽  
Vol 23 (03) ◽  
pp. 1450033 ◽  
Author(s):  
MIAOMIAO TIAN ◽  
LIUSHENG HUANG ◽  
WEI YANG
Keyword(s):  
Security Analysis ◽  
Error Tolerance ◽  
Encryption Scheme ◽  
Security Model ◽  
Private Key ◽  
Identity Based Encryption ◽  
The Standard Model ◽  
Real World Applications ◽  
Identity Based ◽  
Fuzzy Identity

Fuzzy identity-based encryption (FIBE) scheme is a kind of identity-based encryption (IBE) scheme, in which any user's identity is composed by a set of attributes and any ciphertext encrypted under identity ID can be decrypted by using a private key corresponding to identity ID′ if ID′ is close to ID as measured by some metric. Due to the error-tolerance property, FIBE scheme is very useful in real-world applications. However, most FIBE schemes are provable secure only in a weaker security model. In order to eliminate this problem, Ren et al. recently proposed a new FIBE scheme and proved that it is fully chosen-ciphertext secure in the standard model. Unfortunately, in this paper, we will show that their FIBE scheme is even not chosen-plaintext secure.

A CCA-Secure Collusion-Resistant Identity-Based Proxy Re-Encryption Scheme

2018 ◽  
pp. 111-128 ◽  
Author(s):  
Arinjita Paul ◽  
Varshika Srinivasavaradhan ◽  
S. Sharmila Deva Selvi ◽  
C. Pandu Rangan
Keyword(s):  
Encryption Scheme ◽  
Identity Based

scholarly journals Remote Data Possession Checking Scheme with Supporting Efficient Group User Authority Management for Shared Cloud Data

2021 ◽  
Author(s):  
Yilin Yuan ◽  
Jianbiao Zhang ◽  
Wanshan Xu ◽  
Xiao Wang ◽  
Yanhui Liu
Keyword(s):  
Security Analysis ◽  
Public Auditing ◽  
Cloud Data ◽  
The Public ◽  
Shared Data ◽  
Identity Based ◽  
And Performance ◽  
Data Auditing ◽  
Data Checking ◽  
Remote Data

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.

Research on Identity-Based Encryption Scheme for Grid Computing System

2014 ◽  
Vol 543-547 ◽  
pp. 3156-3159
Author(s):  
Qing Hai Bai ◽  
Ying Zheng ◽  
Qing Hu Wang ◽  
Guo Li Wei ◽  
Hai Chun Zhao ◽  
...  
Keyword(s):  
Grid Computing ◽  
Data Transmission ◽  
Computing System ◽  
Grid Service ◽  
Encryption Scheme ◽  
Grid System ◽  
Identity Based Encryption ◽  
Diffie Hellman ◽  
Long Run ◽  
Identity Based

Grid system has secure requirements of confidential communication, data integrity and non-repudiation. According to the secure requirements for Grid service, the paper proposed an identity-based encryption scheme for Grid, which can solve a series of problem: the privacy of data transmission, validation of integrity of data, key update after long run time and non-repudiation. The scheme is constructed by bilinear paring on elliptic cures and its security can be reduced to the computational Bilinear Diffie-Hellman assumption. Finally, the authors analyses the security and efficiency of this scheme.

Sign in / Sign up

Export Citation Format

Share Document