scholarly journals A Leakage-Abuse Attack Against Multi-User Searchable Encryption

2017 ◽  
Vol 2017 (3) ◽  
pp. 168-178 ◽  
Author(s):  
Cédric Van Rompay ◽  
Refik Molva ◽  
Melek Önen

Abstract Searchable Encryption (SE) allows a user to upload data to the cloud and to search it in a remote fashion while preserving the privacy of both the data and the queries. Recent research results describe attacks on SE schemes using the access pattern, denoting the ids of documents matching search queries, which most SE schemes reveal during query processing. However SE schemes usually leak more than just the access pattern, and this extra leakage can lead to attacks (much) more harmful than the ones using basic access pattern leakage only. We remark that in the special case of Multi-User Searchable Encryption (MUSE), where many users upload and search data in a cloud-based infrastructure, a large number of existing solutions have a common leakage in addition to the well-studied access pattern leakage. We show that this seemingly small extra leakage allows a very simple yet powerful attack, and that the privacy degree of the affected schemes have been overestimated. We also show that this new vulnerability affects existing software. Finally we formalize the newly identified leakage profile and show how it relates to previously defined ones.

2019 ◽  
Vol 2019 (4) ◽  
pp. 132-151 ◽  
Author(s):  
Raphael Bost ◽  
Pierre-Alain Fouque

Abstract Besides their security, the efficiency of searchable encryption schemes is a major criteria when it comes to their adoption: in order to replace an unencrypted database by a more secure construction, it must scale to the systems which rely on it. Unfortunately, the relationship between the efficiency and the security of searchable encryption has not been widely studied, and the minimum cost of some crucial security properties is still unclear. In this paper, we present new lower bounds on the trade-offs between the size of the client state, the efficiency and the security for searchable encryption schemes. These lower bounds target two kinds of schemes: schemes hiding the repetition of search queries, and forward-private dynamic schemes, for which updates are oblivious. We also show that these lower bounds are tight, by either constructing schemes matching them, or by showing that even a small increase in the amount of leaked information allows for constructing schemes breaking the lower bounds.


2012 ◽  
Vol 532-533 ◽  
pp. 897-901
Author(s):  
Ming Jun Wei ◽  
Li Chun Xia ◽  
Jian Guo Jin ◽  
Qiu Hong Fan

This paper firstly analyzes the importance and necessity of location dependent query in the mobile computing. Then, it proposes a special case in the application of the location dependent query. That is as follows: Inquirers may send the same location dependent query in different but similar positions. However, the server will not deal with them together but treat them separately. Thus, it will not only cause the waste of system resources but also delay disposal of other queries. According to the principal of clustering we propose a new location Analysis Algorithms-similar merging location analysis algorithm (SMLA). By the algorithm, similar queries can be combined into the same query, so as to reduce the load on central servers, improve system efficiency and query processing performance.


Author(s):  
S. A. Vlasova

The article describes the automated system for creating and maintaining a database of scientific works of academic institution’s employees, developed by specialists of the Joint Supercomputer Center RAS. The system’s information base contains data about objects: the authors, related organizations (places of their work), publications at the analytical and monographic levels, sources (publications at the summary level — journals, collections), reports made at scientific conferences, symposia, seminars. The system has an administrative module designed to enter and edit data. The user’s module of the system is a special search engine that searches for information about publications, sources, reports, events, authors by processing search queries. A distinctive feature of the system is the introduced concept of «equivalent» objects. Such objects are «persons» corresponding to the same author with different spellings of the last name in the bibliographic descriptions of publications; organizations with different versions of names; articles which are published without changes in different languages.


BMJ Open ◽  
2018 ◽  
Vol 8 (10) ◽  
pp. e018335 ◽  
Author(s):  
Qingpeng Zhang ◽  
Yi Chai ◽  
Xiaoming Li ◽  
Sean D Young ◽  
Jiaqi Zhou

ObjectivesInternet data are important sources of abundant information regarding HIV epidemics and risk factors. A number of case studies found an association between internet searches and outbreaks of infectious diseases, including HIV. In this research, we examined the feasibility of using search query data to predict the number of new HIV diagnoses in China.DesignWe identified a set of search queries that are associated with new HIV diagnoses in China. We developed statistical models (negative binomial generalised linear model and its Bayesian variants) to estimate the number of new HIV diagnoses by using data of search queries (Baidu) and official statistics (for the entire country and for Guangdong province) for 7 years (2010 to 2016).ResultsSearch query data were positively associated with the number of new HIV diagnoses in China and in Guangdong province. Experiments demonstrated that incorporating search query data could improve the prediction performance in nowcasting and forecasting tasks.ConclusionsBaidu data can be used to predict the number of new HIV diagnoses in China up to the province level. This study demonstrates the feasibility of using search query data to predict new HIV diagnoses. Results could potentially facilitate timely evidence-based decision making and complement conventional programmes for HIV prevention.


2018 ◽  
Author(s):  
Natalia Adler ◽  
Ciro Cattuto ◽  
Kyriaki Kalimeri ◽  
Daniela Paolotti ◽  
Michele Tizzoni ◽  
...  

BACKGROUND India is home to 20% of the world’s suicide deaths. Although statistics regarding suicide in India are distressingly high, data and cultural issues likely contribute to a widespread underreporting of the problem. Social stigma and only recent decriminalization of suicide are among the factors hampering official agencies’ collection and reporting of suicide rates. OBJECTIVE As the product of a data collaborative, this paper leverages private-sector search engine data toward gaining a fuller, more accurate picture of the suicide issue among young people in India. By combining official statistics on suicide with data generated through search queries, this paper seeks to: add an additional layer of information to more accurately represent the magnitude of the problem, determine whether search query data can serve as an effective proxy for factors contributing to suicide that are not represented in traditional datasets, and consider how data collaboratives built on search query data could inform future suicide prevention efforts in India and beyond. METHODS We combined official statistics on demographic information with data generated through search queries from Bing to gain insight into suicide rates per state in India as reported by the National Crimes Record Bureau of India. We extracted English language queries on “suicide,” “depression,” “hanging,” “pesticide,” and “poison”. We also collected data on demographic information at the state level in India, including urbanization, growth rate, sex ratio, internet penetration, and population. We modeled the suicide rate per state as a function of the queries on each of the 5 topics considered as linear independent variables. A second model was built by integrating the demographic information as additional linear independent variables. RESULTS Results of the first model fit (R2) when modeling the suicide rates from the fraction of queries in each of the 5 topics, as well as the fraction of all suicide methods, show a correlation of about 0.5. This increases significantly with the removal of 3 outliers and improves slightly when 5 outliers are removed. Results for the second model fit using both query and demographic data show that for all categories, if no outliers are removed, demographic data can model suicide rates better than query data. However, when 3 outliers are removed, query data about pesticides or poisons improves the model over using demographic data. CONCLUSIONS In this work, we used search data and demographics to model suicide rates. In this way, search data serve as a proxy for unmeasured (hidden) factors corresponding to suicide rates. Moreover, our procedure for outlier rejection serves to single out states where the suicide rates have substantially different correlations with demographic factors and query rates.


2019 ◽  
Vol 5 (3) ◽  
pp. 286-313 ◽  
Author(s):  
Shawn F. Dorius ◽  
Jeffrey Swindle

Scholarship on developmental idealism demonstrates that ordinary people around the world tend to perceive the level of development and the specific characteristics of different countries similarly. We build on this literature by examining public perceptions of nations and development in internet search data, which we argue offers insights into public perceptions that survey data do not address. Our analysis finds that developmental idealism is prevalent in international internet search queries about countries. A consistent mental image of national development emerges from the traits publics ascribe to countries in their queries. We find a positive relationship between the sentiment expressed in autocomplete Google search queries about a given country and its position in the global developmental hierarchy. People in diverse places consistently associate positive attributes with countries ranked high on global development indices and negative characteristics with countries ranked low. We also find a positive correlation between the number of search queries about a country and the country's position in indices of global development. These findings illustrate that ordinary people have deeply internalized developmental idealism and that this informs their views about countries worldwide.


Author(s):  
Anna Caroline Pilz ◽  
Linda Tizek ◽  
Melvin Rüth ◽  
Peter Seiringer ◽  
Tilo Biedermann ◽  
...  

Incidence of sexually transmitted infections (STIs) such as chlamydia, gonorrhea, and syphilis has increased in recent years in the US and in European countries. In order to implement effective educational programs, the interests of target populations have to be identified. Since the internet is an important source of information-gathering on health issues, this study investigates web search data in large German cities related to STIs. Google Ads Keyword Planner was used to identify STI-related terms and their search volume in eleven German cities from June 2015 to May 2019. The data obtained were analyzed descriptively with regard to total search volumes, search volumes of specific thematic areas, and search volumes per 100,000 inhabitants. Overall, 741 terms with a total search volume of 5,142,560 queries were identified, with more than 70% of all search queries including a specific disease and “chlamydia” being the overall most often searched term (n = 1,196,160). Time courses of search behavior displayed a continuous interest in STIs with synchronal and national rather than regional peaks. Volumes of search queries lacked periodic patterns. Based on the findings of this study, a more open public discussion about STIs with linkage to increased media coverage and clarification of responsibilities among all STI-treating disciplines concerning management of STIs seem advisable.


2021 ◽  
Author(s):  
Fateh Boucenna ◽  
Omar Nouali ◽  
Kamel Adi ◽  
Samir Kechid

2020 ◽  
Author(s):  
Gaoli Wang ◽  
Zhenfu Cao ◽  
Xiaolei Dong

Abstract Searchable encryption (SE) allows the cloud server to search over the encrypted data and leak information as little as possible. Most existing efficient SE schemes assume that the leakage of search pattern and access pattern is acceptable. A series of work was proposed, instructing malicious users to use this leakage to come up with attacks. Especially, with a devastating attack proposed by Zhang et al., the cloud server can reveal the keywords queried by normal users by using some injected files. From the method of constructing uniform $(k,n)$-set of a finite set $A$ proposed by Cao, we put forward a new file-injection attack. In our attack, the server needs fewer injected files than the previous attack when the size of $T$ is larger than 9 and the size of keyword set is larger than $2T$, where $T$ is the threshold of the number of keywords in each injected file. Our attack is more practical and easier to implement in the real scenario.


Sign in / Sign up

Export Citation Format

Share Document