Fetching the paper…
Reading the bibliography…
This paper shows that the Hirschfeld-Gebelein-R\'enyi maximal correlation between the message and the ciphertext provides good secrecy guarantees for cryptosystems that use short keys.
H. O. Hirschfeld, “A connection between correlation and contingency,” in Mathematical Proceedings of the Cambridge Philosophical Society , vol. 31, no. 04. Cambridge Univ Press, 1935, pp. 520–524
1935
Earlier work this paper cites.
H. Gebelein, “Das statistische problem der korrelation als variations-und eigenwertproblem und sein zusammenhang mit der ausgleichsrechnung,” ZAMM-Journal of Applied Mathematics and Mechanics/Zeitschrift für Angewandte Mathematik und Mechanik , vol. 21, no. 6, pp. 364–379, 1941
1941
Earlier work this paper cites.
C. E. Shannon, “Communication theory of secrecy systems,” Bell Syst. Tech. J. , vol. 28, no. 4, pp. 656–715, 1949
1949
Earlier work this paper cites.
A. Rényi, “On measures of dependence,” Acta mathematica hungarica , vol. 10, no. 3, pp. 441–451, 1959
1959
Earlier work this paper cites.
H. S. Witsenhausen, “On sequences of pairs of dependent random variables,” SIAM J. Appl. Math. , vol. 28, no. 1, pp. 100–113, 1975
1975
Earlier work this paper cites.
A. D. Wyner, “The wire-tap channel,” Bell Syst. Tech. J. , vol. 54, no. 8, pp. 1355–1387, 1975
1975
Earlier work this paper cites.
I. Csiszár and J. Körner, “Broadcast channels with confidential messages,” IEEE Trans. Inf. Theory , vol. 24, no. 3, pp. 339–348, 1978
1978
Earlier work this paper cites.
S. Goldwasser and S. Micali, “Probabilistic encryption,” Journal of Computer and System Sciences , vol. 28, no. 2, pp. 270–299, 1984
1984
Earlier work this paper cites.
L. H. Ozarow and A. D. Wyner, “Wire-tap channel—II,” in Advances in cryptology (Paris, 1984) , ser. Lecture Notes in Comput. Sci. Berlin: Springer, 1985, vol. 209, pp. 33–50
1985
Earlier work this paper cites.
J. L. Massey and I. Ingemarsson, “The Rip van Winkle cipher–a simple and provably computationally secure cipher with a finite key,” in IEEE International Symposium on Information Theory (Abstracts) , 1985, p. 146
1985
Earlier work this paper cites.
A. Lubotzky, R. Phillips, and P. Sarnak, “Ramanujan graphs,” Combinatorica , vol. 8, no. 3, pp. 261–277, 1988
1988
Earlier work this paper cites.
U. M. Maurer, “Perfect cryptographic security from partially independent channels,” in Proc. 23rd Annual ACM Symp. Theory of Computing . ACM, 1991, pp. 561–571
1991
Earlier work this paper cites.
J. Friedman, “On the second eigenvalue and random walks in randomd-regular graphs,” Combinatorica , vol. 11, no. 4, pp. 331–362, 1991
1991
Cited alongside, same era.
——, “Conditionally-perfect secrecy and a provably-secure randomized cipher,” Journal of Cryptology , vol. 5, no. 1, pp. 53–66, 1992
1992
Cited alongside, same era.
U. M. Maurer, “The strong secret key rate of discrete random triples,” in Communications and Cryptography . Springer, 1994, pp. 271–285
1994
Cited alongside, same era.
I. Csiszár, “Almost independence and secrecy capacity,” Problemy Peredachi Informatsii , vol. 32, no. 1, pp. 48–57, 1996
1996
Cited alongside, same era.
C. Cachin and U. Maurer, “Unconditional security against memory-bounded adversaries,” in Advances in Cryptology-CRYPTO’97 . Springer, 1997, pp. 292–306
1997
Cited alongside, same era.
L. Zhao and Y.-K. Chia, “The efficiency of common randomness generation,” in Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on , Sept 2011, pp. 944–950
2011
Later among the works it cites.
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
Later among the works it cites.
F. P. Calmon, M. Médard, L. M. Zeger, J. Barros, M. M. Christiansen, and K. R. Duffy, “Lists that are smaller than their parts: A coding approach to tunable secrecy,” in Proc. 50th Ann. Allerton Conf. Commun., Contr., and Comput. IEEE, 2012, pp. 1387–1394
2012
Later among the works it cites.
M. Cheraghchi, F. Didier, and A. Shokrollahi, “Invertible extractors and wiretap protocols,” IEEE Trans. Inf. Theory , vol. 58, no. 2, pp. 1254–1274, 2012
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
U. Maurer and S. Wolf, “Information-theoretic key agreement: From weak to strong secrecy for free,” in Advances in Cryptology-EUROCRYPT 2000 . Springer, 2000, pp. 351–368
2000
Cited alongside, same era.
A. Russell and H. Wang, “How to fool an unbounded adversary with a short key,” in Advances in Cryptology-EUROCRYPT 2002 . Springer, 2002, pp. 133–148
2002
Cited alongside, same era.
A. L. Gibbs and F. E. Su, “On choosing and bounding probability metrics,” International statistical review , vol. 70, no. 3, pp. 419–435, 2002
2002
Cited alongside, same era.
M. Bolla and G. Molnar-Saska, “Optimization problems for weighted graphs and related correlation estimates,” Discrete Mathematics , vol. 282, no. 1-3, pp. 23 – 33, 2004
2004
Cited alongside, same era.
Y. Dodis and A. Smith, “Entropic security and the encryption of high entropy messages,” in Theory of Cryptography . Springer, 2005, pp. 556–577
2005
Cited alongside, same era.
O. Goldreich, Foundations of Cryptography: Volume 2, Basic Applications . Cambridge University Press, 2009, vol. 2
2009
Cited alongside, same era.
K. Pearson, “On the criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen from random sampling,” Philosophical Magazine Series 5 , vol. 50, no. 302, pp. 157–175, 1900
Cited in the paper.
F. P. Calmon, M. Varia, M. Médard, M. M. Christiansen, K. R. Duffy, and S. Tessaro, “Bounds on inference,” in Proc. 51st Ann. Allerton Conf. Commun., Contr., and Comput. , Oct. 2013, pp. 567–574
2013
Later among the works it cites.
2013
Later among the works it cites.
F. P. Calmon, M. Varia, and M. Médard, “An exploration of the role of principal inertia components in information theory,” in Proc. IEEE Inf. Theory Workshop , Nov. 2014
2014
Closest in time.
R. O’Donnell, Analysis of boolean functions . Cambridge University Press, 2014
2014
Closest in time.
F. P. Calmon, A. Makhdoumi, and M. Médard, “Fundamental limits of perfect privacy,” in 2015 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2015, pp. 1796–1800
2015
Closest in time.
2015
Closest in time.
C. T. Li and A. El Gamal, “Maximal correlation secrecy,” Proc. IEEE Symp. Info. Theory , 2015
2015
Closest in time.