Ensuring Data Storage Security against Frequency-Based Attacks in Wireless Networks

Liu, Hongbo; Wang, Hui; Chen, Yingying

doi:10.1007/978-3-642-13651-1_15

Cited by 19 publications

(9 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Despite its authors' warning of lingering unanswered questions, the OPE scheme from [8] immediately received attention from the applied community [21,20,18,17,14]. We agree that a secure OPE is better than no encryption at all and understand why the idea of its implementation may sound appealing.…”

Section: Introductionmentioning

confidence: 94%

Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions

Boldyreva

Chenette

O’Neill

2011

Lecture Notes in Computer Science

356

378

View full text Add to dashboard Cite

Abstract.We further the study of order-preserving symmetric encryption (OPE), a primitive for allowing efficient range queries on encrypted data, recently initiated (from a cryptographic perspective) by Boldyreva et al. (Eurocrypt '09). First, we address the open problem of characterizing what encryption via a random order-preserving function (ROPF) leaks about underlying data (ROPF being the "ideal object" in the security definition, POPF, satisfied by their scheme.) In particular, we show that, for a database of randomly distributed plaintexts and appropriate choice of parameters, ROPF encryption leaks neither the precise value of any plaintext nor the precise distance between any two of them. The analysis here is quite technically non-trivial and introduces useful new techniques. On the other hand, we also show that ROPF encryption does leak both the value of any plaintext as well as the distance between any two plaintexts to within a range of possibilities roughly the square root of the domain size. We then study schemes that are not order-preserving, but which nevertheless allow efficient range queries and achieve security notions stronger than POPF. In a setting where the entire database is known in advance of key-generation (considered in several prior works), we show that recent constructions of "monotone minimal perfect hash functions" allow to efficiently achieve (an adaptation of) the notion of IND-O(rdered) CPA also considered by Boldyreva et al., which asks that only the order relations among the plaintexts is leaked. Finally, we introduce modular order-preserving encryption (MOPE), in which the scheme of Boldyreva et al. is prepended with a shift cipher. MOPE improves the security of OPE in a sense, as it does not leak any information about plaintext location. We clarify that our work should not be interpreted as saying the original scheme of Boldyreva et al., or the variants that we introduce, are "secure" or "insecure." Rather, the goal of this line of research is to help practitioners decide whether the options provide a suitable security-functionality tradeoff for a given application.

show abstract

Section: Introductionmentioning

confidence: 94%

Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions

Boldyreva

Chenette

O’Neill

2011

Lecture Notes in Computer Science

356

378

View full text Add to dashboard Cite

show abstract

“…2. Frequency attack: Frequency attacks are still possible on the keyed masking approach (without knowing the secret key), where the frequency distribution of a set of masked values matches the distribution of known global values [40].…”

Section: Introductionmentioning

confidence: 99%

An Evaluation Framework for Privacy-Preserving Record Linkage

Vatsalan¹,

Christen

O'Keefe

et al. 2014

JPC

View full text Add to dashboard Cite

Privacy-preserving record linkage (PPRL) addresses the problem of identifying matching records from different databases that correspond to the same real-world entities using quasi-identifying attributes (in the absence of unique entity identifiers), while preserving privacy of these entities. Privacy is being preserved by not revealing any information that could be used to infer the actual values about the records that are not reconciled to the same entity (non-matches), and any confidential or sensitive information (that is not agreed upon by the data custodians) about the records that were reconciled to the same entity (matches) during or after the linkage process. The PPRL process often involves three main challenges, which are scalability to large databases, high linkage quality in the presence of data quality errors, and sufficient privacy guarantees. While many solutions have been developed for the PPRL problem over the past two decades, an evaluation and comparison framework of PPRL solutions with standard numerical measures defined for all three properties (scalability, linkage quality, and privacy) of PPRL has so far not been presented in the literature. We propose a general framework with normalized measures to practically evaluate and compare PPRL solutions in the face of linkage attack methods that are based on an external global dataset. We conducted experiments of several existing PPRL solutions on real-world databases using our proposed evaluation framework, and the results show that our framework provides an extensive and comparative evaluation of PPRL solutions in terms of the three properties.

show abstract

“…Dataflow obfuscation: all data (queries and tuples) exchanged between the querier and the TDSs, and between TDSs themselves, can be spied by SSI and must therefore be encrypted. However, an honest-but-curious SSI can try to conduct frequency-based attacks [Liu et al 2010], i.e., exploiting prior knowledge about the data distribution to infer the plaintext values of ciphertexts. Depending on the protocols (see later), two kinds of encryption schemes will be used to prevent frequency-based attacks.…”

Section: Core Infrastructurementioning

confidence: 99%

Private and Scalable Execution of SQL Aggregates on a Secure Decentralized Architecture

To¹,

Nguyen

Pelletier³

2016

ACM Trans. Database Syst.

View full text Add to dashboard Cite

Current applications, from complex sensor systems (e.g. quantified self) to online e-markets acquire vast quantities of personal information which usually end-up on central servers where they are exposed to prying eyes. Conversely, decentralized architectures helping individuals keep full control of their data, complexify global treatments and queries, impeding the development of innovative services. This paper precisely aims at reconciling individual's privacy on one side and global benefits for the community and business perspectives on the other side. It promotes the idea of pushing the security to secure hardware devices controlling the data at the place of their acquisition. Thanks to these tangible physical elements of trust, secure distributed querying protocols can reestablish the capacity to perform global computations, such as SQL aggregates, without revealing any sensitive information to central servers. This paper studies how to secure the execution of such queries in the presence of honest-but-curious and malicious attackers. It also discusses how the resulting querying protocols can be integrated in a concrete decentralized architecture. Cost models and experiments on SQL/AA, our distributed prototype running on real tamperresistant hardware, demonstrate that this approach can scale to nationwide applications.

show abstract

Ensuring Data Storage Security against Frequency-Based Attacks in Wireless Networks

Cited by 19 publications

References 13 publications

Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions

Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions

An Evaluation Framework for Privacy-Preserving Record Linkage

Private and Scalable Execution of SQL Aggregates on a Secure Decentralized Architecture

Contact Info

Product

Resources

About