Update Recovery Attacks on Encrypted Database within Two Updates using Range Queries Leakage
نویسندگان
چکیده
منابع مشابه
Improved Reconstruction Attacks on Encrypted Data Using Range Query Leakage
We analyse the security of database encryption schemes supporting range queries against persistent adversaries. Security against such an adversary captures, among other things, the privacy of the client’s data with respect to the server hosting the encrypted database. The bulk of our work applies to a generic setting, where the view of the adversary is limited to the set of records or documents...
متن کاملFinal Project: Conjunctive, Subset, and Range Queries on Encrypted Data
The 2006 paper Conjunctive, Subset, and Range Queries on Encrypted Data by Dan Boneh and Brent Waters addresses the problem of predicate evaluation on encrypted data in the public key setting – one that does not leak any additional information about the data. The authors provide both a security notion for such queries and an efficient construction based on the bilinear and 3-party composite Dif...
متن کاملConjunctive, Subset, and Range Queries on Encrypted Data
We construct public-key systems that support comparison queries (x ≥ a) on encrypted data as well as more general queries such as subset queries (x ∈ S). Furthermore, these systems support arbitrary conjunctive queries (P1 ∧ · · · ∧ P`) without leaking information on individual conjuncts. We present a general framework for constructing and analyzing public-key systems supporting queries on encr...
متن کاملFastGeo: Efficient Geometric Range Queries on Encrypted Spatial Data
Spatial data have wide applications, e.g., location-based services, and geometric range queries (i.e., finding points inside geometric areas, e.g., circles or polygons) are one of the fundamental search functions over spatial data. The rising demand of outsourcing data is moving large-scale datasets, including large-scale spatial datasets, to public clouds. Meanwhile, due to the concern of insi...
متن کاملEfficient Updates for OLAP Range Queries on Flash Memory
This paper explores efficient ways to use flash memory to store OLAP data. The particular type of queries considered are range queries using the aggregate functions SUM, COUNT and AVG. The asymmetric cost of reads and writes for flash memory gives higher importance to how updates are handled in a flash memory environment. A popular data structure used for answering OLAP rangesum queries is the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Dependable and Secure Computing
سال: 2020
ISSN: 1545-5971,1941-0018,2160-9209
DOI: 10.1109/tdsc.2020.3015997