Selective Secure ABE Schemes Based on Prime Order Group
Qi Xia, Jianbin Gao, Daniel Adu Worae, Isaac Amankona Obiri, Kwame Omono Asamoah · 2023
This chapter provides attribute-based encryption schemes that are secure in the selective security model. In the selective security model, the adversary and the challenger play a security game with the intent of the adversary to break the security of the scheme based on the underlying security assumptions such as the Decisional Diffie–Hellman security problem. The basis of the security proof is to reduce the scheme's security to the underlying security assumption in such a way that breaking the security of the scheme is equivalent to breaking the security of the proposed scheme. The caveat of the selective security assumption is that the challenger has to know in advance the specific attribute sets or the access structure the adversary is going to attack before the commencement of the security game. This makes the selective security model-based proof for ABE unrealistic in the real world. In this chapter, we shall explore two schemes: key policy attribute-based encryption and ciphertext attribute-based encryption. The concrete construction of the schemes will be provided with security proof.