Name
Title | ||
|---|---|---|
Inference Attacks on Encrypted Databases Based on Order Preserving Assignment Problem. |
Abstract | ||
|---|---|---|
In ACM CCS 2015, Naveed et al. proposed attacks using plaintext auxiliary data for databases encrypted by ordered preserving encryption or more general property preserving encryptions. Their attacks are based on the Hungarian algorithm for solving the linear sum assignment problem (LSAP). In this work, we define a new assignment optimization problem with an additional condition of order structure and propose a search algorithm for finding its exact solution. We apply the new algorithm to attack an encrypted database in the same situation as Naveed et al. and found that our proposed method improves the success probability of the attacks compared with the attacks of Naveed et al. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-319-97916-8_3 | ADVANCES IN INFORMATION AND COMPUTER SECURITY, IWSEC 2018 |
Keywords | Field | DocType |
Linear sum assignment problem,Order-preserving encryption,Inference attacks,Encrypted databases | Hungarian algorithm,Search algorithm,Inference,Computer science,Encryption,Assignment problem,Optimization problem,Plaintext,Database | Conference |
Volume | ISSN | Citations |
11049 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sota Onozawa | 1 | 0 | 0.34 |
| Noboru Kunihiro | 2 | 425 | 45.72 |
| Masayuki Yoshino | 3 | 21 | 7.43 |
| Ken Naganuma | 4 | 9 | 3.59 |