We consider the following problem: users of an organization wish to outsource the storage of sensitive data to a large database server. It is assumed that the server storing the data is untrusted so the data stored have to be encrypted. We further suppose that the manager of the organization has the right to access all data, but a member of the organization can not access any data alone. The member must collaborate with other members to search for the desired data. In this paper, we investigate the notion of threshold privacy preserving keyword search (TPPKS) and define its security requirements. We construct a TPPKS scheme and show the proof of security under the assumptions of intractability of discrete logarithm, decisional Diffie-Hellman and computational Diffie-Hellman problems. © Springer-Verlag Berlin Heidelberg 2008.
CITATION STYLE
Wang, P., Wang, H., & Pieprzyk, J. (2008). Threshold privacy preserving keyword searches. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4910 LNCS, pp. 646–658). Springer Verlag. https://doi.org/10.1007/978-3-540-77566-9_56
Mendeley helps you to discover research relevant for your work.