Results 1 -
6 of
6
Search Pattern Leakage in Searchable Encryption: Attacks and New Constructions ABSTRACT
"... Searching on remote encrypted data (commonly known as searchable encryption) is becoming an important technique in secure data outsourcing, since it allows users to outsource encrypted data to the third party and maintains the keyword searching on the data at the same time. It has been widely accept ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Searching on remote encrypted data (commonly known as searchable encryption) is becoming an important technique in secure data outsourcing, since it allows users to outsource encrypted data to the third party and maintains the keyword searching on the data at the same time. It has been widely accepted in the literature that searchable encryption techniques should leak as little information as possible to the third party. An early classical method called oblivious RAM hides all information at the cost of poly-logarithmic computation and communication overheads, which turns out to be impractical in the real world applications (e.g., cloud computing). A number of efficient searchable encryption schemes have been proposed under weaker security guarantees afterwards, however, such schemes leak statistical information about the user’s search pattern. In this paper, we show that the search pattern leakage can result in non-trivial risks. As pioneer work, we present two concrete attack models exploiting user’s search pattern and some auxiliary background knowledge aiming to disclose the underlying keywords of user’s queries. To resist these attacks, we develop two new searchable encryption constructions that hide the search pattern. Our constructions are designed to be independent from the underlying searchable encryption scheme. Our experiments, which are based on the real world dataset, demonstrate the effectiveness and efficiency of proposed attack models and new constructions.
Refine the Concept of Public Key Encryption with Delegated Search
, 2012
"... Abstract. We revisit the concept of public key encryption with delegated keyword search (PKEDS), a concept proposed by Ibraimi et al. A PKEDS scheme allows a receiver to authorize third-party server(s) to search in two ways: either according to a message chosen by the server itself or according to a ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Abstract. We revisit the concept of public key encryption with delegated keyword search (PKEDS), a concept proposed by Ibraimi et al. A PKEDS scheme allows a receiver to authorize third-party server(s) to search in two ways: either according to a message chosen by the server itself or according to a trapdoor sent by the receiver. We show that the existing formulation has some defects and the proposed scheme is unnecessarily inefficient. Based on our analysis, we present a refined formulation of the primitive with a new security model. We then propose a new PKEDS scheme, which is proven secure and much more efficient than the original scheme by Ibraimi et al. 1
A Review of Research on Dual -Server Public- Key Encryption with Keyword Search for Secure Cloud Storage
, 2017
"... ABSTRACT an inalienable instability called inside Brut force keyword guessing attack propelled by the pernicious server. To address this security defenselessness, we propose another PEKS system named double server PEKS (DS-PEKS). As another principle commitment, we characterize another variation of ..."
Abstract
- Add to MetaCart
(Show Context)
ABSTRACT an inalienable instability called inside Brut force keyword guessing attack propelled by the pernicious server. To address this security defenselessness, we propose another PEKS system named double server PEKS (DS-PEKS). As another principle commitment, we characterize another variation of the smooth projective hash capacities (SPHFs) alluded to as direct and homomorphic SPHF (LH-SPHF). We then demonstrate a bland development of secure DS-PEKS from LH-SPHF. To outline the plausibility of our new structure, we proposed system which makes system easy to handle and effective mechanism to handle complex task with better result with dual server public key encryption of the proposed scheme.
Generic Constructions of Secure-Channel Free Searchable Encryption with Adaptive Security
, 2013
"... ..."
Searchable Encryption：New Approaches for Private Set Intersection
"... Abstract: We introduce the technique of searchable encryption into the problem of secure two-party computation, and obtain novel approaches to accomplish Private Set Intersection (PSI). We present two protocols for PSI. The first one uses Baek’s Public Key Encryption with Multiple Keywords Search (M ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract: We introduce the technique of searchable encryption into the problem of secure two-party computation, and obtain novel approaches to accomplish Private Set Intersection (PSI). We present two protocols for PSI. The first one uses Baek’s Public Key Encryption with Multiple Keywords Search (MPEKS) as the basic tool, and the second one uses Gu’s Public Key Encryption with Keyword Search (PEKS) as the basic tool. Baek’s MPEKS supports multiple keywords search, but it requires expensive MapToPoint operations. Although the computation complexity of the MapToPoint operation can be reduced by new techniques, it indeed influences the efficiency. A natural method is to find a searchable encryption which requires no MapToPoint operations. So, we present the second protocol based on Gu’s PEKS. Gu’s PEKS does not support multiple keywords search, however, it still can help us to improve the efficiency of PSI significantly. We aim to achieve PSI in computationally asymmetric settings such as Cloud Computing, and both of our two protocols gain linear computation complexity for the client. We assume that m denotes the cardinality of the client’s input set. Concretely, in the protocol based on MPEKS, the client needs to compute m multiplications, m MapToPoint operations and one modular exponentiation; and in the protocol based on PEKS, the client only needs to compute m multiplications, m ordinary hashes, and one modular exponentiation to get the intersection. Both protocols satisfy privacy with respect to semi-honest behaviors.
