Deterministic and Efficiently Searchable Encryption

Bellare, Mihir; Boldyreva, Alexandra; O’Neill, Adam

doi:10.1007/978-3-540-74143-5_30

Cited by 560 publications

(555 citation statements)

References 48 publications

Supporting

Mentioning

552

Contrasting

Unclassified

Order By: Relevance

“…Moreover, for public-key encryption (as cryptosystem C) and Chosen Distribution Attack [1,2] (as game S) we will prove that C(WRO) is S-secure, which implies the appropriateness of the new concept of the WRO model.…”

Section: Our Contributions -A New Proposal Of Wro Methodsology -mentioning

confidence: 86%

“…In the framework with which the MRH theorem is proven, two interfaces of a system F among adversaries and honest parities are considered, an "adversarial interface" accessed by adversaries, denoted by F.adv, and an "honest interface" accessed by honest parties, denoted by F.hon. The indifferentiable game of F 1 F 2 is a simulation based game where constructing some stateful simulator S which represents some adversary in the F 2 model which can obtain any information on F 1 .adv in the F 1 model by using information on F 2 .adv. The definition of F 1 F 2 is that there exists a stateful simulator S such that for any distinguisher D which interacts with two oracles (L, R), no D can distinguish a real world (L, R) = (F 1 .hon, F 2 .adv) from an ideal world (L, R) = (F 2 .hon, S F 2 .adv ) where S has access to F 2 .adv.…”

Section: Indifferentiabilitymentioning

confidence: 99%

“…Thus, the next step is to show that there exists a secure cryptosystem for a multi-stage game in the WRO model. We consider public-key encryption (PKE) (as cryptosystem C) for the Chosen Distribution Attack (CDA) game [1,2] (as game S). Roughly, we say a PKE scheme is CDA secure if message privacy is preserved even if an adversary can control distributions of messages and randomness in generating the challenge ciphertext.…”

Section: Appropriateness Of Wromentioning

confidence: 99%

“…Roughly, we say a PKE scheme is CDA secure if message privacy is preserved even if an adversary can control distributions of messages and randomness in generating the challenge ciphertext. The CDA game captures several flavors of PKE settings (e.g., deterministic PKE (DPKE) [1,3,8,14,18], hedged PKE (HPKE) [2], and message-locked PKE [4]), and such PKE settings are tools for many practical applications. Thus, our target is to find a CDA secure cryptosystem in the WRO model.…”

Section: Appropriateness Of Wromentioning

confidence: 99%

“…Thus, A cannot distinguish game G 1 and G 2 from the simulation on the interface of WRO. If β = 1 in IND-SIM game, it is clear that all interfaces for A is exactly same as game G 1 . If β = 0 in IND-SIM game, it is clear that all interfaces for A is exactly same as game G 2 .…”

mentioning

confidence: 99%

See 4 more Smart Citations

Reset Indifferentiability from Weakened Random Oracle Salvages One-Pass Hash Functions

Naito

Yoneyama

Ohta

2014

Applied Cryptography and Network Security

View full text Add to dashboard Cite

Abstract. Ristenpart et al. showed that the limitation of the indifferentiability theorem of Maurer et al. which does not cover all multi-stage security notions Sm but covers only single-stage security notions Ss, defined reset indifferentiability, and proved the reset indifferentiability theorem, which is an analogy of the indifferentiability theorem covers all security notions S (= Ss ∪ Sm): F1 r F2 ⇒ ∀C ∈ C, ∀S ∈ S: C(F1) ≻S C(F2) (if a hash function H U is reset indifferentiable from a random oracle RO, C ∈ C which is a set of all cryptosystems is at least as S-secure in the U model as in the RO model). Unfortunately, they also proved the impossibility of H U r RO where H is a one-pass hash construction such as ChopMD and Sponge.In this paper, we will propose a new proof of molular approach instead of the RO methodology, "Reset Indifferentiability from Weakened Random Oracle", called as the WRO methodology, in order to ensure the S-security of C with H U , salvaging ChopMD and Sponge. The concrete proof procedure of the WRO methodology is as follows:1. Define a new concept of WRO instead of RO, 2. Prove that H U r WRO, (here an example of H is ChopMD and Sponge), and 3. Prove that C is S-secure in the WRO model.As a result we can prove that C with H U is S-secure by combining the results of Steps 2, 3, and the theorem of Ristenpart et al. Moreover, for public-key encryption (as cryptosystem C) and chosendistribution attack (as the game of S ∈ Sm) we will prove that C(WRO) is S-secure, which implies the appropriateness of the new concept of the WRO model.

show abstract

Section: Our Contributions -A New Proposal Of Wro Methodsology -mentioning

confidence: 86%

Section: Indifferentiabilitymentioning

confidence: 99%

Section: Appropriateness Of Wromentioning

confidence: 99%

Section: Appropriateness Of Wromentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Reset Indifferentiability from Weakened Random Oracle Salvages One-Pass Hash Functions

Naito

Yoneyama

Ohta

2014

Applied Cryptography and Network Security

View full text Add to dashboard Cite

show abstract

Enabling efficient and secure data sharing in cloud computing

Liu

et al. 2013

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYWith the rapid development of cloud computing, more and more data are being centralized into remote cloud server for sharing, which raises a challenge on how to keep them both private and accessible. Although searchable encryption provides an efficient solution to support keyword‐based search directly on encrypted data, considering its application in file sharing, existing work depends on key sharing among authorized users, which inevitably causes the risks of key exposure and abuse. In this paper, aiming at enabling efficient and secure data sharing in cloud computing, we provide a generic construction for this purpose. The proposed construction is full‐featured: (i) It enables authorized users to perform keyword‐based search directly on encrypted data without sharing the unique secret key; and (ii) it provides two‐layered access control to limit unauthorized user's access to the shared data. On the basis of the proposed generic construction, we utilize the existing techniques on identity‐based broadcast encryption and public key searchable encryption to instantiate a concrete construction. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Searchable encryption: A survey on privacy‐preserving search schemes on encrypted outsourced data

Handa

Krishna

Aggarwal

2019

Concurrency and Computation

View full text Add to dashboard Cite

Outsourcing confidential data to cloud storage leads to privacy challenges that can be reduced using encryption. However, with encryption in place, the utilization of the data is reduced, which leads to reduced quality of experience of the users. To overcome this, searchable encryption (SE) schemes are utilized, which allow the end users to retrieve the relevant documents from the cloud, for which various researchers have worked utilizing different techniques. Despite the popularity of the searchable encryption schemes, most of the surveys either do not provide or present an incomplete taxonomy of SE schemes. Hence, in this paper, we attempt to present a complete taxonomy/classification of the searchable encryption schemes in terms of the type of search, type of index, results retrieved, implementation type, multiplicity of users, and the technique used. From the literature, it is observed that inner product similarity is widely adopted by researchers to compute the similarity of the query and the document index as it provides both conjunctive and disjunctive searching (ie, have better search capability) but requires high search time (ie, have lower search efficiency). On the other hand, schemes based on binary comparisons exist, which require less search time (ie, have better search efficiency) but support only conjunctive searching (ie, have limited search capability). Thus, a major conclusion drawn from our work is that there is an imbalance between search capability and search efficiency, ie, in the existing schemes, search capability can be improved at the cost of search time only. Therefore, we suggest that one direction where researchers should work on is to provide a balance between search capability and search efficiency.

show abstract

Deterministic and Efficiently Searchable Encryption

Cited by 560 publications

References 48 publications

Reset Indifferentiability from Weakened Random Oracle Salvages One-Pass Hash Functions

Reset Indifferentiability from Weakened Random Oracle Salvages One-Pass Hash Functions

Enabling efficient and secure data sharing in cloud computing

Searchable encryption: A survey on privacy‐preserving search schemes on encrypted outsourced data

Contact Info

Product

Resources

About