Fetching the paper…
Reading the bibliography…
Practical implementations of secret-key generation are often based on sequential strategies, which handle reliability and secrecy in two successive steps, called reconciliation and privacy amplification.
M. Wegman and J. Carter, “New Hash Functions and their Use in Authentication and Set Equality,” Journal of Computer and System Sciences , vol. 22, no. 3, pp. 265 – 279, 1981
1981
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 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.
U. Maurer, “Secret Key Agreement by Public Discussion from Common Information,” IEEE Trans. Inf. Theory , vol. 39, pp. 733–742, 1993
1993
Earlier work this paper cites.
R. Ahlswede and I. Csiszár, “Common Randomness in Information Theory and Cryptography Part I: Secret Sharing,” IEEE Trans. Inf. Theory , vol. 39, pp. 1121–1132, 1993
1993
Earlier work this paper cites.
C. Bennett, G. Brassard, and U. Maurer, “Generalized Privacy Amplification,” IEEE Trans. Inf. Theory , vol. 41, pp. 1915–1923, 1995
1995
Earlier work this paper cites.
1996
Earlier work this paper cites.
I. Csiszár and P. Narayan, “Common Randomness and Secret Key Generation with a Helper.” IEEE Trans. Inf. Theory , vol. 46, no. 2, pp. 344–366, 2000
2000
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.
——, “Secrecy Capacities for Multiple Terminals.” IEEE Trans. Inf. Theory , vol. 50, no. 12, pp. 3047–3061, 2004
2004
Earlier work this paper cites.
C. Ye and P. Narayan, “The Secret Key Private Key Capacity Region for Three Terminals,” in IEEE Int. Symp. Inf. Theory , 2005, pp. 2142–2146
2005
Earlier work this paper cites.
Y. Dodis, “On Extractors, Error-Correction and Hiding All Partial Information,” in IEEE Inf. Theory Workshop , 2005
2005
Earlier work this paper cites.
I. Csiszár and P. Narayan, “Secrecy Capacities for Multiterminal Channel Models,” IEEE Trans. Inf. Theory , vol. 54, no. 6, pp. 2437–2452, 2008
2008
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.
Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, “Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data,” SIAM journal on computing , vol. 38, no. 1, pp. 97–139, 2008
2008
Earlier work this paper cites.
L. Lai, S.-W. Ho, and H. V. Poor, “Privacy-Security Tradeoffs in Biometric Security Systems,” in Annual Allerton Conf. on Communication Control and Computing , 2008, pp. 268–273
2008
Earlier work this paper cites.
E. Arikan, “Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels,” IEEE Trans. Inf. Theory , vol. 55, no. 7, pp. 3051–3073, 2009
2009
Cited alongside, same era.
T. Ignatenko and F. M. Willems, “Biometric Systems: Privacy and Secrecy Aspects,” IEEE Trans. Inf. Forensics and Security , vol. 4, no. 4, pp. 956–973, 2009
2009
Cited alongside, same era.
E. Arikan and I. E. Telatar, “On the Rate of Channel Polarization,” in IEEE Int. Symp. Inf. Theory , 2009, pp. 1493–1495
2009
Cited alongside, same era.
——, “Capacity of a Shared Secret Key,” in IEEE Int. Symp. Inf. Theory , 2010, pp. 2593–2596
2010
Cited alongside, same era.
S. Watanabe and Y. Oohama, “Secret Key Agreement from Vector Gaussian Sources by Rate Limited Public Communication,” in IEEE Int. Symp. Inf. Theory , 2010, pp. 2597–2601
E. Şaşoğlu, “Polar Coding Theorems for Discrete Systems,” EPFL Thesis , no. 5219, 2011
2011
Later among the works it cites.
S. Watanabe and Y. Oohama, “Secret Key Agreement from Vector Gaussian Sources by Rate Limited Public Communication,” IEEE Trans. Inf. Forensics and Security , vol. 6, no. 3, pp. 541–550, 2011
2011
Later among the works it cites.
S. Nitinawarat and P. Narayan, “Secret Key Generation for Correlated Gaussian Sources,” IEEE Trans. Inf. Theory , vol. 58, no. 6, pp. 3373–3391, 2012
2012
Later among the works it cites.
C. Ye and P. Narayan, “Secret Key and Private Key Constructions for Simple Multiterminal Source Models,” IEEE Trans. Inf. Theory , vol. 58, no. 2, pp. 639–651, 2012
2012
Later among the works it cites.
R. Chou, M. Bloch, and E. Abbe, “Polar Coding for Secret-Key Generation,” in IEEE Inf. Theory Workshop , 2013
2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
S. Nitinawarat, C. Ye, A. Barg, P. Narayan, and A. Reznik, “Secret Key Generation for a Pairwise Independent Network Model,” IEEE Trans. Inf. Theory , vol. 56, no. 12, pp. 6482–6489, 2010
2010
Cited alongside, same era.
S. Nitinawarat and P. Narayan, “Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing,” IEEE Trans. Inf. Theory , vol. 56, no. 12, pp. 6490–6500, 2010
2010
Cited alongside, same era.
E. Hof and S. Shamai, “Secrecy-Achieving Polar-Coding,” in IEEE Inf. Theory Workshop , 2010, pp. 1–5
2010
Cited alongside, same era.
O. Koyluoglu and H. El Gamal, “Polar Coding for Secure Transmission and Key Agreement,” in IEEE Int. Symp. on Personal Indoor and Mobile Radio Communications , 2010, pp. 2698–2703
2010
Cited alongside, same era.
M. Andersson, V. Rathi, R. Thobaben, J. Kliewer, and M. Skoglund, “Nested Polar Codes for Wiretap and Relay Channels,” IEEE Communications Letters , vol. 14, no. 8, pp. 752–754, 2010
2010
Cited alongside, same era.
E. Arikan, “Source Polarization,” in IEEE Int. Symp. Inf. Theory , 2010, pp. 899–903
2010
Cited alongside, same era.
S. Korada and R. Urbanke, “Polar Codes for Slepian-Wolf, Wyner-Ziv, and Gelfand-Pinsker,” in IEEE Inf. Theory Workshop , 2010, pp. 1–5
2010
Cited alongside, same era.
Closest in time.
I. Csiszár and P. Narayan, “Secrecy Generation for Multiaccess Channel Models,” IEEE Trans. Inf. Theory , vol. 59, no. 1, pp. 17–31, 2013
2013
Closest in time.
R. Chou and M. Bloch, “Secret-key generation with arbitrarily varying eavesdropper’s channel,” in IEEE Global Conference on Signal and Information Processing , 2013
2013
Closest in time.
E. Şaşoğlu and A. Vardy, “A New Polar Coding Scheme for Strong Security on Wiretap Channels,” in IEEE Int. Symp. Inf. Theory , 2013, pp. 1117–1121
2013
Closest in time.
J. Renes, R. Renner, and D. Sutter, “Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization,” in Advances in Cryptology-ASIACRYPT . Springer, 2013, pp. 194–213
2013
Closest in time.
A. Pierrot, R. Chou, and M. Bloch, “Experimental Aspects of Secret Key Generation in Indoor Wireless Environments,” in IEEE Int. Workshop on Signal Processing Advances in Wireless Communications , 2013, pp. 557–561
2013
Closest in time.
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
Closest in time.
S. Rane, Y. Wang, S. Draper, and P. Ishwar, “Secure Biometrics: Concepts, Authentication Architectures, and Challenges,” Signal Processing Magazine, IEEE , vol. 30, no. 5, pp. 51–64, 2013
2013
Closest in time.
R. Chou and M. Bloch, “Separation of Reliability and Secrecy in Rate-Limited Secret-Key Generation,” IEEE Trans. Inf. Theory , vol. 60, no. 8, pp. 4941–4957, 2014
2014
Closest in time.
2014
Closest in time.
2014
Closest in time.
M. Ye and A. Barg, “Universal Source Polarization and an Application to a Multi-User Problem,” in Proc. of the Annual Allerton Conf. on Communication Control and Computing , 2014
2014
Closest in time.
E. Abbe, “Randomness and Dependencies Extraction via Polarization, with Applications to Slepian-wolf Coding and Secrecy,” to appear in IEEE Trans. Inf. Theory , 2015
2015
Closest in time.