Databases Reference
In-Depth Information
number of words used (dictionary size). Boneh et al. [36] proposed an alter-
native for senders to encrypt e-mails with recipients' public keys, and store
this email on untrusted mail servers. They present two search protocols: (1) a
non-interactive search-able encryption scheme based on a variant of the Die-
Hellman problem that uses bilinear maps on elliptic curves; and (2) a protocol
using only trapdoor permutations, requiring a large number of public-private
key pairs. Both protocols are computationally expensive. Golle et al. [66]
extend the above idea to conjunctive keyword searches on encrypted data.
They propose two solutions. (1) The server stores capabilities for conjunctive
queries, with sizes linear in the total number of documents. They claim that a
majority of the capabilities can be transferred oine to the server, under the
assumption that the client knows beforehand its future conjunctive queries.
(2) Doubling the size of the data stored by the server, which reduces the com-
munication overheads between clients and servers significantly. The scheme
requires users to specify the exact positions where the search matches have to
occur, and hence is impractical. Brinkman et al. [38] deploy secret splitting
of polynomial expressions to search in encrypted XML.
4 Acknowledgments
The author is supported partly by the NSF through awards CT CNS-0627554,
CT CNS-0716608 and CRI CNS 0708025. The author also wishes to thank
Motorola Labs, IBM Research, CEWIT, and the Stony Brook Oce of the
Vice President for Research.
References
4. Datapipe.com
Managed
Hosting
Services.
Online
at
5. Discountasp.net
Microsoft
SQL
Hosting.
Online
at
7. Hostchart.com
Web
Hosting
Resource
Center.
Online
at
8. Hostdepartment.com
MySQL
Database
Hosting.
Online
at
Data
Center
Outsourcing
Services.
Online
at
10. IBM
Data
Encryption
for
DB2.
Online
at
