Paper 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.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Arithmetic circuitMultilinear mapAdaptive securityHidden attributesHidden Result
- Contact author(s)
- zahraahmadian @ yahoo com
- History
- 2022-03-02: last of 7 revisions
- 2021-01-02: received
- See all versions
- Short URL
- https://ia.cr/2021/003
- License
-
CC BY