Cryptology ePrint Archive: Report 2021/003

Ciphertext Policy Attribute Based Encryption for Arithmetic circuits

Mahdi Mahdavi Oliaee and Zahra Ahmadian

Abstract: We present the first Ciphertext Policy Attribute Based Encryption (CP-ABE) scheme where access policies are expressed as arithmetic circuits. The idea is first introduced as a basic design based on the multilinear map. Then, two improved versions of that, with or without the property of hidden attributes, are introduced. We also define the concept of Hidden Result Attribute Based Encryption (HR-ABE) which means that the result of the arithmetic function is hidden from the users. We prove that the proposed schemes have adaptive security, under the assumption of the hardness of the (k-1)-Distance Decisional Diffie- Hellman problem.

Category / Keywords: public-key cryptography / Ciphertext Policy Attribute Based Encryption (CP-ABE), Arithmetic circuit, Multilinear map, Adaptive security, Hidden attributes, Hidden Result

Date: received 31 Dec 2020

Contact author: zahraahmadian at yahoo com

Available format(s): PDF | BibTeX Citation

Version: 20210102:114013 (All versions of this report)

Short URL: ia.cr/2021/003


[ Cryptology ePrint archive ]