Fetching the paper…
Reading the bibliography…
A two-party key agreement problem with public discussion, known as the source model problem, is considered.
R. Ahlswede and P. Gács, “Spreading of sets in product spaces and hypercontraction of the Markov operator,” Annals Probability , vol. 4, no. 6, pp. 925–939, Dec. 1976
1976
Earlier work this paper cites.
I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems , 1st ed. New York, NY.: Academic Press, 1982
1982
Earlier work this paper cites.
T. Han, “Hypothesis testing with multiterminal data compression,” IEEE Trans. Inf. Theory , vol. 33, no. 6, pp. 759–772, Nov. 1987
1987
Earlier work this paper cites.
U. M. Maurer, “Protocols for secret key agreement by public discussion based on common information,” in Ann. Int. Cryptol. Conf. , Santa Barbara, CA, USA, Aug. 1992, pp. 461–470
1992
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, no. 4, pp. 1121–1132, July 1993
1993
Earlier work this paper cites.
U. M. Maurer, “Secret key agreement by public discussion from common information,” IEEE Trans. Inf. Theory , vol. 39, no. 3, pp. 733–742, May 1993
1993
Earlier work this paper cites.
A. Orlitsky and A. Wigderson, “Secrecy enhancement via public discussion,” in IEEE Int. Symp. Inf. Theory , San Antonio, TX, Jan. 1993, pp. 155–155
1993
Earlier work this paper cites.
H. M. H. Shalaby and A. Papamarcou, “A note on the asymptotics of distributed detection with feedback,” IEEE Trans. Inf. Theory , vol. 39, no. 2, pp. 633–640, Mar. 1993
1993
Earlier work this paper cites.
J. E. Cohen, Y. Iwasa, G. Rautu, M. B. Ruskai, E. Seneta, and G. Zbaganu, “Relative entropy under mappings by stochastic matrices,” Linear Algebra and Its Applications , vol. 179, pp. 211–235, Jan. 1993
1993
Earlier work this paper cites.
F. Kanaya and T. S. Han, “The asymptotics of posterior entropy and error probability for Bayesian estimation,” IEEE Trans. Inf. Theory , vol. 41, no. 6, pp. 1988–1992, Nov. 1995
1995
Earlier work this paper cites.
U. M. Maurer and S. Wolf, “Unconditionally secure key agreement and the intrinsic conditional information,” IEEE Trans. Inf. Theory , vol. 45, no. 2, pp. 499–514, Mar. 1999
1999
Earlier work this paper cites.
U. Maurer and S. Wolf, “Information-theoretic key agreement: From weak to strong secrecy for free,” in Int. Conf. Theory Appl. Cryptographic Techn. , Bruges, Belgium, May 2000, pp. 351–368
2000
Earlier work this paper cites.
M. Christandl, R. Renner, and S. Wolf, “A property of the intrinsic mutual information,” in IEEE Int. Symp. Inf. Theory , Yokohama, Japan, June-July 2003, pp. 258–258
2003
Earlier work this paper cites.
R. Renner and S. Wolf, “New bounds in secret-key agreement: The gap between formation and secrecy extraction,” in Int. Conf. Theory Appl. Cryptographic Techn. , Warsaw, Poland, May 2003, pp. 562–577
2003
Earlier work this paper cites.
I. Csiszár and P. Narayan, “Secrecy capacities for multiple terminals,” IEEE Trans. Inf. Theory , vol. 50, no. 12, pp. 3047–3061, Dec. 2004
2004
Cited alongside, same era.
J. Muramatsu, K. Yoshimura, and P. Davis, “Secret key capacity and advantage distillation capacity,” IEICE Trans. Fundam. Electron., Commun. Comp. Sci. , vol. 89, no. 10, pp. 2589–2596, Oct. 2006
2006
Cited alongside, same era.
E. Kushilevitz and N. Nisan, Communication Complexity . Cambridge University Press, 2006
2006
Cited alongside, same era.
S. Watanabe, R. Matsumoto, T. Uyematsu, and Y. Kawano, “Key rate of quantum key distribution with hashed two-way classical communication,” Physical Rev. A , vol. 76, no. 3, pp. 032 312–, Sep. 2007
2007
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, Dec. 2010
T. Van Erven and P. Harremos, “Rényi divergence and Kullback-Leibler divergence,” IEEE Trans. Inf. Theory , vol. 60, no. 7, pp. 3797–3820, July 2014
2014
Later among the works it cites.
K. Keykhosravi, M. Mahzoon, A. Gohari, and M. R. Aref, “From source model to quantum key distillation: An improved upper bound,” in Iran Workshop Commun. Inf. Theory , Tehran, Iran, May 2014, pp. 1–6
2014
Later among the works it cites.
H. Tyagi and S. Watanabe, “A bound for multiparty secret key agreement and implications for a problem of secure computing,” in Int. Conf. Theory Appl. Cryptographic Techn. , Copenhagen, Denmark, May 2014, pp. 369–386
2014
Later among the works it cites.
H. Tyagi and S. Watanabe, “Converses for secret key agreement and secure computing,” IEEE Trans. Inf. Theory , vol. 61, no. 9, pp. 4809–4827, Sep. 2015
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
Y. Polyanskiy, H. V. Poor, and S. Verdú, “Channel coding rate in the finite blocklength regime,” IEEE Trans. Inf. Theory , vol. 56, no. 5, pp. 2307–2359, Apr. 2010
2010
Cited alongside, same era.
A. Gohari and V. Anantharam, “Information-theoretic key agreement of multiple terminals - Part I,” IEEE Trans. Inf. Theory , vol. 56, no. 8, pp. 3973–3996, Aug. 2010
2010
Cited alongside, same era.
A. E. Gamal and Y.-H. Kim, Network Information Theory . Cambridge, U.K.: Cambridge Uni. Press, 2011
2011
Cited alongside, same era.
Y. Polyanskiy, “Hypothesis testing via a comparator,” in IEEE Int. Symp. Inf. Theory , July 2012, pp. 2206–2210
2012
Cited alongside, same era.
H. Tyagi, “Common information and secret key capacity,” IEEE Trans. Inf. Theory , vol. 59, no. 9, pp. 5627–5640, Sep. 2013
2013
Cited alongside, same era.
N. Ma and P. Ishwar, “The infinite-message limit of two-terminal interactive source coding,” IEEE Trans. Inf. Theory , vol. 59, no. 7, pp. 4071–4094, July 2013
2013
Cited alongside, same era.
C. Nair, “Upper concave envelopes and auxiliary random variables,” Int. J. Adv. Eng. Sci. Appl. Math. , vol. 5, no. 1, pp. 12–20, Mar. 2013
2013
Cited alongside, same era.
C. Chan, M. Mukherjee, N. Kashyap, and Q. Zhou, “When is omniscience a rate-optimal strategy for achieving secret key capacity?” in IEEE Inf. Theory Workshop , Cambridge, U.K., Sep. 2016, pp. 354–358
2016
Later among the works it cites.
M. Raginsky, “Strong data processing inequalities and ϕ \phi -Sobolev inequalities for discrete channels,” IEEE Trans. Inf. Theory , vol. 62, no. 6, pp. 3355–3389, Apr. 2016
2016
Later among the works it cites.
J. Liu, P. Cuff, and S. Verdú, “Secret key generation with limited interaction,” IEEE Trans. Inf. Theory , vol. 63, no. 11, pp. 7358–7381, Nov. 2017
2017
Closest in time.
A. Gohari and V. Anantharam, “Comments on “information-theoretic key agreement of multiple terminals - Part I”,” IEEE Trans. Inf. Theory , vol. 63, no. 8, pp. 5440–5442, Aug. 2017
2017
Closest in time.
M. Tomamichel and M. Hayashi, “Operational interpretation of Rényi information measures via composite hypothesis testing against product and Markov distributions,” IEEE Trans. Inf. Theory , vol. 64, no. 2, pp. 1064–1082, Feb. 2017
2017
Closest in time.
C. Chan, M. Mukherjee, N. Kashyap, and Q. Zhou, “On the optimality of secret key agreement via omniscience,” IEEE Trans. Inf. Theory , vol. 64, no. 4, pp. 2371–2389, Apr. 2018
2018
Closest in time.
D. Jost, U. Maurer, and J. L. Ribeiro, “Information-theoretic secret-key agreement: The asymptotically tight relation between the secret-key rate and the channel quality ratio,” in Theory Crypt. Conf. , Goa, India, Nov. 2018, pp. 345–369
2018
Closest in time.
A. Makur and Y. Polyanskiy, “Comparison of channels: criteria for domination by a symmetric channel,” IEEE Trans. Inf. Theory , vol. 64, no. 8, pp. 5704–5725, Aug. 2018
2018
Closest in time.
A. Lapidoth and C. Pfister, “Two measures of dependence,” MDPI Entropy , vol. 21, no. 8, p. 778, Aug. 2019
2019
Closest in time.