Fetching the paper…
Reading the bibliography…
We develop a low-complexity polar coding scheme for the discrete memoryless broadcast channel with confidential messages under strong secrecy and randomness constraints.
R. Fano, Transmission of Information: A Statistical Theory of Communications . M.I.T. Press, 1961
1961
Earlier work this paper cites.
A. Wyner, “The wire-tap channel,” The Bell System Technical Journal, The , vol. 54, no. 8, pp. 1355–1387, 1975
1975
Earlier work this paper cites.
I. Csiszár and J. Korner, “Broadcast channels with confidential messages,” IEEE Trans. Inf. Theory , vol. 24, no. 3, pp. 339–348, 1978
1978
Earlier work this paper cites.
I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems . Cambridge Univ Pr, 1981
1981
Earlier work this paper cites.
R. Chou and M. Bloch, “Data Compression with Nearly Uniform Output,” in Proc. of IEEE Int. Symp. Inf. Theory , 2013, pp. 1979–1983
1983
Earlier work this paper cites.
D. Aldous, “Random walks on finite groups and rapidly mixing markov chains,” in Séminaire de Probabilités XVII 1981/82 . Springer, 1983, pp. 243–297
1983
Earlier work this paper cites.
T. Cover and J. Thomas, Elements of Information Theory . Wiley, 1991
1991
Earlier work this paper cites.
I. Csiszár, “Almost independence and secrecy capacity,” Problems of Information Transmission , vol. 32, no. 1, pp. 40–47, 1996
1996
Earlier work this paper cites.
M. Hoshi et al. , “Interval algorithm for random number generation,” IEEE Trans. Inf. Theory , vol. 43, no. 2, pp. 599–611, 1997
1997
Earlier work this paper cites.
U. Maurer and S. Wolf, “Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free,” in Lecture Notes in Computer Science . Springer-Verlag, 2000, pp. 351–368
2000
Earlier work this paper cites.
T. S. Han, “Folklore in Source Coding: Information-Spectrum Approach,” IEEE Trans. Inf. Theory , vol. 51, no. 2, pp. 747–753, 2005
2005
Earlier work this paper cites.
A. Thangaraj, S. Dihidar, A. Calderbank, S. McLaughlin, and J.-M. Merolla, “Applications of LDPC codes to the wiretap channels,” IEEE Trans. Inf. Theory , vol. 53, no. 8, pp. 2933–2945, 2007
2007
Earlier work this paper cites.
M. Hayashi, “Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness,” IEEE Trans. Inf. Theory , vol. 54, no. 10, pp. 4619–4637, 2008
2008
Earlier work this paper cites.
E. Sasoglu, I. E. Telatar, and E. Arikan, “Polarization for arbitrary discrete memoryless channels,” in Proc. of IEEE Inf. Theory Workshop , 2009, pp. 144–148
2009
Earlier work this paper cites.
P. Cuff, “Communication in Networks for Coordinating Behavior,” Ph.D. dissertation, Stanford Univ., CA., 2009
2009
Cited alongside, same era.
E. Arikan, “Source polarization,” in Proc. of IEEE Int. Symp. Inf. Theory , 2010, pp. 899–903
2010
Cited alongside, same era.
S. Korada and R. Urbanke, “Polar Codes are Optimal for Lossy Source Coding,” IEEE Trans. Inf. Theory , vol. 56, no. 4, pp. 1751–1768, 2010
2010
Cited alongside, same era.
2010
Cited alongside, same era.
A. Subramanian, A. Thangaraj, M. Bloch, and S. McLaughlin, “Strong secrecy on the binary erasure wiretap channel using large-girth LDPC codes,” IEEE Trans. Inf. Forensics and Security , vol. 6, no. 3, pp. 585–594, 2011
2011
J. M. Renes, R. Renner, and D. Sutter, “Efficient one-way secret-key agreement and private channel coding via polarization,” in Advances in Cryptology-ASIACRYPT 2013 . Springer, 2013, pp. 194–213
2013
Later among the works it cites.
M. Andersson, R. Schaefer, T. Oechtering, and M. Skoglund, “Polar coding for bidirectional broadcast channels with common and confidential messages,” IEEE Journal on Selected Areas in Communications , vol. 31, no. 9, pp. 1901–1908, 2013
2013
Later among the works it cites.
J. Honda and H. Yamamoto, “Polar coding without alphabet extension for asymmetric models,” IEEE Trans. Inf. Theory , vol. 59, no. 12, pp. 7829–7838, 2013
2013
Later among the works it cites.
R. Chou, M. Bloch, and E. Abbe, “Polar Coding for Secret-Key Generation,” in Proc. of IEEE Inf. Theory Workshop , 2013
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
V. Rathi, R. Urbanke, M. Andersson, and M. Skoglund, “Rate-equivocation optimal spatially coupled LDPC codes for the bec wiretap channel,” in Proc. of IEEE Int. Symp. Inf. Theory , 2011, pp. 2393–2397
2011
Cited alongside, same era.
H. Mahdavifar and A. Vardy, “Achieving the Secrecy Capacity of Wiretap Channels using Polar Codes,” IEEE Trans. Inf. Theory , vol. 57, no. 10, pp. 6428–6443, 2011
2011
Cited alongside, same era.
M. Hayashi, “Exponential decreasing rate of leaked information in universal random privacy amplification,” IEEE Trans. Inf. Theory , vol. 57, no. 6, pp. 3989–4001, 2011
2011
Cited alongside, same era.
J. Renes and R. Renner, “Noisy channel coding via privacy amplification and information reconciliation,” IEEE Trans. Inf. Theory , vol. 57, no. 11, pp. 7377–7385, 2011
2011
Cited alongside, same era.
E. Şaşoğlu, “Polar Coding Theorems for Discrete Systems,” EPFL Thesis , no. 5219, 2011
2011
Cited alongside, same era.
M. Bellare, S. Tessaro, and A. Vardy, “Semantic security for the wiretap channel,” in Advances in Cryptology–CRYPTO 2012 . Springer, 2012, pp. 294–311
2012
Cited alongside, same era.
M. Bloch and J. Kliewer, “On secure communication with constrained randomization,” in Proc. of IEEE Int. Symp. Inf. Theory , 2012, pp. 1172–1176
2012
Cited alongside, same era.
M. Yassaee, M. Aref, and A. Gohari, “Achievability proof via output statistics of random binning,” IEEE Trans. Inf. Theory , vol. 60, no. 11, pp. 6760–6786, 2014
2014
Closest in time.
R. Chou and M. Bloch, “Polar coding for the broadcast channel with confidential messages,” in Proc. of IEEE Inf. Theory Workshop , 2015, pp. 1–5
2015
Closest in time.
M. Mondelli, S. H. Hassani, I. Sason, and R. L. Urbanke, “Achieving marton’s region for broadcast channels using polar codes,” IEEE Trans. Inf. Theory , vol. 61, no. 2, pp. 783–800, 2015
2015
Closest in time.
S. Watanabe and Y. Oohama, “The optimal use of rate-limited randomness in broadcast channels with confidential messages,” IEEE Trans. Inf. Theory , vol. 61, no. 2, pp. 983–995, 2015
2015
Closest in time.
R. Chou and M. Bloch, “Using deterministic decisions for low-entropy bits in the encoding and decoding of polar codes,” in Proc. of the Annual Allerton Conf. on Communication Control and Computing , 2015
2015
Closest in time.
R. Chou, M. Bloch, and E. Abbe, “Polar coding for secret-key generation,” IEEE Trans. Inf. Theory , no. 11, p. 6213, 2015
2015
Closest in time.
2015
Closest in time.
R. Chou, M. Bloch, and J. Kliewer, “Polar Coding for Empirical and Strong Coordination via Distribution Approximation,” in Proc. of IEEE Int. Symp. Inf. Theory , 2015
2015
Closest in time.
N. Goela, E. Abbe, and M. Gastpar, “Polar codes for broadcast channels,” IEEE Trans. Inf. Theory , vol. 61, no. 2, pp. 758–782, 2015
2015
Closest in time.