Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers

Razane Tajeddine; Oliver Gnilke; David Karpuk; Ragnar Freij-Hollanti; Camilla Hollanti

doi:10.1109/TIT.2018.2890285

Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers

Razane Tajeddine, Oliver Gnilke, David Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti

Tutkimustuotos: Lehtiartikkeli › Article › Scientific › vertaisarvioitu

63 Sitaatiot (Scopus)

221 Lataukset (Pure)

Abstrakti

The problem of private information retrieval (PIR) from coded storage systems with colluding, Byzantine, and unresponsive servers is considered. An explicit scheme using an [n,k] Reed-Solomon storage code is designed, protecting against t-collusion, and handling up to b Byzantine and r unresponsive servers, when n>k+t+2b+r-1. This scheme achieves a PIR rate of ((n-r-(k+2b+t-1))/n-r). In the case where the capacity is known, namely, when k=1, it is asymptotically capacity achieving as the number of files grows. Finally, the scheme is adapted to symmetric PIR.

Alkuperäiskieli	Englanti
Artikkeli	8598994
Sivut	3898-3906
Sivumäärä	9
Julkaisu	IEEE Transactions on Information Theory
Vuosikerta	65
Numero	6
Varhainen verkossa julkaisun päivämäärä	2019
DOI - pysyväislinkit	https://doi.org/10.1109/TIT.2018.2890285
Tila	Julkaistu - 1 kesäk. 2019
OKM-julkaisutyyppi	A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Pääsy asiakirjaan

10.1109/TIT.2018.2890285

SCI_Tajeddine_et_al_Private_Information_Byzantine_Journal_paper_Final_teo_colsAccepted author manuscript, 247 KB

Muut tiedostot ja linkit

Link to publication in Scopus

Lukuteoreettisia ja kombinatorisia työkaluja yksityisiin ja turvallisiin pilvipalveluihin
Hollanti, C. (Vastuullinen tutkija)
01/07/2016 → 30/06/2018
Projekti: Academy of Finland: Other research funding
Sovellettu algebra ja lukuteoria kestävien ja turvallisten langattomien pilvitallennussysteemien suunnittelussa
Hollanti, C. (Vastuullinen tutkija)
01/09/2014 → 31/08/2018
Projekti: Academy of Finland: Other research funding
Sovellettu algebra tietoliikenneteknologiassa
Hollanti, C. (Vastuullinen tutkija)
01/09/2014 → 31/08/2019
Projekti: Academy of Finland: Other research funding

Siteeraa tätä

@article{dc09391ef0864838b4b56f2286d18b78,

title = "Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers",

abstract = "The problem of private information retrieval (PIR) from coded storage systems with colluding, Byzantine, and unresponsive servers is considered. An explicit scheme using an [n,k] Reed-Solomon storage code is designed, protecting against t-collusion, and handling up to b Byzantine and r unresponsive servers, when n>k+t+2b+r-1. This scheme achieves a PIR rate of ((n-r-(k+2b+t-1))/n-r). In the case where the capacity is known, namely, when k=1, it is asymptotically capacity achieving as the number of files grows. Finally, the scheme is adapted to symmetric PIR.",

keywords = "Byzantine, information retrieval, Privacy, Reed-Solomon codes, reliability, robustness, servers",

author = "Razane Tajeddine and Oliver Gnilke and David Karpuk and Ragnar Freij-Hollanti and Camilla Hollanti",

year = "2019",

month = jun,

day = "1",

doi = "10.1109/TIT.2018.2890285",

language = "English",

volume = "65",

pages = "3898--3906",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE",

number = "6",

}

TY - JOUR

T1 - Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers

AU - Tajeddine, Razane

AU - Gnilke, Oliver

AU - Karpuk, David

AU - Freij-Hollanti, Ragnar

AU - Hollanti, Camilla

PY - 2019/6/1

Y1 - 2019/6/1

N2 - The problem of private information retrieval (PIR) from coded storage systems with colluding, Byzantine, and unresponsive servers is considered. An explicit scheme using an [n,k] Reed-Solomon storage code is designed, protecting against t-collusion, and handling up to b Byzantine and r unresponsive servers, when n>k+t+2b+r-1. This scheme achieves a PIR rate of ((n-r-(k+2b+t-1))/n-r). In the case where the capacity is known, namely, when k=1, it is asymptotically capacity achieving as the number of files grows. Finally, the scheme is adapted to symmetric PIR.

AB - The problem of private information retrieval (PIR) from coded storage systems with colluding, Byzantine, and unresponsive servers is considered. An explicit scheme using an [n,k] Reed-Solomon storage code is designed, protecting against t-collusion, and handling up to b Byzantine and r unresponsive servers, when n>k+t+2b+r-1. This scheme achieves a PIR rate of ((n-r-(k+2b+t-1))/n-r). In the case where the capacity is known, namely, when k=1, it is asymptotically capacity achieving as the number of files grows. Finally, the scheme is adapted to symmetric PIR.

KW - Byzantine

KW - information retrieval

KW - Privacy

KW - Reed-Solomon codes

KW - reliability

KW - robustness

KW - servers

UR - http://www.scopus.com/inward/record.url?scp=85065976996&partnerID=8YFLogxK

U2 - 10.1109/TIT.2018.2890285

DO - 10.1109/TIT.2018.2890285

M3 - Article

SN - 0018-9448

VL - 65

SP - 3898

EP - 3906

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

M1 - 8598994

ER -

Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers

Abstrakti

Pääsy asiakirjaan

Muut tiedostot ja linkit

Sormenjälki

Projektit

Lukuteoreettisia ja kombinatorisia työkaluja yksityisiin ja turvallisiin pilvipalveluihin

Sovellettu algebra ja lukuteoria kestävien ja turvallisten langattomien pilvitallennussysteemien suunnittelussa

Sovellettu algebra tietoliikenneteknologiassa

Siteeraa tätä