A New Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Predicate encryption allows flexible fine-grained control over access to encrypted data and achieves attribute hiding.KSW ”1” supporting inner product is the most expressive predicate encryption scheme currently with large amount of pre-process and huge expenses of storage.In our scheme,we propose a new predicate encryption which prepares the ciphertext C for each attribute values one by one,and later transforms to the ciphertexts C’ corresponding to different predicates.It can greatly reduce the pre-processing time and the storage from O(2n ) to O(n ) compared to KSW ”1”,where n is the total number of attribute values in one record of a table (In the enterprise development database,n is dozens or even hundreds).The security of our scheme is against chosen-plaintext attacks in the standard model.
Predicate encryption Inner product Encrypted database CPA secure
Zhi-hui Liu Zoe L. Jiang Xuan Wang S.M. Yiu
Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen 518055, China;Shenzhen Applied Te Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen 518055, China;Public Service Plat The University of Hong Kong, Hong Kong SAR, China
国内会议
西安
英文
1-21
2014-09-19（万方平台首次上网日期，不代表论文的发表时间）