| Title | Multi-Authority Ciphertext Policy Attribute-Based Encryption Scheme on Ideal Lattices |
| Publication Type | Conference Paper |
| Year of Publication | 2018 |
| Authors | Liu, Zechao, Jiang, Zoe L., Wang, Xuan, Wu, Yulin, Yiu, S.M. |
| Conference Name | 2018 IEEE Intl Conf on Parallel Distributed Processing with Applications, Ubiquitous Computing Communications, Big Data Cloud Computing, Social Computing Networking, Sustainable Computing Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom) |
| Date Published | dec |
| Keywords | Access Control, authorisation, bilinear maps, Cipher Text Policy-Attribute Based Encryption (CP-ABE), Ciphertext policy attribute-based encryption, cloud computing, Collaboration, CP-ABE, cryptographic applications, cryptographic technology, cryptography, data confidentiality, data privacy, Encryption, encryption scheme, fine-grained access control, flexible threshold access policy, generic lattice, ideal lattice, Lattices, Multi-authority, multiauthority ciphertext policy, multiauthority CP-ABE scheme, multiple attribute authorities, policy-based governance, post-quantum era, pubcrawl, quantum attacks, R-LWE, Resists, ring learning with errors, Scalability, virtual attributes |
| Abstract | Ciphertext policy attribute-based encryption (CP-ABE) is a promising cryptographic technology that provides fine-grained access control as well as data confidentiality. It enables one sender to encrypt the data for more receivers, and to specify a policy on who can decrypt the ciphertext using his/her attributes alone. However, most existing ABE schemes are constructed on bilinear maps and they cannot resist quantum attacks. In this paper, we propose a multi-authority CP-ABE (MA-CPABE) scheme on ideal lattices which is still secure in post-quantum era. On one hand, multiple attribute authorities are required when user's attributes cannot be managed by a central authority. On the other hand, compared with generic lattice, the ideal lattice has extra algebraic structure and can be used to construct more efficient cryptographic applications. By adding some virtual attributes for each authority, our scheme can support flexible threshold access policy. Security analysis shows that the proposed scheme is secure against chosen plaintext attack (CPA) in the standard model under the ring learning with errors (R-LWE) assumption. |
| DOI | 10.1109/BDCloud.2018.00146 |
| Citation Key | liu_multi-authority_2018 |
Multi-Authority Ciphertext Policy Attribute-Based Encryption Scheme on Ideal Lattices