Efficient Private File Retrieval by Combining ORAM and PIR

Mayberry, Travis; Blaß, Erik-Oliver; Chan, Agnes Hui

doi:10.14722/ndss.2014.23033

Cited by 61 publications

(78 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Below, we briefly describe the original PIR protocol, and the protocols implemented by Mayberry et al [MBC13,MBC14]. In the following, assume a user want to recover a file among t files of bitsize s from a server.…”

Section: Applications To Pirmentioning

confidence: 99%

“…Due to its conceptual simplicity and computational efficiency, this scheme was used as a building block of other PIR protocols [BPMÖ12,MBC13,MBC14,EÖM14], and to a private spectrum availability information retrieval protocol [GZL + 13]. In particular, it was implemented in Java by Mayberry et al [MBC13,MBC14] to demonstrate the practicality of PIR in a "real world" setting.…”

Section: Introductionmentioning

confidence: 99%

“…Our attack is based on the notion of orthogonal lattice introduced by Nguyen and Stern at Crypto '97 [NS97], and it is very efficient: it amounts to applying LLL reduction twice on lattices of small dimension. We implemented it and carried out the attack on the parameters suggested in [TP10] as well as those used in existing implementations of the TP scheme [MBC13,MBC14]. Every time, it succeeded in a matter of seconds on a desktop computer.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cryptanalysis of a (Somewhat) Additively Homomorphic Encryption Scheme Used in PIR

Lepoint

Tibouchi²

2015

Financial Cryptography and Data Security

View full text Add to dashboard Cite

Abstract. Private Information Retrieval (PIR) protects users' privacy in outsourced storage applications and can be achieved using additively homomorphic encryption schemes. Several PIR schemes with a "real world" level of practicality, both in terms of computational and communication complexity, have been recently studied and implemented. One of the possible building block is a conceptually simple and computationally efficient protocol proposed by Trostle and Parrish at ISC 2010, that relies on an underlying secret-key (somewhat) additively homomorphic encryption scheme, and has been reused in numerous subsequent works in the PIR community (PETS 2012, FC 2013, NDSS 2014. In this paper, we show that this encryption scheme is not one-way: we present an attack that decrypts arbitrary ciphertext without the secret key, and is quite efficient: it amounts to applying the LLL algorithm twice on small matrices. Used against existing practical instantiations of PIR protocols, it allows the server to recover the users' access pattern in a matter of seconds.

show abstract

Section: Applications To Pirmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cryptanalysis of a (Somewhat) Additively Homomorphic Encryption Scheme Used in PIR

Lepoint

Tibouchi²

2015

Financial Cryptography and Data Security

View full text Add to dashboard Cite

show abstract

“…[3][4][5][6][7][8][9][10]12,14]. These ORAMs only have little state information, such as secret keys and query counters, stored in local storage.…”

Section: Related Workmentioning

confidence: 99%

“…With such a storage arrangement, it has been shown that the communication cost for data query and shuffling is as low as log N data blocks per query. Compared to other state-of-the-art ORAM constructions [10,17,20], P-ORAM achieves higher communication efficiency.…”

Section: Introductionmentioning

confidence: 99%

GP-ORAM: A Generalized Partition ORAM

Zhang

Qiao

2015

Network and System Security

View full text Add to dashboard Cite

Oblivious RAM (ORAM) is a provable technique to protect a user's access pattern to outsourced data. Recently, many ORAM constructions have been proposed, but most of them are impractical due to high communication and user-side storage costs. Motivated by Partition ORAM (P-ORAM) [16], a stateof-the-art communication-efficient ORAM construction, this paper proposes GPORAM (Generalized Partition ORAM) as a new framework to assemble multiple ORAM partitions together while overcoming the limitations of the P-ORAM construction. GP-ORAM allows smaller and adjustable number of partitions, fully utilizes the available user-side storage to reduce communication cost, and can efficiently export the index table to the server. As a result, GP-ORAM incurs low bandwidth cost (i.e., O(logN) data blocks per query in practice) and has significantly less user-side storage cost than P-ORAM.We demonstrate the security and practicality of GP-ORAM through extensive performance analysis. , a stateof-the-art communication-efficient ORAM construction, this paper proposes GP-ORAM (Generalized Partition ORAM) as a new framework to assemble multiple ORAM partitions together while overcoming the limitations of the P-ORAM construction. GP-ORAM allows smaller and adjustable number of partitions, fully utilizes the available user-side storage to reduce communication cost, and can efficiently export the index table to the server. As a result, GP-ORAM incurs low bandwidth cost (i.e., O(log N ) data blocks per query in practice) and has significantly less user-side storage cost than P-ORAM. We demonstrate the security and practicality of GP-ORAM through extensive performance analysis.

show abstract

Survey on secure search over encrypted data on the cloud

Pham

Woodworth

Salehi

2019

Concurrency and Computation

View full text Add to dashboard Cite

Cloud computing has become a potential resource for businesses and individuals to outsource their data to remote but highly accessible servers. However, the potential of cloud services has not been fully realized due to users concerns about data privacy and security. User-side encryption techniques can be employed to mitigate the security concerns, but once the data is encrypted, no processing (eg, searching) can be performed on the outsourced data. Searchable Encryption (SE) techniques have been widely studied to enable searching on the data while they are encrypted. These techniques enable various types of search on the encrypted data and offer different levels of security. While these techniques enable different search types and vary in details, they share similarities in their components and architectures. In this paper, we provide a comprehensive survey on different secure search techniques, a high-level architecture for these systems, and an analysis of their performance and security level. KEYWORDScloud security, encrypted search, search over encrypted data, survey INTRODUCTIONAs cloud computing becomes prevalent, more cloud-based solutions are being developed and widely used in different applications. Companies that have adopted cloud storage solutions are reported to gain a competitive edge against those that have not. 1Cloud computing is favored due to its many advantages, including convenience and accessibility, consistent back ups to reducing the burden of local storage, and saving capital expenditure on in-house hardware and software maintenance. 2 However, public cloud storage services may be utilized by multi-tenant customers who store large amounts of potentially sensitive data on the cloud. Using cloud storage implies losing full control over data and delegating it to the cloud administrators, exposing the data to potential external and internal attacks, 3,4 which can be devastating for organizations that rely on confidentiality of their data (eg, financial corporations).These problems have made businesses concerned about outsourcing their data to the cloud and utilizing its potential. 5,6 For instance, a medical center that owns patients' health records cannot outsource its data to a cloud that is vulnerable to attacks, due to legal regulations. 7 In another instance, a law enforcement agency that keeps sensitive criminal records will hesitate to use cloud storage because of similar concerns.this approach remains impractical. Therefore, searchable encryption systems (eg, see other works 12-15 ) have been introduced to cope with this problem. These systems ideally allow the encrypted data to be searched without revealing the data and search query. Hence, they relieve concerns about data confidentiality in the cloud. Efforts to create searchable encryption systems date back to 2000 with work by Song et al. 11 Since then, numerous research works have been undertaken to enable different types of searchable encryption. Although these systems differ in their search approaches, security level, and perf...

show abstract

Efficient Private File Retrieval by Combining ORAM and PIR

Cited by 61 publications

References 11 publications

Cryptanalysis of a (Somewhat) Additively Homomorphic Encryption Scheme Used in PIR

Cryptanalysis of a (Somewhat) Additively Homomorphic Encryption Scheme Used in PIR

GP-ORAM: A Generalized Partition ORAM

Survey on secure search over encrypted data on the cloud

Contact Info

Product

Resources

About