TY - GEN
T1 - Generic construction of publicly verifiable predicate encryption
AU - Tan, Chuting
AU - Jiang, Zoe L.
AU - Wang, Xuan
AU - Yiu, S. M.
AU - Fang, Junbin
AU - Li, Jin
AU - Jin, Yabin
AU - Huang, Jiajun
N1 - Publisher Copyright:
© 2016 ACM.
PY - 2016/5/30
Y1 - 2016/5/30
N2 - There is an increasing trend for data owners to store their data in a third-party cloud server and buy the service from the cloud server to provide information to other users. To ensure confidentiality, the data is usually encrypted. Therefore, a searching scheme for encrypted data (without decrypting the data) with privacy preserving property is of paramount importance. Predicate encryption (PE) is one of the attractive solutions due to its attribute-hiding merit. Also, as the cloud service provider is not always trusted, verifying the searched results is also crucial. In this paper, we first propose a generic construction for a Publicly Verifiable Predicate Encryption (PVPE) scheme which allows users to verify the results returned by the server. We then prove the security of the PVPE scheme by reducing it to the security of PE. To make the scheme more practical, we further improve the PVPE scheme to reduce both the communication and computation overheads with a trade-o of having a small probability that the verification may fail.
AB - There is an increasing trend for data owners to store their data in a third-party cloud server and buy the service from the cloud server to provide information to other users. To ensure confidentiality, the data is usually encrypted. Therefore, a searching scheme for encrypted data (without decrypting the data) with privacy preserving property is of paramount importance. Predicate encryption (PE) is one of the attractive solutions due to its attribute-hiding merit. Also, as the cloud service provider is not always trusted, verifying the searched results is also crucial. In this paper, we first propose a generic construction for a Publicly Verifiable Predicate Encryption (PVPE) scheme which allows users to verify the results returned by the server. We then prove the security of the PVPE scheme by reducing it to the security of PE. To make the scheme more practical, we further improve the PVPE scheme to reduce both the communication and computation overheads with a trade-o of having a small probability that the verification may fail.
KW - Cloud computation
KW - Predicate encryption
KW - Publicly verifiable computation
UR - https://www.scopus.com/pages/publications/84979700764
U2 - 10.1145/2897845.2897919
DO - 10.1145/2897845.2897919
M3 - 会议稿件
AN - SCOPUS:84979700764
T3 - ASIA CCS 2016 - Proceedings of the 11th ACM Asia Conference on Computer and Communications Security
SP - 889
EP - 894
BT - ASIA CCS 2016 - Proceedings of the 11th ACM Asia Conference on Computer and Communications Security
PB - Association for Computing Machinery, Inc
T2 - 11th ACM Asia Conference on Computer and Communications Security, ASIA CCS 2016
Y2 - 30 May 2016 through 3 June 2016
ER -