Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Symmetric Private Information Retrieval with Mismatched Coded Messages and Randomness
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0001-9471-1409
Univ North Texas, Dept Elect Engn, Denton, TX 76203 USA..
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0002-7926-5081
2019 (English)In: Proceedings 2019 IEEE International Symposium on Information Theory (ISIT), IEEE , 2019, p. 365-369Conference paper, Published paper (Refereed)
Abstract [en]

The capacity of symmetric private information retrieval (PIR) with N servers and K messages, each coded by an (N, M)-MDS code has been characterized as CMDS-SPIR = 1- M/N. A critical assumption for this result is that the randomness is similarly coded by an (N, M)-MDS code, i.e., the code parameters of the messages and randomness are matched. In this work, we are interested in the mismatched case, and as a preliminary result, we establish the capacity of the mismatched MDS coded symmetric PIR (SPIR) problem under an extreme setting, where the messages are coded by an (N, M)-MDS code and the randomness is replicated (i.e., coded by an (N, 1)-MDS code). The capacity is shown to be Cmis-MDS-SPIR = (1 - 1/N). (1 + M-1/N (1+ M/N + . . . (M/N)(K-2)))(-1). Interestingly, Cmis-MDS-SPIR > CMDS-SPIR, so mismatched coded randomness (with more redundancy) is strictly beneficial. Further, mismatched SPIR exhibits properties that are similar to PIR.

Place, publisher, year, edition, pages
IEEE , 2019. p. 365-369
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:kth:diva-263391DOI: 10.1109/ISIT.2019.8849351ISI: 000489100300074Scopus ID: 2-s2.0-85073149495ISBN: 9781538692912 (print)OAI: oai:DiVA.org:kth-263391DiVA, id: diva2:1370155
Conference
IEEE International Symposium on Information Theory (ISIT), Paris, FRANCE, JUL 07-12, 2019
Note

QC 20191114

Available from: 2019-11-14 Created: 2019-11-14 Last updated: 2019-11-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopusConference websiteConference proceedings

Authority records BETA

Wang, QiwenSkoglund, Mikael

Search in DiVA

By author/editor
Wang, QiwenSkoglund, Mikael
By organisation
Information Science and Engineering
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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