Batch codes and their applications

Yuval Ishai; Rafail Ostrovsky; Eyal Kushilevitz; Amit Sahai

doi:10.1145/1007352.1007396

Batch codes and their applications

Yuval Ishai, Rafail Ostrovsky, Eyal Kushilevitz, Amit Sahai

Computer Science

Research output: Contribution to journal › Conference article › peer-review

166 Scopus citations

Abstract

A batch code encodes a string x into an m-tuple of strings, called buckets, such that each batch of k bits from x can be decoded by reading at most one (more generally, t) bits from each bucket. Batch codes can be viewed as relaxing several combinatorial objects, including expanders and locally decodable codes. We initiate the study of these codes by presenting some constructions, connections with other problems, and lower bounds. We also demonstrate the usefulness of batch codes by presenting two types of applications: trading maximal load for storage in certain load-balancing scenarios, and amortizing the computational cost of private information retrieval (PIR) and related cryptographic protocols.

Original language	English
Pages (from-to)	262-271
Number of pages	10
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/1007352.1007396
State	Published - 2004
Event	Proceedings of the 36th Annual ACM Symposium on Theory of Computing - Chicago, IL, United States Duration: 13 Jun 2004 → 15 Jun 2004

Keywords

Coding
Distributed storage
Load balancing
Locally decodable codes
Private information retrieval

ASJC Scopus subject areas

Software

Access to Document

10.1145/1007352.1007396

Cite this

@article{daf1d604aeb344d2babee60ebde295b6,

title = "Batch codes and their applications",

abstract = "A batch code encodes a string x into an m-tuple of strings, called buckets, such that each batch of k bits from x can be decoded by reading at most one (more generally, t) bits from each bucket. Batch codes can be viewed as relaxing several combinatorial objects, including expanders and locally decodable codes. We initiate the study of these codes by presenting some constructions, connections with other problems, and lower bounds. We also demonstrate the usefulness of batch codes by presenting two types of applications: trading maximal load for storage in certain load-balancing scenarios, and amortizing the computational cost of private information retrieval (PIR) and related cryptographic protocols.",

keywords = "Coding, Distributed storage, Load balancing, Locally decodable codes, Private information retrieval",

author = "Yuval Ishai and Rafail Ostrovsky and Eyal Kushilevitz and Amit Sahai",

year = "2004",

doi = "10.1145/1007352.1007396",

language = "אנגלית",

pages = "262--271",

note = "Proceedings of the 36th Annual ACM Symposium on Theory of Computing ; Conference date: 13-06-2004 Through 15-06-2004",

}

TY - JOUR

T1 - Batch codes and their applications

AU - Ishai, Yuval

AU - Ostrovsky, Rafail

AU - Kushilevitz, Eyal

AU - Sahai, Amit

PY - 2004

Y1 - 2004

N2 - A batch code encodes a string x into an m-tuple of strings, called buckets, such that each batch of k bits from x can be decoded by reading at most one (more generally, t) bits from each bucket. Batch codes can be viewed as relaxing several combinatorial objects, including expanders and locally decodable codes. We initiate the study of these codes by presenting some constructions, connections with other problems, and lower bounds. We also demonstrate the usefulness of batch codes by presenting two types of applications: trading maximal load for storage in certain load-balancing scenarios, and amortizing the computational cost of private information retrieval (PIR) and related cryptographic protocols.

AB - A batch code encodes a string x into an m-tuple of strings, called buckets, such that each batch of k bits from x can be decoded by reading at most one (more generally, t) bits from each bucket. Batch codes can be viewed as relaxing several combinatorial objects, including expanders and locally decodable codes. We initiate the study of these codes by presenting some constructions, connections with other problems, and lower bounds. We also demonstrate the usefulness of batch codes by presenting two types of applications: trading maximal load for storage in certain load-balancing scenarios, and amortizing the computational cost of private information retrieval (PIR) and related cryptographic protocols.

KW - Coding

KW - Distributed storage

KW - Load balancing

KW - Locally decodable codes

KW - Private information retrieval

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

U2 - 10.1145/1007352.1007396

DO - 10.1145/1007352.1007396

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:4544231738

SN - 0734-9025

SP - 262

EP - 271

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - Proceedings of the 36th Annual ACM Symposium on Theory of Computing

Y2 - 13 June 2004 through 15 June 2004

ER -

Batch codes and their applications

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this