2,705 Hits in 3.2 sec

Multi-query Computationally-Private Information Retrieval with Constant Communication Rate [chapter]

Jens Groth, Aggelos Kiayias, Helger Lipmaa
2010 Lecture Notes in Computer Science  
We give an information-theoretic lower bound on the communication of any multi-query information retrieval protocol.  ...  This problem has been extensively studied and is known as computationally private information retrieval (CPIR).  ...  Introduction A (single-server) computationally-private information retrieval (CPIR) protocol enables a client to query a database without revealing which data it is extracting.  ... 
doi:10.1007/978-3-642-13013-7_7 fatcat:74bptsnje5fr3djzr7suengkwi

Toward efficient, privacy-aware media classification on public databases

Giulia Fanti, Matthieu Finiasz, Gerald Friedland, Kannan Ramchandran
2014 Proceedings of International Conference on Multimedia Retrieval - ICMR '14  
At the same time, uploading media for queries-especially media that contains sensitive content-means sharing private information with a potentially untrusted service provider.  ...  Within this scope of private searches, private media classification and retrieval is particularly challenging due to the inherent inexactness of recognition; to be useful, image or other media classification  ...  Private Information Retrieval Private Information Retrieval (PIR) allows a client to retrieve data at a particular index in a database without revealing the query (or the results) to the server.  ... 
doi:10.1145/2578726.2578733 dblp:conf/mir/FantiFFR14 fatcat:bk3bbr25bja2vn6og55nd2p73e

Towards Efficient Information-Theoretic Function Secret Sharing

Wen Ming Li, Liang Feng Zhang
2020 IEEE Access  
RELATED WORK Function secret sharing has close connections with private information retrieval (PIR) [11] .  ...  In this paper, we study information-theoretically secure (t, r)-FSS (called (t, r)-itFSS) and propose a generic transformation from information-theoretic private information retrieval (PIR) schemes to  ...  [9] and private information retrieval [11] .  ... 
doi:10.1109/access.2020.2971722 fatcat:yats6qxeurhhzcclbeebflk3ra

Revisiting the Computational Practicality of Private Information Retrieval [chapter]

Femi Olumofin, Ian Goldberg
2012 Lecture Notes in Computer Science  
However, keeping the search terms private or confidential without undermining the server's ability to retrieve the desired information is a problem that private information retrieval (PIR) schemes are  ...  While often cited as evidence that PIR is impractical, that paper did not examine multi-server information-theoretic PIR schemes or recent single-server lattice-based PIR schemes.  ...  Private information retrieval (PIR) provides a means of retrieval that guarantees access privacy, by preventing the database administrator from being able to learn any information about which particular  ... 
doi:10.1007/978-3-642-27576-0_13 fatcat:b6n5u7ucingz5mkr7nhpygmn4q

Privacy-Preserving Ranked Search on Public-Key Encrypted Data

Sahin Buyrukbilen, Spiridon Bakiras
2013 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing  
Our solution employs a simple indexing structure, and leverages homomorphic encryption and private information retrieval (PIR) protocols to process queries in a privacy-preserving manner.  ...  Using measurements from Amazon's Elastic Compute Cloud, we show that our method provides reasonable response times with low communication cost.  ...  Private Information Retrieval Private information retrieval (PIR) was first introduced by Chor et al. [24] , and is formally defined as follows.  ... 
doi:10.1109/hpcc.and.euc.2013.33 dblp:conf/hpcc/BuyrukbilenB13 fatcat:wp3v4fykvneunjg5ga2to6odru

Single-Database Private Information Retrieval with Constant Communication Rate [chapter]

Craig Gentry, Zulfikar Ramzan
2005 Lecture Notes in Computer Science  
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k + d), where k ≥ log n is a security parameter that depends on the database size n and d is the  ...  For large blocks, our scheme achieves a constant "rate" (e.g., 0.2), even when the user-side communication is very low (e.g., two 1024-bit numbers).  ...  This means that, for a constant k ≥ 2 of servers, the above information-theoretic PIR scheme can be converted into a PBR scheme with an asymptotically constant "rate" of 1/k -i.e., the ratio of bits retrieved  ... 
doi:10.1007/11523468_65 fatcat:mctew27xlbb2zea76zkebvmc5q


Danniel Demmler, Amir Herzberg, Thomas Schneider
2014 Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security - CCSW '14  
Private Information Retrieval (PIR) allows to privately request a block of data from a database such that no information about the queried block is revealed to the database owner.  ...  With the rapid rise of cloud computing, data is often shared across multiple servers, making multi-server PIR a promising privacy-enhancing technology.  ...  We also thank the authors of [Cap13] for making their implementation publicly available and the authors of [GDL + 14] for sharing their code with us.  ... 
doi:10.1145/2664168.2664181 dblp:conf/ccs/DemmlerH014 fatcat:italh3nl2vfshiwcmxixdk2nki

Multi-dimensional Range Query on Outsourced Database with Strong Privacy Guarantee

Do Hoang Giang, Ng Wee Keong
2017 International Journal of Computer Network and Information Security  
A naive question is whether the client still has the capability to query and obtain useful information when the data are encrypted and stored remotely.  ...  Our solution combines cryptographic techniques with the bucketization approach.  ...  When the record indices are known to the client, a constant number of communication rounds of ORAM data access should be required to retrieve the data.  ... 
doi:10.5815/ijcnis.2017.10.02 fatcat:ni37ysodvrcpxofeawexjug2va

Asymmetric Leaky Private Information Retrieval [article]

Islam Samy, Mohamed A. Attia, Ravi Tandon, Loukas Lazos
2020 arXiv   pre-print
Information-theoretic formulations of the private information retrieval (PIR) problem have been investigated under a variety of scenarios.  ...  Symmetric private information retrieval (SPIR) is a variant where a user is able to privately retrieve one out of K messages from N non-colluding replicated databases without learning anything about the  ...  information privately by executing a private information retrieval (PIR) protocol.  ... 
arXiv:2006.03048v1 fatcat:xnzxx4oehfap3pn5fs3alkjki4

Tunably-Oblivious Memory

Jonathan Dautrich, Chinya Ravishankar
2015 Proceedings of the 5th ACM Conference on Data and Application Security and Privacy - CODASPY '15  
We also propose a read-only SBT variant called Multi-SBT that can satisfy such queries with only O(ℓ + log N ) block transfers in the best case, and only O(ℓ log N ) transfers in the worst case, while  ...  leaking only O(log log log N ) bits of information per query.  ...  Private Information Retrieval (PIR) techniques also support secure data outsourcing with full access pattern indistinguishability.  ... 
doi:10.1145/2699026.2699097 dblp:conf/codaspy/DautrichR15a fatcat:zoi5xcrpcvaupcposbg5s6vghy

Privacy preserving substring search protocol with polylogarithmic communication cost

Nicholas Mainardi, Alessandro Barenghi, Gerardo Pelosi
2019 Proceedings of the 35th Annual Computer Security Applications Conference on - ACSAC '19  
We present a privacy-preserving substring search protocol exhibiting a sub-linear communication cost, with a limited computational effort on the server side.  ...  CCS CONCEPTS • Security and privacy → Privacy-preserving protocols; Management and querying of encrypted data; Security protocols.  ...  cryptographic primitives such as Oblivious RAMs (ORAMs) [27] or Private Information Retrieval (PIR) protocols [19] .  ... 
doi:10.1145/3359789.3359842 dblp:conf/acsac/MainardiBP19 fatcat:qwvfrxp7pbehrk4puili4roep4

A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers [chapter]

Daniel Augot, Françoise Levy-dit-Vehel, Abdullatif Shikfa
2014 Lecture Notes in Computer Science  
Since the concept of locally decodable codes was introduced by Katz and Trevisan in 2000, it is well-known that information the-oretically secure private information retrieval schemes can be built using  ...  We here deal with information theoretic PIR, as opposed to computationally secure PIR [13] .  ...  Introduction Private information retrieval allows a user to privately retrieve a record of a database, in the sense that the database server does not know which record the user is asking for.  ... 
doi:10.1007/978-3-319-12280-9_15 fatcat:a7i3o4woevboximsj7xxknf5um

Building castles out of mud

Peter Williams, Radu Sion, Bogdan Carbunar
2008 Proceedings of the 15th ACM conference on Computer and communications security - CCS '08  
We built a first practical system -orders of magnitude faster than existing implementations -that can execute over several queries per second on 1Tbyte+ databases with full computational privacy and correctness  ...  A storage client can deploy this mechanism to issue encrypted reads, writes, and inserts to a potentially curious and malicious storage service provider, without revealing information or access patterns  ...  Private Information Retrieval (PIR) [8] protocols aim to allow (arbitrary, multiple) clients to retrieve information from public or private databases, without revealing to the database servers which  ... 
doi:10.1145/1455770.1455790 dblp:conf/ccs/WilliamsSC08 fatcat:57quqjkmwraohoh3akueil32ae

Authenticating Privately over Public Wi-Fi Hotspots

Aldo Cassola, Erik-Oliver Blass, Guevara Noubir
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
Our protocol is based on Private Information Retrieval (PIR) with an augmented cheating detection mechanism based on our extensions to the NTRU encryption scheme.  ...  The somewhat-homomorphic encryption makes auditing of multiple rows in a single query possible, and optimizes PIR for highly parallel GPU computations with the use of the Fast Fourier Transform (FFT).  ...  Rekeying When the K expires, a new PRIVATE INFORMATION RETRIEVAL The Query and Response functions used in Algorithm 1 rely on Private Information Retrieval primitives.  ... 
doi:10.1145/2810103.2813647 dblp:conf/ccs/CassolaBN15 fatcat:o7sczhletvd53arl3dqwozda2i

Strong location privacy: A case study on shortest path queries

K. Mouratidis
2013 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)  
In this paper, we focus on shortest path queries, describe a framework based on private information retrieval (PIR), and conclude with open questions about the practicality of PIR and other location privacy  ...  For example, exposing to a (potentially untrusted) LBS the client's position may reveal personal information, such as social habits, health condition, shopping preferences, lifestyle choices, etc.  ...  The second class of methods relies on private information retrieval (PIR) [2] .  ... 
doi:10.1109/icdew.2013.6547441 dblp:conf/icde/Mouratidis13 fatcat:thzmzpguonco5c5kjojmzmh7jy
« Previous Showing results 1 — 15 out of 2,705 results