the health sector, a foremost service sector in nigeria, faces a number of challenges; primarily, the persistent under-funding of the health sector by the nigerian government as evidence reveals low allocations to the health sector and poor health system performance which are reflected in key health indices of the country.notwithstanding, there is evidence that the private sector could be a key...

Matching a particular image within extensive datasets has become increasingly pressing in many practical fields. Hence, a number of matching methods have been developed when confidential images are used in image matching between a pair of security agencies, but they are limited by either search cost or search precision. In this paper, we propose a privacy-preserving private image matching schem...

With searchable encryption, a data user is able to perform meaningful search on encrypted data stored in the public cloud without revealing data privacy. Besides handling simple queries (e.g., keyword queries), complex search functions, such as multi-dimensional (conjunctive) range queries, have also been studied in several approaches to support the search of multi-dimensional data. However, cu...

____________________________________________________________ I study a version of the Lagos-Wright (2003) model of monetary exchange in which buyers have private information about their tastes and sellers make take-it-or-leave-it-offers (i.e., have the power to set prices and quantities). The introduction of imperfect information makes the existence of monetary equilibrium a more robust feature...

In this paper we compare the performance of various homomorphic encryption methods on a private search scheme that can achieve k-anonymity privacy. To make our benchmarking fair, we use open sourced cryptographic libraries which are written by experts and well scrutinized. We find that Goldwasser-Micali encryption achieves good enough performance for practical use, whereas fully homomorphic enc...

Web search has become an integral part of our lives and we use it daily for business and pleasure. Unfortunately, however, we unwittingly reveal a huge amount of private information about ourselves when we search the web. A look at a user’s search terms over a period of a few months paints a frighteningly clear and detailed picture about the user’s life. In this paper, we build on previous work...

! " $# % & (') % * + ,. / 0 1 243 5 670 2 185 246)1)9:5;.:2463?/;@ A*B8CD1(E FHGJI$K8L MN O DP Q N R : SJ ') % T U & P V#: ? ! W ,X * W % Y & Z,J ? * P [, \, Q]^ : _ ` >,a"; : b# c&,J * 4LedgfJ * ? Q h Y'7 X, ? PJ [,i# ? ! j ?'4 #: k# l,J : % Q _ h j#[ jmnh : X # #: o * p * % ? #: [,` #: : ! k : SW PJ Y ') % T * q & PJ # ? ! #[ r & 8f #!h> [,% h LgMN h s & : [S m$ W & t : h ,J mnh : u# ?...

We show two ways of recovering all matching documents, in the Ostrovsky et al. Private Search [3], while requiring considerably shorter buffers. Both schemes rely on the fact that documents colliding in a buffer position provide the sum of their plaintexts. Efficient decoding algorithms can make use of this property to recover documents never present alone in a buffer position.

Private Media Search on Public Databases

The problem of private database search has been well studied. The notion of privacy considered is twofold: i) the querier only learns the result of the query (and things that can be deduced from it), and ii) the server learns nothing (in a computational sense) about the query. A fundamental drawback with prior approaches is that the query computation is linear in the dataset. We overcome this d...