scholarly journals Efficient Construction for Full Black-Box Accountable Authority Identity-Based Encryption

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 25936-25947 ◽  
Author(s):  
Zhen Zhao ◽  
Jianchang Lai ◽  
Willy Susilo ◽  
Baocang Wang ◽  
Yupu Hu ◽  
...  
2019 ◽  
Vol 63 (4) ◽  
pp. 525-535
Author(s):  
Zhen Zhao ◽  
Ge Wu ◽  
Fuchun Guo ◽  
Willy Susilo ◽  
Yi Mu ◽  
...  

Abstract Identity-based revocation system (IBRS) generates the ciphertext with a revoked identity list such that only the non-revoked identities can use their private keys to decrypt this ciphertext. IBRS can be efficiently applied in some practical applications, such as the pay-TV systems when the number of revoked identities are much less than the non-revoked ones. However, since IBRS is based on identity-based cryptography, it also suffers from the inherent key escrow problem where the private key generator (PKG) has full control of each user’s private key. As a consequence, it is hard to judge whether a pirated private key is generated by the PKG or the suspected user. There is no study on IBRS fulfilling accountability in literature to date. In this paper, we introduce the notion of accountable authority IBRS (A-IBRS), which provides accountability in IBRS schemes. In an A-IBRS, the aforementioned problem can be alleviated and resolved. Furthermore, a full black-box A-IBRS can distinguish the creator of a black box between the PKG and the associated user and the dishonest PKG is allowed to access the decryption results of the user private key. We formalize the definition and security models of the full black-box A-IBRS schemes. Then, we present a concrete full black-box A-IBRS scheme with constant-size master public key and private key. Finally, we prove the security of our scheme under the defined security models without random oracle.


2021 ◽  
Vol 68 (3) ◽  
pp. 1-46
Author(s):  
Nico Döttling ◽  
Sanjam Garg

We provide the first constructions of identity-based encryption and hierarchical identity-based encryption based on the hardness of the (Computational) Diffie-Hellman Problem (without use of groups with pairings) or Factoring. Our construction achieves the standard notion of identity-based encryption as considered by Boneh and Franklin [CRYPTO 2001]. We bypass known impossibility results using garbled circuits that make a non-black-box use of the underlying cryptographic primitives.


2014 ◽  
Vol 513-517 ◽  
pp. 1971-1974 ◽  
Author(s):  
Hai Lin Xu ◽  
Yang Lu

Certificate-based encryption is a new paradigm which was introduced by Gentry to address the complex public key revocation problem in traditional public key cryptosystems. It represents an interesting and potentially useful balance between traditional public-key encryption and identity-based encryption. In this paper, we introduce the notion of hierarchical certificate-based encryption that preserves the advantages of certificate-based encryption such as implicit certificate and key-escrow free while inheriting the properties of hierarchical identity-based encryption. We formalize the definition of hierarchical certificate-based encryption and also propose a concrete hierarchical certificate-based encryption scheme that is chosen-ciphertext secure under the hardness of bilinear Diffie-Hellman problem in the random oracle model.


Author(s):  
Jae Hong SEO ◽  
Tetsutaro KOBAYASHI ◽  
Miyako OHKUBO ◽  
Koutarou SUZUKI

2013 ◽  
Vol 8 (1) ◽  
pp. 43-50 ◽  
Author(s):  
Shengbao Wang ◽  
Zhenfu Cao ◽  
Qi Xie ◽  
Wenhao Liu

Sign in / Sign up

Export Citation Format

Share Document