Alex Pierrot

Senior Staff Machine Learning Engineer at Qualcomm.

Articles

1. A. J. Pierrot and M. R. Bloch, “Strongly Secure Communications Over the Two-Way Wiretap Channel,” ieee_j_ifs, vol. 6, no. 3, pp. 595–605, Sep. 2011.

   We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the eavesdropper’s terminal and cooperation between legitimate users. We leverage the notion of channel resolvability for the multiple-access channel to analyze cooperative jamming and we show that the artificial noise created by cooperative jamming induces a source of common randomness that can be used for secret-key agreement. We illustrate the gain provided by this coding technique in the case of the Gaussian two-way wiretap channel, and we show significant improvements for some channel configurations.

   @article{Pierrot2011a, author = {Pierrot, Alexandre J. and Bloch, Matthieu R.}, journal = ieee_j_ifs, title = {{S}trongly Secure Communications Over the Two-Way Wiretap Channel}, year = {2011}, month = sep, number = {3}, pages = {595--605}, volume = {6}, citeseerurl = {1010.0177}, creationdate = {2010-08-29T00:00:00}, doi = {10.1109/TIFS.2011.2158422}, file = {:2011-Pierrot-IEEETransIFS.pdf:PDF}, groups = {Wiretap channels}, howpublished = {accepted to \emph{IEEE Transactions on Information Forensics and Security}}, owner = {matthieu} }

Conference proceedings

1. A. J. Pierrot and M. R. Bloch, “Joint Channel Intrinsic Randomness and Channel Resolvability,” in ieee_itw, Sevilla, Spain, Apr. 2013, pp. 1–5.

   This paper investigates the separation of channel intrinsic randomness and channel resolvability. We derive joint exponents, which are compared to the tandem exponents obtained with a separate approach. We prove at once, in a simple manner, achievability results for channel intrinsic randomness, random number generation, and channel resolvability. We also provide converse results in different special settings.

   @inproceedings{Pierrot2013b, author = {Pierrot, Alexandre J. and Bloch, Matthieu R.}, booktitle = ieee_itw, title = {Joint Channel Intrinsic Randomness and Channel Resolvability}, year = {2013}, address = {Sevilla, Spain}, month = apr, pages = {1-5}, creationdate = {2013-04-17T00:00:00}, doi = {10.1109/ITW.2013.6691334}, file = {:2013-Pierrot-ITW.pdf:PDF}, howpublished = {accepted to \emph{IEEE Information Theory Workshop}}, owner = {mbloch} }

2. A. J. Pierrot, R. A. Chou, and M. R. Bloch, “Experimental Aspects of Secret-Key Generation in Indoor Wireless Environments,” in Proc. of Signal IEEE 4th Workshop on Signal Processing Advances in Wireless Communications, Apr. 2013.

   This paper proposes a proof-of-principle design of a secret key generation system along with the desirable secrecy analysis to guarantee information-theoretic security. We conduct physical experiments on programmable radios in an indoor environment to analyze the statistical characteristics of the induced source that we employ to generate secret keys. We also provide a generic security analysis of the system, and we give an estimate of the achievable secret key rates for a target information leakage in the finite block-length regime.

   @inproceedings{Pierrot2013a, author = {Pierrot, Alexandre J. and Chou, R\'emi A. and Bloch, Matthieu R.}, booktitle = {Proc. of Signal IEEE 4th Workshop on Signal Processing Advances in Wireless Communications}, title = {Experimental Aspects of Secret-Key Generation in Indoor Wireless Environments}, year = {2013}, month = apr, creationdate = {2013-02-13T00:00:00}, doi = {10.1109/SPAWC.2013.6612134}, file = {:../Publications/2013-Pierrot-SPAWC.pdf:PDF}, groups = {Experimental systems}, howpublished = {accepted to \emph{IEEE Workshop on Signal Processing Advances in Wireless Communications}}, owner = {mattbloch} }

3. A. J. Pierrot and M. R. Bloch, “LDPC-based coded cooperative jamming codes,” in ieee_itw, Lausanne, Switzerland, Sep. 2012, pp. 462–466.

   We present a practical coded cooperative jamming scheme for the problem of secure communications over the two-way wiretap channel. We design low-density parity-check (LDPC) based codes whose codewords interfere at the eavesdropper’s terminal, thus providing secrecy. We show that our scheme can guarantee low information leakage rate, and we assess its precise performance for classical and spatially coupled LDPC codes.

   @inproceedings{Pierrot2012, author = {Pierrot, Alexandre J. and Bloch, Matthieu R.}, booktitle = ieee_itw, title = {{LDPC}-based coded cooperative jamming codes}, year = {2012}, address = {Lausanne, Switzerland}, month = sep, pages = {462--466}, creationdate = {2012-03-14T00:00:00}, doi = {10.1109/ITW.2012.6404716}, file = {:2012-Pierrot-ITW.pdf:PDF}, groups = {Wiretap codes}, howpublished = {accepted at \emph{IEEE Information Theory Workshop}}, owner = {mattbloch} }