Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/117099
34 Visitors38 Hits0 Downloads
Threshold privacy preserving keyword searches
SOFSEM (34th : 2008) (19 - 25 January 2008 : Nový Smokovec, Slovakia)
Geffert, Viliam; Karhumäki, Juhani; Bertoni, Alberto; Preneel, Bart; Návrat, Pavol and Bieliková, Mária. SOFSEM 2008 : theory and practice of computer science : 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008 : proceedings, p.646-658
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.