Efficient privacy preserving predicate encryption with fine-grained searchable capability for Cloud storage

详细信息    查看全文

• 作者：Xu An Wang ; ^a ; ^c ; ^f ; ^{wangxazjd@163.com}Author Vitae ; Fatos Xhafa^b ; ^{fatos@cs.upc.edu}Author Vitae ; Weiyi Cai^cAuthor Vitae ; Jianfeng Ma^dAuthor Vitae ; Fushan Wei^d ; ^eAuthor Vitae
• 关键词：Predicate encryption ; Public-key encryption with fine-grained keyword search ; Data privacy ; Data confidentiality ; Cloud storage ; Cloud data search framework
• 刊名：Computers & Electrical Engineering
• 出版年：2016
• 出版时间：November 2016
• 年：2016
• 卷：56
• 期：Complete
• 页码：871-883
• 全文大小：859 K
• 卷排序：56

文摘

We present an efficient predicate encryption system for the class of inner-product predicates that is fully secure without random oracles. PEFKS can not only test whether multiple keywords were present in the ciphertext, but also can evaluate the relations of the keywords, such as equal, disjunction/conjunction. We prove that IND-AH-CPA secure PE implies the existence of IND- PEFKS-CPA secure PEFKS, and develop a transformation of PE to PEFKS. The transformation is efficient. We also use it to construct a PEFKS scheme from our PE. We present a privacy preserving framework for implementing efficient predicate encryption with ne-grained searchable capability and roughly analysis its security.