13 citations · 22 across the 15 of their papers we have counts for
21 papers
Multiuser Commitment over Noisy Channels
Remi A. Chou, Matthieu R. Bloch
We consider multi-user commitment models that capture the problem of enabling multiple bidders to simultaneously submit auctions to verifiers while ensuring that i) verifiers do no…
The Gaussian Multiple Access Wiretap Channel with Selfish Transmitters: A Coalitional Game Theory Perspective
Remi A. Chou, Aylin Yener
This paper considers the Gaussian multiple access wiretap channel (GMAC-WT) with selfish transmitters, i.e., who are each solely interested in maximizing their individual secrecy r…
Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy Leakage
Remi A. Chou, Joerg Kliewer
Consider the problem of storing data in a distributed manner over servers. Specifically, the data needs to (i) be recoverable from any servers, and (ii) remain private from…
Private Information Retrieval with Private Noisy Side Information
Hassan ZivariFard, Remi A. Chou
Consider Private Information Retrieval (PIR), where a client wants to retrieve one file out of files that are replicated in different servers and the client selection must…
Quantifying the Cost of Privately Storing Data in Distributed Storage Systems
Remi A. Chou
Consider a user who wishes to store a file in multiple servers such that at least t servers are needed to reconstruct the file, and z colluding servers cannot learn any information…
Short Blocklength Wiretap Channel Codes via Deep Learning: Design and Performance Evaluation
Vidhi Rana, Remi A. Chou
We design short blocklength codes for the Gaussian wiretap channel under information-theoretic security guarantees. Our approach consists in decoupling the reliability and secrecy…
Private Classical Communication over Quantum Multiple-Access Channels
Remi A. Chou
We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region.…
Function Computation Without Secure Links: Information and Leakage Rates
Remi A. Chou, Joerg Kliewer
Consider users, who each hold private data, and one fusion center who must compute a function of the private data of the users. To accomplish this task, each user may utili…
Distributed Secret Sharing over a Public Channel from Correlated Random Variables
Remi A. Chou
We consider a secret-sharing model where a dealer distributes the shares of a secret among a set of participants with the constraint that only predetermined subsets of participants…
Multiple Access Channel Resolvability Codes from Source Resolvability Codes
Rumia Sultana, Remi A. Chou
We show that the problem of code construction for multiple access channel (MAC) resolvability can be reduced to the simpler problem of code construction for source resolvability. S…
Secret Sharing from Correlated Gaussian Random Variables and Public Communication
Vidhi Rana, Remi A. Chou, Hyuck Kwon
In this paper, we study an information-theoretic secret sharing problem, where a dealer distributes shares of a secret among a set of participants under the following constraints:…
Explicit Wiretap Channel Codes via Source Coding, Universal Hashing, and Distribution Approximation, When the Channels' Statistics are Uncertain
Remi A. Chou
We consider wiretap channels with uncertainty on the eavesdropper channel under (i) noisy blockwise type II, (ii) compound, or (iii) arbitrarily varying models. We present explicit…
Secure Distributed Storage: Rate-Privacy Trade-Off and XOR-Based Coding Scheme
Remi A. Chou, Joerg Kliewer
We consider the problem of storing data in a distributed manner over servers. We require the data (i) to be recoverable from the servers, and (ii) to remain private from an…
Universal Covertness for Discrete Memoryless Sources
Remi A. Chou, Matthieu R. Bloch, Aylin Yener
Consider a sequence of length emitted by a Discrete Memoryless Source (DMS) with unknown distribution . The objective is to construct a lossless source code that map…
Secret-Key Generation in Many-to-One Networks: An Integrated Game-Theoretic and Information-Theoretic Approach
Remi A. Chou, Aylin Yener
This paper considers secret-key generation between several agents and a base station that observe independent and identically distributed realizations of correlated random variable…
Empirical and Strong Coordination via Soft Covering with Polar Codes
Remi A. Chou, Matthieu Bloch, Joerg Kliewer
We design polar codes for empirical coordination and strong coordination in two-node networks. Our constructions hinge on the fact that polar codes enable explicit low-complexity s…
Coding Schemes for Achieving Strong Secrecy at Negligible Cost
Remi A. Chou, Badri Vellambi, Matthieu Bloch +1
We study the problem of achieving strong secrecy over wiretap channels at negligible cost, in the sense of maintaining the overall communication rate of the same channel without se…
Polar Coding for the Broadcast Channel with Confidential Messages: A Random Binning Analogy
Remi A. Chou, Matthieu R. Bloch
We develop a low-complexity polar coding scheme for the discrete memoryless broadcast channel with confidential messages under strong secrecy and randomness constraints. Our scheme…
The Effect of Eavesdropper's Statistics in Experimental Wireless Secret-Key Generation
Alexandre J. Pierrot, Rémi A. Chou, Matthieu R. Bloch
This paper investigates the role of the eavesdropper's statistics in the implementation of a practical secret-key generation system. We carefully conduct the information-theoretic…
Polar Coding for Secret-Key Generation
Remi A. Chou, Matthieu R. Bloch, Emmanuel Abbe
Practical implementations of secret-key generation are often based on sequential strategies, which handle reliability and secrecy in two successive steps, called reconciliation and…
Separation of Reliability and Secrecy in Rate-Limited Secret-Key Generation
Remi A. Chou, Matthieu R. Bloch
For a discrete or a continuous source model, we study the problem of secret-key generation with one round of rate-limited public communication between two legitimate users. Althoug…