Name
Abstract | ||
|---|---|---|
Predicate evaluation on encrypted data is a challenge that modern cryptography is starting to address. The advantages of constructing logical primitives that are able to operate on encrypted data are numerous, such as allowing untrusted parties to take decisions without actually having access to the plaintext. Systems that offer these methods are grouped under the name of searchable encryption systems. One of the challenges that searchable encryption faces today is related to computational and bandwidth costs, because the mathematical operations involved are expensive. Recent algorithms such as Hidden Vector Encryption exhibit improved efficiency, but for large scale systems the optimizations are often not enough. Many problems that can be solved using searchable encryption are embarrassingly parallel. Using a prototype, we show that parallel solutions offer sufficient cost reduction so that large scale applications become feasible. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2435349.2435369 | CODASPY |
Keywords | Field | DocType |
searchable encryption,hidden vector encryption exhibit,cloud computing,enhancing performance,logical primitive,large scale application,parallel solution,improved efficiency,bandwidth cost,large scale system,searchable encryption system,encrypted data | Multiple encryption,Client-side encryption,Internet privacy,Computer security,Computer science,Attribute-based encryption,Encryption,Probabilistic encryption,On-the-fly encryption,Filesystem-level encryption,Link encryption | Conference |
Citations | PageRank | References |
3 | 0.65 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Razvan Rughinis | 1 | 25 | 13.70 |