R. Ahlswede and I. Csiszár, Common randomness in information theory and cryptography -I: secret sharing, IEEE Trans. Information Theory, vol.39, issue.4, pp.1121-1132, 1993.

L. Antunes, S. Laplante, A. Pinto, and L. Salvador, Cryptographic security of individual instances, ICITS, pp.195-210, 2010.

C. H. Bennett, G. Brassard, and J. Robert, Privacy amplification by public discussion, SIAM Journal on Computing, vol.17, issue.2, pp.210-229, 1988.

J. Gregory and . Chaitin, A theory of program size formally identical to information theory, Journal of the ACM (JACM), vol.22, issue.3, pp.329-340, 1975.

C. Chan, A. Al-bashabsheh, B. Javad, T. Ebrahimi, T. Kaced et al., Multivariate mutual information inspired by secret-key agreement, Proceedings of the IEEE, vol.3, issue.10, pp.1883-1913, 2015.

A. V. Chernov, A. A. Muchnik, A. E. Romashchenko, A. Shen, and N. K. Vereshchagin, Upper semi-lattice of binary strings with the relation "x is simple conditional to, Theor. Comput. Sci, vol.271, issue.1-2, pp.32-41, 2002.

I. Csiszár and J. Körner, Broadcast channels with confidential messages, IEEE Trans. Information Theory, vol.24, issue.3, pp.339-348, 1978.

I. Csiszár and P. Narayan, Secrecy capacities for multiple terminals, IEEE Trans. Information Theory, vol.50, issue.12, pp.3047-3061, 2004.

P. Gács and J. Körner, Common information is far less than mutual information, Probl. Control Inf. Theory, vol.2, issue.2, pp.149-162, 1973.

V. Guruswami and A. Smith, Codes for computationally simple channels: Explicit constructions with optimal rate, Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, pp.723-732, 2010.

V. Guruswami and A. Smith, Optimal rate code constructions for computationally simple channels, Journal of the ACM (JACM), vol.63, issue.4, p.35, 2016.

Y. Horibe, A note on Kolmogorov complexity and entropy. Applied mathematics letters, vol.16, issue.7, pp.1129-1130, 2003.

T. Kaced and A. Romashchenko, Conditional information inequalities for entropic and almost entropic points, IEEE Transactions on Information Theory, vol.59, issue.11, pp.7149-7167, 2013.
URL : https://hal.archives-ouvertes.fr/lirmm-00848455

T. Kaced, A. Romashchenko, and N. Vereshchagin, Conditional information inequalities and combinatorial applications, 2015.

. Sik-kow-leung-yan-cheong, Multi-user and wiretap channels including feedback, 1976.

M. Ueli and . Maurer, Conditionally-perfect secrecy and a provably-secure randomized cipher, Journal of Cryptology, vol.5, issue.1, pp.53-66, 1992.

M. Ueli and . Maurer, Secret key agreement by public discussion from common information, IEEE Trans. Information Theory, vol.39, issue.3, pp.733-742, 1993.

L. Ming, M. B. Paul, and . Vitányi, Kolmogorov complexity and its applications, 2014.

A. A. , Muchnik. On common information. Theor. Comput. Sci, vol.207, pp.319-328, 1998.

A. A. Muchnik and A. E. Romashchenko, Stability of properties of Kolmogorov complexity under relativization. Problems of information transmission, vol.46, pp.38-61, 2010.

. Ilya-razenshteyn, Common information revisited, 2011.

A. Romashchenko, Pairs of words with nonmaterializable mutual information. Problems of Information Transmission, vol.36, pp.3-20, 2000.

A. Shen, V. Uspensky, and N. Vereshchagin, Kolmogorov complexity and algorithmic randomness, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01803620

A. Kh and . Shen, The concept of (?, ?)-stochasticity in the Kolmogorov sense, and its properties, Soviet Math. Dokl, vol.28, issue.1, pp.295-299, 1983.

A. D. Smith, Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes, Symposium on Discrete Algorithms: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, vol.7, pp.395-404, 2007.

H. Tyagi, Common information and secret key capacity, IEEE Transactions on Information Theory, vol.59, issue.9, pp.5627-5640, 2013.

A. D. Wyner, The wire-tap channel, Bell Syst. Tech J, vol.54, issue.8, pp.1355-1387, 1975.

M. Zimand, Kolmogorov complexity version of Slepian-Wolf coding, STOC 2017, pp.22-32, 2017.