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 with arithmetic circuit access policy. The idea is first introduced as a basic design which is based on the multilinear maps. Then, two improved versions of this scheme, 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 will not be revealed to the users. We define a new hardness assumption, called (k-1)-Distance Decisional Diffie-Hellman assumption, which is at least as hard as the k-multilinear decisional Diffie-Hellman assumption. Under this assumption, we prove that the proposed schemes have adaptive security.

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, last revised 2 Mar 2021

Contact author: zahraahmadian at yahoo com

Available format(s): PDF | BibTeX Citation

Version: 20210302:143504 (All versions of this report)

Short URL: ia.cr/2021/003


[ Cryptology ePrint archive ]