default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRemi A. Chou
Rémi A. Chou
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j21]Hassan ZivariFard
, Rémi A. Chou:
Secure Source Coding Resilient Against Compromised Users via an Access Structure. IEEE J. Sel. Areas Inf. Theory 5: 478-492 (2024)- [j20]Rémi A. Chou:
Distributed Secret Sharing Over a Public Channel From Correlated Random Variables. IEEE Trans. Inf. Theory 70(4): 2851-2869 (2024) - [j19]Hassan ZivariFard, Rémi A. Chou:
Private Information Retrieval With Private Noisy Side Information. IEEE Trans. Inf. Theory 70(4): 2886-2902 (2024) - [j18]Rémi A. Chou, Jörg Kliewer:
Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy Leakage. IEEE Trans. Inf. Theory 70(5): 3658-3668 (2024) - [j17]Rémi A. Chou, Aylin Yener:
The Gaussian Multiple Access Wiretap Channel With Selfish Transmitters: A Coalitional Game Theory Perspective. IEEE Trans. Inf. Theory 70(10): 7432-7446 (2024) - [c48]Amirhosein Morteza, Remi A. Chou:
Distributed Matrix Multiplication: Download Rate, Randomness and Privacy Trade-Offs. Allerton 2024: 1-7 - [c47]Amirhossein Shekofteh, Rémi A. Chou:
SPIR with Colluding and Non-Replicated Servers from a Noisy Channel. Allerton 2024: 1-6 - [c46]Vidhi Rana, Rémi A. Chou, Taejoon Kim:
Short Blocklength Secret Coding via Helper-Assisted Learning over the Wiretap Channel. ICC 2024: 1485-1490 - [c45]Rémi A. Chou, Jörg Kliewer, Aylin Yener:
Private Sum Computation: Trade-Off Between Shared Randomness and Privacy. ISIT 2024: 927-932 - [c44]Hassan ZivariFard, Rémi A. Chou, Xiaodong Wang:
The Capacity of Symmetric Private Information Retrieval with Private Noisy Side Information. ISIT 2024: 2658-2663 - [c43]Rémi A. Chou:
Dual-Source Symmetric PIR Without Data Replication or Shared Randomness. ISIT 2024: 2664-2669 - [c42]Abhisek Jha, SeyedMohammad Kashani, Hossein Mohammadi, Andre Kirchner, Minglong Zhang, Rémi A. Chou, Sang Wu Kim, Hyuck M. Kwon, Vuk Marojevic, Taejoon Kim:
Enhancing NextG Wireless Security: A Lightweight Secret Sharing Scheme with Robust Integrity Check for Military Communications. MILCOM 2024: 1-6 - [c41]Hossein Mohammadi, Minglong Zhang, Abhisek Jha, Vuk Marojevic, Remi A. Chou, Taejoon Kim:
Fortifying 5G Networks: Defending Against Jamming Attacks with Multipath Communications. MILCOM 2024: 680-681 - [i22]Remi A. Chou, Jörg Kliewer:
Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy Leakage. CoRR abs/2403.10676 (2024) - [i21]Remi A. Chou, Aylin Yener:
The Gaussian Multiple Access Wiretap Channel with Selfish Transmitters: A Coalitional Game Theory Perspective. CoRR abs/2406.04521 (2024) - [i20]Hassan ZivariFard, Remi A. Chou:
Secure Source Coding Resilient Against Compromised Users via an Access Structure. CoRR abs/2407.20901 (2024) - [i19]Remi A. Chou, Matthieu R. Bloch:
Multiuser Commitment over Noisy Channels. CoRR abs/2411.05987 (2024) - 2023
- [j16]Vidhi Rana, Rémi A. Chou:
Short Blocklength Wiretap Channel Codes via Deep Learning: Design and Performance Evaluation. IEEE Trans. Commun. 71(3): 1462-1474 (2023) - [j15]Rémi A. Chou:
Explicit Wiretap Channel Codes via Source Coding, Universal Hashing, and Distribution Approximation, When the Channels' Statistics are Uncertain. IEEE Trans. Inf. Forensics Secur. 18: 117-132 (2023) - [c40]Maryam Keshvari, Rémi A. Chou:
Distributed Storage Over a Public Channel: Trade-off between Privacy and Shared Key Lengths. Allerton 2023: 1-5 - [c39]Wai Ming Chan, Hyuck M. Kwon, Rémi A. Chou, David J. Love, Sonia Fahmy, Syed Rafiul Hussain, Sang Wu Kim, Chris Vander Valk, Christopher G. Brinton, Vuk Marojevic, Khanh D. Pham, Taejoon Kim:
Adaptive Frequency Hopping for 5G New Radio mMTC Security. ICIT 2023: 1-5 - [c38]Rémi A. Chou, Jörg Kliewer:
Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy Leakage. ISIT 2023: 1324-1329 - [c37]Hassan ZivariFard, Rémi A. Chou:
Private Information Retrieval When Private Noisy Side Information is Available. ISIT 2023: 1538-1543 - [c36]Rumia Sultana, Vidhi Rana, Rémi A. Chou:
Secret Sharing Over a Gaussian Broadcast Channel: Optimal Coding Scheme Design and Deep Learning Approach at Short Blocklength. ISIT 2023: 1961-1966 - [c35]Rémi A. Chou, Matthieu R. Bloch:
Retractable Commitment over Noisy Channels. ITW 2023: 260-265 - [i18]Hassan ZivariFard, Remi A. Chou:
Private Information Retrieval with Private Noisy Side Information. CoRR abs/2308.12374 (2023) - 2022
- [j14]Rémi A. Chou, Aylin Yener:
Gaussian Multiuser Wiretap Channels in the Presence of a Jammer-Aided Eavesdropper. Entropy 24(11): 1595 (2022) - [j13]Vidhi Rana, Rémi A. Chou, Hyuck M. Kwon:
Information-Theoretic Secret Sharing From Correlated Gaussian Random Variables and Public Communication. IEEE Trans. Inf. Theory 68(1): 549-559 (2022) - [j12]Rémi A. Chou:
Private Classical Communication Over Quantum Multiple-Access Channels. IEEE Trans. Inf. Theory 68(3): 1782-1794 (2022) - [j11]Rumia Sultana, Rémi A. Chou:
Multiple Access Channel Resolvability Codes From Source Resolvability Codes. IEEE Trans. Inf. Theory 68(6): 3608-3619 (2022) - [j10]Rémi A. Chou:
Quantifying the Cost of Privately Storing Data in Distributed Storage Systems. IEEE Trans. Inf. Theory 68(11): 7485-7499 (2022) - [c34]Rémi A. Chou, Matthieu R. Bloch:
Commitment over Multiple-Access Channels. Allerton 2022: 1-6 - [c33]Rémi A. Chou, Jörg Kliewer:
Function Computation Without Secure Links: Information and Leakage Rates. ISIT 2022: 1223-1228 - [c32]Rémi A. Chou:
Quantifying the Cost of Privately Storing Data in Distributed Storage Systems. ISIT 2022: 3274-3279 - [c31]Hassan ZivariFard, Rémi A. Chou:
Secure Data Storage Resilient Against Compromised Users via an Access Structure. ITW 2022: 464-469 - [i17]Remi A. Chou, Jörg Kliewer:
Function Computation Without Secure Links: Information and Leakage Rates. CoRR abs/2201.11891 (2022) - [i16]Remi A. Chou:
Private Classical Communication over Quantum Multiple-Access Channels. CoRR abs/2201.11899 (2022) - [i15]Vidhi Rana, Remi A. Chou:
Short Blocklength Wiretap Channel Codes via Deep Learning: Design and Performance Evaluation. CoRR abs/2206.03477 (2022) - [i14]Remi A. Chou:
Quantifying the Cost of Privately Storing Data in Distributed Storage Systems. CoRR abs/2207.13681 (2022) - 2021
- [j9]Rémi A. Chou, Matthieu R. Bloch, Aylin Yener:
Universal Covertness for Discrete Memoryless Sources. IEEE Trans. Inf. Theory 67(8): 5432-5442 (2021) - [c30]Rémi A. Chou:
Private Classical Communication over Quantum Multiple-Access Channels. ISIT 2021: 617-622 - [c29]Rumia Sultana, Rémi A. Chou:
Low-Complexity Secret Sharing Schemes Using Correlated Random Variables and Rate-Limited Public Communication. ISIT 2021: 970-975 - [c28]Vidhi Rana, Rémi A. Chou:
Design of Short Blocklength Wiretap Channel Codes: Deep Learning and Cryptography Working Hand in Hand. ITW 2021: 1-6 - [i13]Rumia Sultana, Remi A. Chou:
Multiple Access Channel Resolvability Codes from Source Resolvability Codes. CoRR abs/2103.10430 (2021) - [i12]Remi A. Chou:
Distributed Secret Sharing over a Public Channel from Correlated Random Variables. CoRR abs/2110.10307 (2021) - 2020
- [j8]Rémi A. Chou, Aylin Yener:
Strongly Secure Multiuser Communication and Authentication With Anonymity Constraints. IEEE Trans. Inf. Theory 66(1): 572-586 (2020) - [c27]Rémi A. Chou, Jörg Kliewer:
Secure Distributed Storage: Rate-Privacy Trade-Off and XOR-Based Coding Scheme. ISIT 2020: 605-610 - [c26]Rumia Sultana, Rémi A. Chou:
Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability Codes. ISIT 2020: 1576-1580 - [c25]Rémi A. Chou:
Pairwise Oblivious Transfer. ITW 2020: 1-5 - [c24]Vidhi Rana, Rémi A. Chou, Hyuck M. Kwon:
Secret Sharing from Correlated Gaussian Random Variables and Public Communication. ITW 2020: 1-5 - [i11]Remi A. Chou, Jörg Kliewer:
Distributed Secure Storage: Rate-Privacy Trade-Off and XOR-Based Coding Scheme. CoRR abs/2001.04241 (2020) - [i10]Remi A. Chou:
Explicit Codes for the Wiretap Channel: A Unified Design Framework. CoRR abs/2002.01924 (2020) - [i9]Vidhi Rana, Remi A. Chou, Hyuck M. Kwon:
Secret Sharing from Correlated Gaussian Random Variables and Public Communication. CoRR abs/2010.07536 (2020)
2010 – 2019
- 2019
- [j7]Remi A. Chou, Aylin Yener:
Secret-Key Generation in Many-to-One Networks: An Integrated Game-Theoretic and Information-Theoretic Approach. IEEE Trans. Inf. Theory 65(8): 5144-5159 (2019) - [c23]Rumia Sultana, Rémi A. Chou:
Explicit Low-complexity Codes for Multiple Access Channel Resolvability. Allerton 2019: 116-123 - [c22]Rémi A. Chou, Aylin Yener:
The Degraded Gaussian Many-Access Wiretap Channel. ISIT 2019: 672-676 - [c21]Rémi A. Chou:
Biometric Systems with Multiuser Access Structures. ISIT 2019: 807-811 - 2018
- [j6]Remi A. Chou, Matthieu R. Bloch, Jörg Kliewer:
Empirical and Strong Coordination via Soft Covering With Polar Codes. IEEE Trans. Inf. Theory 64(7): 5087-5100 (2018) - [j5]Remi A. Chou, Aylin Yener:
Polar Coding for the Multiple Access Wiretap Channel via Rate-Splitting and Cooperative Jamming. IEEE Trans. Inf. Theory 64(12): 7903-7921 (2018) - [c20]Tewodros A. Zewde, Remi A. Chou, Mustafa Cenk Gursoy:
Optimal Resource Allocation for SWIPT with Full-Duplex Operation and Secrecy. ICC Workshops 2018: 1-6 - [c19]Remi A. Chou:
Explicit Codes for the Wiretap Channel with Uncertainty on the Eavesdropper's Channel. ISIT 2018: 476-480 - [c18]Remi A. Chou:
Secret Sharing over a Public Channel from Correlated Random Variables. ISIT 2018: 991-995 - [i8]Remi A. Chou, Matthieu R. Bloch, Aylin Yener:
Universal Covertness for Discrete Memoryless Sources. CoRR abs/1808.05612 (2018) - 2017
- [j4]Remi A. Chou, Badri N. Vellambi, Matthieu R. Bloch, Jörg Kliewer:
Coding Schemes for Achieving Strong Secrecy at Negligible Cost. IEEE Trans. Inf. Theory 63(3): 1858-1873 (2017) - [c17]Remi A. Chou, Aylin Yener:
A game theoretic treatment for pair-wise secret-key generation in many-to-one networks. ISIT 2017: 1524-1528 - [c16]Remi A. Chou, Aylin Yener:
The degraded Gaussian multiple access wiretap channel with selfish transmitters: A coalitional game theory perspective. ISIT 2017: 1703-1707 - [c15]Remi A. Chou, Aylin Yener:
The Gaussian multiple access wiretap channel when the eavesdropper can arbitrarily jam. ISIT 2017: 1958-1962 - [i7]Remi A. Chou, Aylin Yener:
Secret-Key Generation in Many-to-One Networks: An Integrated Game-Theoretic and Information-Theoretic Approach. CoRR abs/1710.04643 (2017) - 2016
- [j3]Remi A. Chou, Matthieu R. Bloch:
Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy. IEEE Trans. Inf. Theory 62(5): 2410-2429 (2016) - [c14]Remi A. Chou, Matthieu R. Bloch, Aylin Yener:
Universal covertness for Discrete Memoryless Sources. Allerton 2016: 516-523 - [c13]Remi A. Chou, Aylin Yener:
Polar coding for the multiple access wiretap channel via rate-splitting and cooperative jamming. ISIT 2016: 983-987 - [c12]Remi A. Chou, Aylin Yener:
Multiuser authentication with anonymity constraints over noisy channels. ISIT 2016: 2439-2443 - [i6]Remi A. Chou, Matthieu R. Bloch, Jörg Kliewer:
Empirical and Strong Coordination via Soft Covering with Polar Codes. CoRR abs/1608.08474 (2016) - 2015
- [j2]Remi A. Chou, Matthieu R. Bloch, Emmanuel Abbe:
Polar Coding for Secret-Key Generation. IEEE Trans. Inf. Theory 61(11): 6213-6237 (2015) - [c11]Remi A. Chou, Matthieu R. Bloch:
Using deterministic decisions for low-entropy bits in the encoding and decoding of polar codes. Allerton 2015: 1380-1385 - [c10]Remi A. Chou, Matthieu R. Bloch, Jörg Kliewer:
Polar coding for empirical and strong coordination via distribution approximation. ISIT 2015: 1512-1516 - [c9]Badri N. Vellambi, Matthieu R. Bloch, Remi A. Chou, Jörg Kliewer:
Lossless and lossy source compression with near-uniform output: Is common randomness always required? ISIT 2015: 2171-2175 - [c8]Remi A. Chou, Matthieu R. Bloch:
Polar coding for the broadcast channel with confidential messages. ITW 2015: 1-5 - [i5]Remi A. Chou, Badri N. Vellambi, Matthieu R. Bloch, Jörg Kliewer:
Coding Schemes for Achieving Strong Secrecy at Negligible Cost. CoRR abs/1508.07920 (2015) - 2014
- [j1]Remi A. Chou, Matthieu R. Bloch:
Separation of Reliability and Secrecy in Rate-Limited Secret-Key Generation. IEEE Trans. Inf. Theory 60(8): 4941-4957 (2014) - [c7]Remi A. Chou, Matthieu R. Bloch:
Uniform distributed source coding for the multiple access wiretap channel. CNS 2014: 127-132 - [c6]Remi A. Chou, Matthieu R. Bloch, Jörg Kliewer:
Low-complexity channel resolvability codes for the symmetric multiple-access channel. ITW 2014: 466-470 - [i4]Remi A. Chou, Matthieu R. Bloch:
Polar Coding for the Broadcast Channel with Confidential Messages and Constrained Randomization. CoRR abs/1411.0281 (2014) - 2013
- [c5]Remi A. Chou, Matthieu R. Bloch:
Secret-key generation with arbitrarily varying eavesdropper's channel. GlobalSIP 2013: 277-280 - [c4]Remi A. Chou, Matthieu R. Bloch:
Data compression with nearly uniform output. ISIT 2013: 1979-1983 - [c3]Remi A. Chou, Matthieu R. Bloch, Emmanuel Abbe:
Polar coding for secret-key generation. ITW 2013: 1-5 - [c2]Alexandre J. Pierrot, Remi A. Chou, Matthieu R. Bloch:
Experimental aspects of secret key generation in indoor wireless environments. SPAWC 2013: 669-673 - [i3]Remi A. Chou, Matthieu R. Bloch, Emmanuel Abbe:
Polar Coding for Secret-Key Generation. CoRR abs/1305.4746 (2013) - [i2]Alexandre J. Pierrot, Remi A. Chou, Matthieu R. Bloch:
Practical Limitations of Secret-Key Generation in Narrowband Wireless Environments. CoRR abs/1312.3304 (2013) - 2012
- [c1]Remi A. Chou, Matthieu R. Bloch:
One-way rate-limited sequential key-distillation. ISIT 2012: 1777-1781 - [i1]Remi A. Chou, Matthieu R. Bloch:
Separation of Reliability and Secrecy in Rate-Limited Secret Key-Distillation. CoRR abs/1210.4482 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-22 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
