Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Secure Private Information Retrieval from Colluding Databases with Eavesdroppers
KTH, Skolan för elektroteknik och datavetenskap (EECS), Teknisk informationsvetenskap.ORCID-id: 0000-0001-9471-1409
KTH, Skolan för elektroteknik och datavetenskap (EECS), Teknisk informationsvetenskap.ORCID-id: 0000-0002-7926-5081
2018 (engelsk)Inngår i: 2018 IEEE International Symposium on Information Theory (ISIT), Institute of Electrical and Electronics Engineers (IEEE), 2018, s. 2456-2460Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
Institute of Electrical and Electronics Engineers (IEEE), 2018. s. 2456-2460
Serie
IEEE International Symposium on Information Theory - Proceedings, ISSN 2157-8095
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-234699DOI: 10.1109/ISIT.2018.8437848Scopus ID: 2-s2.0-85052432049ISBN: 9781538647806 (tryckt)OAI: oai:DiVA.org:kth-234699DiVA, id: diva2:1246734
Konferanse
2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 17 June 2018 through 22 June 2018
Merknad

QC 20180910

Tilgjengelig fra: 2018-09-10 Laget: 2018-09-10 Sist oppdatert: 2018-09-10bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Wang, QiwenSkoglund, Mikael

Søk i DiVA

Av forfatter/redaktør
Wang, QiwenSkoglund, Mikael
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 16 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf