Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Secure Private Information Retrieval from Colluding Databases with Eavesdroppers
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0001-9471-1409
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0002-7926-5081
2018 (English)In: 2018 IEEE International Symposium on Information Theory (ISIT), Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 2456-2460Conference paper, Published paper (Refereed)
Abstract [en]

The problem of private information retrieval (PIR) is to retrieve one message out of K messages replicated at N databases, without revealing the identity of the desired message to the databases. We consider the problem of PIR with colluding databases and eavesdroppers, named ETPIR. Specifically, any T out of N databases may collude, that is, they may communicate their interactions with the user to guess the identity of the requested message. An eavesdropper is curious to know the content of the messages and can tap in on the incoming and outgoing transmissions of any E databases with the user. The databases share some common randomness unknown to the eavesdropper and the user, and use the common randomness to generate the answers, such that the eavesdropper can learn no information about the K messages. The capacity is defined as the maximum retrieval rate, i.e. the number of information bits of the desired message retrieved per downloaded bit. In our previous work [1], we found that when Egeq T, the capacity equals 1-frac E N. In this work, we focus on the case when Eleq T. We find an outer bound (converse bound) and an inner bound (achievability) on the optimal achievable rate. The gap between the derived inner and outer bounds vanishes as the number of messages K tends to infinity.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018. p. 2456-2460
Series
IEEE International Symposium on Information Theory - Proceedings, ISSN 2157-8095
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-234699DOI: 10.1109/ISIT.2018.8437848ISI: 000448139300493Scopus ID: 2-s2.0-85052432049ISBN: 9781538647806 (print)OAI: oai:DiVA.org:kth-234699DiVA, id: diva2:1246734
Conference
2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 17 June 2018 through 22 June 2018
Note

QC 20180910

Available from: 2018-09-10 Created: 2018-09-10 Last updated: 2020-04-16Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Wang, QiwenSkoglund, Mikael

Search in DiVA

By author/editor
Wang, QiwenSkoglund, Mikael
By organisation
Information Science and Engineering
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 16 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf