@article {Chou2014b,
title = {Coding Schemes for Achieving Strong Secrecy at Negligible Cost},
journal = {IEEE Transactions on Information Theory},
volume = {63},
number = {3},
year = {2017},
month = {October},
pages = {1858-1873},
abstract = {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 secrecy constraints. Specifically, we propose and analyze two source-channel coding architectures, in which secrecy is achieved by multiplexing public and confidential messages. In both cases, our main contribution is to show that secrecy can be achieved without compromising communication rate and by requiring only randomness of asymptotically vanishing rate. Our first source-channel coding architecture relies on a modified wiretap channel code, in which randomization is performed using the output of a source code. In contrast, our second architecture relies on a standard wiretap code combined with a modified source code termed uniform compression code, in which a small shared secret seed is used to enhance the uniformity of the source code output. We carry out a detailed analysis of uniform compression codes and characterize the optimal size of the shared seed.},
keywords = {asymptotically vanishing rate randomness, Channel coding, Channel models, confidential messages, cryptography, Decoding, Encoding, message authentication, modified source code, modified wiretap channel code, multiplexing, optimal size characterization, Physical layer, physical-layer security, public messages, Security, shared secret seed, source code output uniformity enhancement, source coding, source-channel coding architectures, strong secrecy problem, telecommunication security, uniform compression code, Virtual private networks, wiretap channel},
issn = {0018-9448},
doi = {10.1109/TIT.2016.2645225},
author = {R. A. Chou and B. N. Vellambi and M. R. Bloch and J. Kliewer}
}
@conference {Vellambi2016,
title = {Lossy Compression with Near-uniform Encoder Outputs},
booktitle = {Proc. of IEEE International Symposium on Information Theory},
year = {2016},
month = {July},
pages = {530-534},
abstract = {It is well known that lossless compression of a discrete memoryless source with near-uniform encoder output is possible at a rate above its entropy if and only if the encoder and decoder share a common random seed. This work focuses on deriving conditions for near-uniform encoder output(s) in the Wyner-Ziv and the distributed lossy compression problems. We show that in the Wyner-Ziv problem, near-uniform encoder output and operation close to the WZ-rate limit is simultaneously possible, whereas in the distributed lossy compression problem, jointly near-uniform outputs is achievable in the interior of the distributed lossy compression rate region if the sources share non-trivial G{\'a}cs-K{\"o}rner common information.},
keywords = {Decoding, Distortion, Electronic mail, Encoding, Monte Carlo methods, Receivers},
doi = {10.1109/ISIT.2016.7541355},
author = {Badri N. Vellambi and J{\"o}rg Kliewer and Matthieu R Bloch}
}
@conference {Vellambi2015b,
title = {Strong coordination over a line when actions are Markovian},
booktitle = {Proc. of Annual Conference on Information Science and Systems},
year = {2016},
month = {March},
pages = {412-417},
abstract = {We analyze the problem of strong coordination over a multi-hop line network when the actions to be generated by the nodes satisfy a Markov chain that is matched to the network topology. We devise and prove the optimality of two schemes that cover the portions of the capacity region corresponding to unlimited or no common randomness shared by all nodes.},
keywords = {capacity region, Channel resolvability, channel synthesis, line network, Markov chain, Markov processes, multihop line network, network topology, no common randomness, random processes, Strong coordination, strong coordination problem, telecommunication network topology, telecommunication transmission lines, unlimited randomness},
doi = {10.1109/CISS.2016.7460538},
author = {B. N. Vellambi and J. Kliewer and Matthieu R Bloch}
}
@booklet {Vellambi2016a,
title = {Strong Coordination over Multi-hop Line Networks},
year = {2016},
month = {April},
author = {Badri N. Vellambi and Joerg Kliewer and Matthieu R Bloch}
}
@proceedings {Vellambi2015,
title = {Lossless and Lossy Source Compression with Near-Uniform Outputs: Is Common Randomness Always Required?},
journal = {Proc. IEEE International Symposium on Information Theory},
year = {2015},
month = {June},
pages = {2171-2175},
publisher = {IEEE},
address = {Honk Kong},
abstract = {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 nearly uniform under the variational distance (Chou-Bloch-ISIT{\textquoteright}13). This work uses finite-blocklength techniques to present an alternate proof that for near-uniform lossless compression the seed length has to grow strictly larger than sqrt(n), where n represents the blocklength of the lossless compression code. In the lossy setting, we show the surprising result that a seed is not required to make the encoder output nearly uniform.},
doi = {10.1109/ISIT.2015.7282840},
author = {Badri N. Vellambi and Matthieu R Bloch and R{\'e}mi A Chou and J{\"o}rg Kliewer}
}
@proceedings {Vellambi2015a,
title = {Strong Coordination over Multi-hop Line Networks},
journal = {IEEE Information Theory Workshop},
year = {2015},
month = {October},
pages = {192--196},
publisher = {IEEE},
address = {Jeju, South Korea},
abstract = {We analyze the problem of strong coordination over a multi-hop line network where the node initiating the coordination is a terminal network node. We provide a character- ization of the capacity region when the initiating node possesses unlimited local randomness and intermediate nodes operate under a functional regime. In this regime, next-hop messages are created only using common randomness and previous-hop incoming messages, i.e., local randomness at intermediate nodes is only used for generating actions.},
doi = {10.1109/ITWF.2015.7360761},
author = {Badri N. Vellambi and J{\"o}rg Kliewer and Matthieu R Bloch}
}
@article {Vilela2011,
title = {{W}ireless Secrecy Regions with Friendly Jamming},
journal = {{IEEE} {T}ransactions on {I}nformation {F}orensics and {S}ecurity},
volume = {6},
number = {2},
year = {2011},
month = {June},
pages = {256{\textendash}266},
doi = {10.1109/TIFS.2011.2111370},
author = {Joao Paulo Vilela and Matthieu R Bloch and Jo{\~a}o Barros and Steven W McLaughlin}
}
@conference {Vilela2010,
title = {{F}riendly Jamming for Wireless Secrecy},
booktitle = {Proc. of IEEE International Conference on Communications},
year = {2010},
month = {May},
pages = {1550-3607},
address = {Cape Town, South Africa},
doi = {10.1109/ICC.2010.5502606},
author = {Joao Paulo Vilela and Matthieu R Bloch and Jo{\~a}o Barros and Steven W McLaughlin}
}