Cryptanalysis of Comparable Encryption in SIGMOD'16

Horst, Caleb; Kikuchi, Ryo; Xagawa, Keita

doi:10.1145/3035918.3035948

Cited by 8 publications

(3 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Karras et al [25] presented range predicate solution using Matrix multiplication based technique. However Horst et al [23] presented the cryptanalysis of the scheme where they were able to break their security claims. Secure Database Systems: Hacigümüş et al [19] proposed the first system for executing SQL queries over encrypted data.…”

Section: Related Workmentioning

confidence: 99%

Secure Hypersphere Range Query on Encrypted Data

Singh,

Kaul

2021

Preprint

View full text Add to dashboard Cite

Spatial queries like range queries, nearest neighbor, circular range queries etc. are the most widely used queries in the location-based applications. Building secure and efficient solutions for these queries in the cloud computing framework is critical and has been an area of active research. This paper focuses on the problem of Secure Circular Range Queries (SCRQ), where client submits an encrypted query (consisting of a center point and radius of the circle) and the cloud (storing encrypted data points) has to return the points lying inside the circle. The existing solutions for this problem suffer from various disadvantages such as high processing time which is proportional to square of the query radius, query generation phase which is directly proportional to the number of points covered by the query etc.This paper presents solution for the above problem which is much more efficient than the existing solutions. Three protocols are proposed with varying characteristics. It is shown that all the three protocols are secure. The proposed protocols can be extended to multiple dimensions and thus are able to handle Secure Hypersphere Range Queries (SHRQ) as well. Internally the proposed protocols use pairing-based cryptography and a concept of lookup table. To enable the efficient use of limited size lookup table, a new storage scheme is presented. The proposed storage scheme enables the protocols to handle query with much larger radius values. Using the SHRQ protocols, we also propose a mechanism to answer the Secure range Queries. Extensive performance evaluation has been done to evaluate the efficiency of the proposed protocols.

show abstract

Section: Related Workmentioning

confidence: 99%

Secure Hypersphere Range Query on Encrypted Data

Singh,

Kaul

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…[28] is based on symmetric-key cryptography. After that, many schemes have been proposed to improve the performance or security [13], [14], [31], or to realize order preserving encryption and its variants by relaxing IND-CPA security [2], [7], [8], [17], [19]. In addition to algorithmic constructions of symmetric-key searchable encryption, its integration into database management systems was also studied in Refs.…”

Section: Introductionmentioning

confidence: 99%

Public-key Searchable Encryption with Index Generation for Shared Database

Matsuda

Hirano

Kawai

et al. 2020

Journal of Information Processing

View full text Add to dashboard Cite

Recently, use of cloud computing has expanded to include tasks such as data sharing among multiple enterprises for open innovations and IoT systems for device management, etc. Public-key searchable encryption is particularly useful for cases requiring protection of shared secret data. However, there is no public-key searchable encryption scheme that simultaneously achieves: (A) efficient search performance, (B) multiuser support and (C) implementation on database management systems, simultaneously. In this paper, we propose a new public-key searchable encryption scheme which (A) provides an index generation mechanism for public-key searchable encryption, and (B) generates different secret keys for multiple users. In our scheme, (A) is achieved by a portion of the deterministic values generated from a keyword, and (B) is achieved by hierarchical inner-product predicate encryption. Our scheme in particular, forms wildcards as the user identity from hierarchical inner-product predicate encryption in order to easily represent hierarchical identities. To achieve (C), we further propose an integration method which implements our scheme into database management systems through a user-defined function so that its search functionality can be easily used via SQL.

show abstract

“…However, DET and OPE can be used in the particular case of encrypting unique attributes, and attributes that cannot be ordered. 1 The paper of Karras et al [42] belongs to the family of works related to OPE schemes, but lacks formal provable security guarantees; the recent work of Horst et al [37] provides attacks against the schemes proposed by Karras, denoting the importance of rigorous security analysis of newly proposed schemes. …”

mentioning

confidence: 99%

Practical Private Range Search in Depth

Demertzis

Papadopoulos²,

Papapetrou

et al. 2018

ACM Trans. Database Syst.

View full text Add to dashboard Cite

We consider a data owner that outsources its dataset to an untrusted server. The owner wishes to enable the server to answer range queries on a single attribute, without compromising the privacy of the data and the queries. There are several schemes on "practical" private range search (mainly in databases venues) that attempt to strike a trade-off between efficiency and security. Nevertheless, these methods either lack provable security guarantees, or permit unacceptable privacy leakages. In this paper, we take an interdisciplinary approach, which combines the rigor of security formulations and proofs with efficient Data Management techniques. We construct a wide set of novel schemes with realistic security/performance trade-offs, adopting the notion of Searchable Symmetric Encryption (SSE) primarily proposed for keyword search. We reduce range search to multi-keyword search using range covering techniques with tree-like indexes, and formalize the problem as Range Searchable Symmetric Encryption (RSSE). We demonstrate that, given any secure SSE scheme, the challenge boils down to (i) formulating leakages that arise from the index structure, and (ii) minimizing false positives incurred by some schemes under heavy data skew. We also explain an important concept in the recent SSE bibliography, namely locality, and design generic and specialized ways to attribute locality to our RSSE schemes. Moreover, we are the first to devise secure schemes for answering range aggregate queries, such as range sums and range min/max. We analytically detail the superiority of our proposals over prior work and experimentally confirm their practicality. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. INTRODUCTIONWe focus on a setting with two parties; a data owner and a server. The owner outsources its dataset to the server, and gives the latter the authority to answer range queries on a single attribute. The server is untrusted, and the goal is to protect the privacy of the dataset and the queries. The owner encrypts its data prior to sending them to the server. The challenge lies in enabling the server to process the owner's queries directly on the encrypted data, while achieving performance and costs close to the non-private case. The benefits of data outsourcing and the importance of privacy have been stressed in numerous earlier works (e.g., [18,59,62,66]).Prior work. Privacy-preserving range queries can be solved with optimal security via powerful theoretical cryptographic tools, such as Oblivious ...

show abstract

Cryptanalysis of Comparable Encryption in SIGMOD'16

Cited by 8 publications

References 36 publications

Secure Hypersphere Range Query on Encrypted Data

Secure Hypersphere Range Query on Encrypted Data

Public-key Searchable Encryption with Index Generation for Shared Database

Practical Private Range Search in Depth

Contact Info

Product

Resources

About