Publication
Single-server Multi-user Private Information Retrieval with Side Information
Related publications (43)
uBFT: Microsecond-Scale BFT using Disaggregated Memory
Rachid Guerraoui, Antoine Murat, Mihail Igor Zablotchi, Athanasios Xygkis, Naama Ben David
We propose uBFT, the first State Machine Replication (SMR) system to achieve microsecond-scale latency in data centers, while using only 2f+1 replicas to tolerate f Byzantine failures. The Byzantine Fault Tolerance (BFT) provided by uBFT is essential as pu ...
2023Symmetry in design and decoding of polar-like codes
The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...
EPFL2022Oracular Byzantine Reliable Broadcast
Rachid Guerraoui, Manuel José Ribeiro Vidigueira, Martina Camaioni, Matteo Monti
Byzantine Reliable Broadcast (BRB) is a fundamental distributed computing primitive, with applications ranging from notifications to asynchronous payment systems. Motivated by practical consideration, we study Client-Server Byzantine Reliable Broadcast (CS ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022Cooperative Data Exchange and Private Information Retrieval
Coding techniques have been well studied and used for improving communication quality by combating noise and mitigating interference.
Recently, it has been shown that the same coding techniques can also be exploited to further improve communication perform ...
EPFL2020Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations
Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng
Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020Single-server Multi-message Private Information Retrieval with Side Information: the General Cases
Michael Christoph Gastpar, Su Li
The single-server multi-message private information retrieval with side information problem is studied for general cases. In this problem, K independent messages are stored at a single server. One user initially has M messages as side information and wants ...
IEEE2020Converse for Multi-Server Single-Message PIR with Side Information
Michael Christoph Gastpar, Su Li
Multi-server single-message private information retrieval is studied in the presence of side information. In this problem, K independent messages are replicatively stored at N non-colluding servers. The user wants to privately download one message from the ...
2020From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality
In his landmark paper "A Mathematical Theory of Communication," the founding father of information theory and coding theory, Claude E. Shannon, established the largest rate at which reliable communication is possible and he revealed that the key to this re ...
EPFL2019Improved decoding of second-order Reed-Muller codes
Rüdiger Urbanke, Kirill Ivanov
In this paper, we consider low-complexity decoding of second-order Reed-Muller codes. A class of polynomial-time algorithms, based on the projections onto first-order codes, is studied. An old representative of this class, originally developed for binary s ...
IEEE2019Compute–Forward Multiple Access (CFMA): Practical Implementations
Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu, Erixhen Sula, Adriano Pastore
We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute ...
2019