Name
Abstract | ||
|---|---|---|
Searchable encryption (SE) provides a privacy-preserving mechanism for data users to search over encrypted data stored on a remote server. Researchers have designed a number of SE schemes with high efficiency yet allowing some degree of leakage profile to the remote server. The leakage, however, should be further measured to allow us to understand what types of attacks an SE scheme would encounter... |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/TIFS.2018.2866321 | IEEE Transactions on Information Forensics and Security |
Keywords | Field | DocType |
Encryption,Cryptography,Data privacy,Upper bound,Query processing | Pattern recognition,Upper and lower bounds,Computer science,Server,Computer network,Encryption,Artificial intelligence | Journal |
Volume | Issue | ISSN |
14 | 3 | 1556-6013 |
Citations | PageRank | References |
7 | 0.51 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianting Ning | 1 | 100 | 14.61 |
| Jia Xu | 2 | 22 | 3.56 |
| Kaitai Liang | 3 | 612 | 45.13 |
| Fan Zhang | 4 | 90 | 24.51 |
| Ee-chien Chang | 5 | 835 | 75.36 |