Provable Security Analysis on Unbounded Hierarchical Identity-Based Encryption and Attribute-Based Encryption

2016 ◽  
Author(s):  
Yajun Jiang ◽  
Ming Du
Keyword(s):  
Provable Security ◽  
Security Analysis ◽  
Identity Based Encryption ◽  
Attribute Based Encryption ◽  
Identity Based

scholarly journals Light Weight Cryptography based Medical Data and Image Encryption Scheme

Webology ◽  
2021 ◽  
Vol 18 (2) ◽  
pp. 88-104
Author(s):  
M. Raja ◽  
Dr.S. Dhanasekaran ◽  
Dr.V. Vasudevan
Keyword(s):  
Data Privacy ◽  
Medical Information ◽  
Security Analysis ◽  
Encrypted Data ◽  
Attribute Based Encryption ◽  
Identity Based ◽  
Information Confidentiality ◽  
Processing And Storage ◽  
And Storage ◽  
Maintenance Problem

Many medical companies use cloud technology to collect, distribute and transmit medical records. Given the need for medical information, confidentiality is a key issue. In this study, we propose an encrypted scheme based on encrypted data for an electronic healthcare environment. We use hybrid Attribute based encryption and Triple DES encryption technique (ABETDES) scheme, including identity-based cryptography (IBC), to ensure data privacy through communication channels և to improve the reliability of cloud computing. There are also limited indicators of light processing and storage resources. This solves a serious maintenance problem and ensures that a private key is created where it is not blind. The introduction of a security option, a comprehensive security analysis to protect ciphertext, shows that our program is effective against many known attacks and compared to existing methods.

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.

scholarly journals IMPLEMENTING CLOUD REVOCATION AUTHORITY WITH IDENTITY BASED ENCRYPTION AND ITS APPLICATIONS

2017 ◽  
Vol 5 (4RACSIT) ◽  
pp. 38-40
Author(s):  
Andal S. ◽  
Tahera Tasneem ◽  
Meghana Mary ◽  
Ranjitha G. C. ◽  
Deepak N.A.
Keyword(s):  
Security Analysis ◽  
Cloud Service ◽  
Critical Issue ◽  
Cloud Services ◽  
Public Key ◽  
Cloud Service Provider ◽  
Identity Based Encryption ◽  
Computation Technique ◽  
Diffie Hellman ◽  
Identity Based

Identity-based encryption(IBE) is a public key cryptosystem(encoding and decoding) and eliminates the demands of public key infrastructure(PKI) and certificate administration in conventional public key settings. Due to the absence of PKI, the revocation problem is a critical issue in IBE settings. Several revocable IBE schemes have been proposed regarding this issue. Quite recently, by embedding an outsourcing computation technique into IBE, a revocable IBE scheme with a key-update cloud service provider (KU-CSP) was proposed.However, their scheme has two shortcomings. One is that the computation and communication costs are higher than previous revocable IBE schemes. The other shortcoming is lack of scalability in the sense that the KU-CSP must keep a secret value for each user. In the article, we propose a new revocable IBE scheme with a cloud revocation authority (CRA) to solve the two shortcomings namely, the performance is significantly improved and the CRA holds only a system secret for all the users. For security analysis, we demonstrate that the proposed scheme is semantically secure under the decisional bilinear Diffie-Hellman (DBDH) assumption. Finally,we extend the proposed revocable IBE scheme to present a CRA-aided authentication scheme with period-limited privileges for managing a large number of various cloud services.

scholarly journals Scalable Wildcarded Identity-Based Encryption with Full Security

Electronics ◽  
2020 ◽  
Vol 9 (9) ◽  
pp. 1453
Author(s):  
Jiwon Lee ◽  
Seunghwa Lee ◽  
Jihye Kim ◽  
Hyunok Oh
Keyword(s):  
Prime Order ◽  
Experimental Results ◽  
Network Systems ◽  
Practical Applications ◽  
Identity Based Encryption ◽  
Constant Size ◽  
Attribute Based Encryption ◽  
Organization Networks ◽  
Identity Based ◽  
Selective Security

Wildcarded identity-based encryption (WIBE) is an encryption system where one can encrypt messages to multiple users by specifying a pattern, which is a set of identity strings or wildcards. It is a useful primitive for practical applications where users are defined with multiple attributes (or affiliations), such as organization networks or IoT firmware updates. However, the ciphertext size in traditional WIBE schemes are linear to the number of wildcards in the pattern; since the ciphertext size determines the payload in network systems, it degrades the practicality when deployed in transmission-sensitive systems. In this paper, we represent scalable wildcarded identity-based encryption (SWIBE), which achieves a constant-size ciphertext regardless of the number of wildcards (or depth of patterns). the SWIBE scheme also allows the wildcard usage key derivation as well as encryption: a user with wildcarded pattern can delegate keys for the fixed pattern. Compared to the existing WIBE schemes, the SWIBE scheme is the first approach to yield constant-size ciphertext. Moreover, SWIBE also improves encryption time and decryption time while maintaining a key size of 2L, comparable to the key size of L in WIBE schemes (where L is a depth of the pattern). The experimental results show that the decryption time is 3 to 10 times faster than the existing WIBE schemes, and 650 times faster than the attribute-based encryption with constant-size ciphertext. For the security, we first propose the selective-CPA-secure SWIBE scheme in a prime order bilinear group and extend it to be selective-CCA-secure. Then we also propose a fully-secure SWIBE scheme which can overcome the selective security.

scholarly journals A Multi-Authority Attribute-Based Encryption System Against Malicious KGC

2012 ◽  
Vol 6-7 ◽  
pp. 38-44
Author(s):  
Guo Yan Zhang
Keyword(s):  
Encryption Scheme ◽  
Central Authority ◽  
Key Escrow ◽  
Identity Based Encryption ◽  
Attribute Based Encryption ◽  
Identity Based

Attribute-based encryption scheme is a scheme in which each user is identified by a set of attributes, and some function of those attributes is used to determine decryption ability for each ciphertext. Similar with identity-based encryption scheme, attribute-based schemes are also confronted with key escrow problem. Furthermore, the attributes belonging to a user usually are monitored by different authorities. This paper resolves the two problems by using a general attribute-based encryption scheme and K-Sibling intractable function families. In our construction, different attributes sets of a user are still certified by different authorities, but the partial private keys corresponding to the attributes are generated by a central authority. Simultineously, different authorities jointly generate the users’ secret value which cannot be obtained by the central authority. Compared with general multi-authourity attributed-based encryption scheme, our approach has more efficiency.

Sign in / Sign up

Export Citation Format

Share Document