Searchable Encryption over Feature-Rich Data

Wang, Qian; He, Meiqi; Du, Minxin; Chow, Sherman S. M.; Lai, Russell W. F.; Zou, Qin

doi:10.1109/tdsc.2016.2593444

Cited by 124 publications

(35 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, a practical SSE has to allow some information leakage in exchange for acceptable efficiency. Unfortunately, these leakages have been abused to attack SSE schemes in different ways [14,15,29,38,39]. In 2016, Zhang et al [16] proposed the file-injection attack.…”

Section: The Need For Forward Privacymentioning

confidence: 99%

Searchable Symmetric Encryption with Forward Search Privacy

Huang

et al. 2021

IEEE Trans. Dependable and Secure Comput.

149

View full text Add to dashboard Cite

Searchable symmetric encryption (SSE) has been widely applied in the encrypted database for queries in practice. Although SSE is powerful and feature-rich, it is always plagued by information leaks. Some recent attacks point out that forward privacy which disallows leakage from update operations, now becomes a basic requirement for any newly designed SSE schemes. However, the subsequent search operations can still leak a significant amount of information. To further strengthen security, we extend the definition of forward privacy and propose the notion of "forward search privacy". Intuitively, it requires search operations over newly added documents do not leak any information about past queries. The enhanced security notion poses new challenges to the design of SSE. We address the challenges by developing the hidden pointer technique (HPT) and propose a new SSE scheme called Khons, which satisfies our security notion (with the original forward privacy notion) and is also efficient. We implemented Khons and our experiment results on large dataset (wikipedia) show that it is more efficient than existing SSE schemes with forward privacy.

show abstract

Section: The Need For Forward Privacymentioning

confidence: 99%

Searchable Symmetric Encryption with Forward Search Privacy

Huang

et al. 2021

IEEE Trans. Dependable and Secure Comput.

149

View full text Add to dashboard Cite

show abstract

“…In [106], a privacy-preserving biometrics-based authentication solution is proposed to authenticate the users to remote service providers via zero-knowledge proof of knowledge on two secrets: an identity token encoding the biometric identifier of the user's image and a secret owned by the user. In [107], a searchable symmetric encryption over encrypted multimedia data is proposed by considering the search criteria as a high-dimensional feature vector, which is further mapped by locality sensitive hashing. The inverted file identifier vectors are encrypted by an additive homomorphic encryption or pseudo-random position permutations.…”

Section: Generating Cipher-images In Other Application Scenariosmentioning

confidence: 99%

When an attacker meets a cipher-image in 2018: A year in review

Zhang

Xie

2019

Journal of Information Security and Applications

143

121

View full text Add to dashboard Cite

This paper aims to review the encountered technical contradictions when an attacker meets the cipher-images encrypted by the image encryption schemes (algorithms) proposed in 2018 from the viewpoint of an image cryptanalyst. The most representative works among them are selected and classified according to their essential structures. Almost all image cryptanalysis works published in 2018 are surveyed due to their small number. The challenging problems on design and analysis of image encryption schemes are summarized to receive the attentions of both designers and attackers (cryptanalysts) of image encryption schemes, which may promote solving scenario-oriented image security problems with new technologies.

show abstract

“…Kloumann et al [24] analyzed the temporal and social profiles in app usage prediction problem. These methods of predicting mobile application usage, based on data collected from telephone handsets, are extremely valuable for predicting the way in which an app is used [25][26][27][28][29].…”

Section: Related Workmentioning

confidence: 99%

Exploring the Evolution of New Mobile Services

Chen

Yao

Jin

et al. 2017

Scientific Programming

View full text Add to dashboard Cite

The emergence and widespread use of mobile Internet technology has led to many different kinds of new mobile communications services, such as WeChat. Users could have more choices when attempting to satisfy their communications needs. The ability to predict the way in which users will use new mobile communications services is extremely valuable to mobile communications service providers. In this work, we propose a method for predicting how a user will use a new mobile service. Our scheme is inspired by the evolutionary game theory. With large-scale real world datasets collected from mobile service providers, we first extract the benefit-related features for users who were starting to use a new mobile service. Then we design our training and prediction methods for predicting potential users. We evaluate our scheme using experiments with large-scale real data. The results show that our approach can predict users' future behavior with satisfying accuracy.

show abstract

Searchable Encryption over Feature-Rich Data

Cited by 124 publications

References 27 publications

Searchable Symmetric Encryption with Forward Search Privacy

Searchable Symmetric Encryption with Forward Search Privacy

When an attacker meets a cipher-image in 2018: A year in review

Exploring the Evolution of New Mobile Services

Contact Info

Product

Resources

About