Polar coding for secret-key generation

RA Chou, MR Bloch, E Abbe - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Practical implementations of secret-key generation are often based on sequential strategies,
which handle reliability and secrecy in two successive steps, called reconciliation and …

Polar coding for the broadcast channel with confidential messages: A random binning analogy

RA Chou, MR Bloch - IEEE Transactions on Information Theory, 2016 - ieeexplore.ieee.org
We develop a low-complexity polar coding scheme for the discrete memoryless broadcast
channel with confidential messages under strong secrecy and randomness constraints. Our …

Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information

S Tarnopolsky, A Cohen - arXiv preprint arXiv:2402.08407, 2024 - arxiv.org
We introduce for non-uniform messages a novel hybrid universal network coding
cryptosystem (NU-HUNCC) in the finite blocklength regime that provides Post-Quantum (PQ) …

Polar coding for the broadcast channel with confidential messages

RA Chou, MR Bloch - 2015 IEEE Information Theory Workshop …, 2015 - ieeexplore.ieee.org
We develop a low-complexity and secrecy capacity achieving polar coding scheme for the
discrete memoryless wiretap channel. Our scheme extends previous work by using a nearly …

Distributed secret sharing over a public channel from correlated random variables

RA Chou - IEEE Transactions on Information Theory, 2024 - ieeexplore.ieee.org
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 must …

Explicit wiretap channel codes via source coding, universal hashing, and distribution approximation, when the channels' statistics are uncertain

RA Chou - IEEE Transactions on Information Forensics and …, 2022 - ieeexplore.ieee.org
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 wiretap …

Random access and source-channel coding error exponents for multiple access channels

L Farkas, T Kói - IEEE Transactions on Information Theory, 2015 - ieeexplore.ieee.org
A new universal coding/decoding scheme for random access with collision detection is
given in case of two senders. The result is used to give achievable joint source-channel …

Coding schemes for achieving strong secrecy at negligible cost

RA Chou, BN Vellambi, MR Bloch… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
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 …

Universal covertness for discrete memoryless sources

RA Chou, MR Bloch, A Yener - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Consider a sequence X n of length n emitted by a Discrete Memoryless Source (DMS) with
unknown distribution p X. The objective is to construct a lossless source code that maps X n …

Lossless and lossy source compression with near-uniform output: Is common randomness always required?

BN Vellambi, M Bloch, R Chou… - 2015 IEEE International …, 2015 - ieeexplore.ieee.org
It is known that a sub-linear rate of source-independent random seed (common
randomness) can enable the construction of lossless compression codes whose output is …