Fetching the paper…
Reading the bibliography…
Given two random variables $X$ and $Y$, an operational approach is undertaken to quantify the ``leakage'' of information from $X$ to $Y$.
H. O. Hirschfeld, “A connection between correlation and contingency,” Mathematical Proceedings of the Cambridge Philosophical Society , vol. 31, no. 4, p. 520–524, 1935
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 System Technical Journal , 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-4, pp. 441–451, 1959
1959
Earlier work this paper cites.
R. G. Gallager, Information Theory and Reliable Communication . John Wiley and Sons, 1968
1968
Earlier work this paper cites.
R. Sibson, “Information radius,” Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete , vol. 14, no. 2, pp. 149–160, 1969. [Online]. Available: http://dx.doi.org/10.1007/BF00537520
1969
Earlier work this paper cites.
A. D. Wyner, “The wire-tap channel,” Bell System Technical Journal , vol. 54, no. 8, pp. 1355–1387, Oct. 1975
1975
Earlier work this paper cites.
L. Kleinrock, Queueing Systems, Vol. I: Theory . Wiley, 1975
1975
Earlier work this paper cites.
R. Ahlswede and P. Gács, “Spreading of sets in product spaces and hypercontraction of the markov operator,” Ann. Prob. , vol. 4, no. 6, pp. 925–939, 1976
1976
Earlier work this paper cites.
S. Leung-Yan-Cheong and M. Hellman, “The Gaussian wire-tap channel,” IEEE Trans. Inf. Theory , vol. 24, no. 4, pp. 451–456, Jul. 1978
1978
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, May 1978
1978
Earlier work this paper cites.
P. Brémaud, “Point processes and queues: martingale dynamics,” 1981
1981
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.
Y. M. Shtar’kov, “Universal sequential coding of single messages,” Problemy Peredachi Informatsii , vol. 23, no. 3, pp. 3–17, 1987
1987
Earlier work this paper cites.
D. Williams, Probability with martingales . Cambridge university press, 1991
1991
Earlier work this paper cites.
T. S. Han and S. Verdú, “Generalizing the Fano inequality,” IEEE Trans. Inf. Theory , vol. 40, no. 4, pp. 1247–1251, Jul 1994
1994
Earlier work this paper cites.
P. Billingsley, “Probability and measure, ser,” Probability and Mathematical Statistics. New York: Wiley , 1995
1995
Earlier work this paper cites.
P. C. Kocher, “Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems,” in Annual International Cryptology Conference . Springer, 1996, pp. 104–113
1996
Earlier work this paper cites.
H. Yamamoto, “Rate-distortion theory for the Shannon cipher system,” IEEE Trans. Inf. Theory , vol. 43, no. 3, pp. 827–835, 1997
1997
Earlier work this paper cites.
P. Kocher, J. Jaffe, and B. Jun, “Differential power analysis,” in Annual International Cryptology Conference . Springer, 1999, pp. 388–397
1999
Earlier work this paper cites.
E. Parzen, Stochastic processes . SIAM, 1999
1999
Earlier work this paper cites.
N. Merhav and E. Arıkan, “The Shannon cipher system with a guessing wiretapper,” IEEE Trans. Inf. Theory , vol. 45, no. 6, pp. 1860–1866, 1999
1999
Earlier work this paper cites.
D. X. Song, D. Wagner, and X. Tian, “Timing analysis of keystrokes and timing attacks on SSH,” in Proceedings of the 10th USENIX Security Symposium - Volume 10 . Berkeley, CA, USA: USENIX Association, 2001
2001
Earlier work this paper cites.
O. Kallenberg, Foundations of Modern Probability . Springer, 2002
2002
Earlier work this paper cites.
Y. Dodis and A. Smith, “Entropic security and the encryption of high entropy messages,” in Theory of Cryptography , ser. Lecture Notes in Computer Science, J. Kilian, Ed. Springer Berlin Heidelberg, 2005, vol. 3378, pp. 556–577
2005
Earlier work this paper cites.
A. B. Wagner and V. Anantharam, “Zero-rate reliability of the exponential-server timing channel,” IEEE Trans. Inf. Theory , vol. 51, no. 2, pp. 447–465, Feb 2005
2005
Cited alongside, same era.
A. Russell and H. Wang, “How to fool an unbounded adversary with a short key,” IEEE Trans. Inf. Theory , vol. 52, no. 3, pp. 1130–1140, March 2006
2006
Cited alongside, same era.
C. Dwork, F. McSherry, K. Nissim, and A. Smith, “Calibrating noise to sensitivity in private data analysis,” in Proceedings of the Third Conference on Theory of Cryptography , ser. TCC’06. Berlin, Heidelberg: Springer-Verlag, 2006, pp. 265–284
2006
Cited alongside, same era.
J. Krumm, “Inference attacks on location tracks,” Pervasive computing , pp. 127–143, 2007
2007
Cited alongside, same era.
P. K. Gopala, L. Lai, and H. El Gamal, “On the secrecy capacity of fading channels,” IEEE Trans. Inf. Theory , vol. 54, no. 10, pp. 4687–4698, Oct. 2008
M. S. Alvim, K. Chatzikokolakis, A. McIver, C. Morgan, C. Palamidessi, and G. Smith, “Additive and multiplicative notions of leakage, and their capacities,” in IEEE 27th Computer Security Foundations Symposium . IEEE, 2014, pp. 308–322
2014
Later among the works it cites.
Y. Altuğ and A. B. Wagner, “Refinement of the random coding bound,” IEEE Trans. Inf. Theory , vol. 60, no. 10, pp. 6005–6023, Oct 2014
2014
Later among the works it cites.
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.
R. G. Bartle, The elements of integration and Lebesgue measure . John Wiley & Sons, 2014
2014
Later among the works it cites.
A. Ghassami, X. Gong, and N. Kiyavash, “Capacity limit of queueing timing channel in shared FCFS schedulers,” in 2015 IEEE International Symposium on Information Theory (ISIT) , June 2015, pp. 789–793
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
D. Gunduz, E. Erkip, and H. V. Poor, “Lossless compression with security constraints,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , July 2008, pp. 111–115
2008
Cited alongside, same era.
P. Venkitasubramaniam, T. He, and L. Tong, “Anonymous networking amidst eavesdroppers,” IEEE Trans. Inf. Theory , vol. 54, no. 6, pp. 2770–2784, June 2008
2008
Cited alongside, same era.
C. Dwork, “Differential privacy: A survey of results,” in Theory and applications of models of computation . Springer, 2008, pp. 1–19
2008
Cited alongside, same era.
K. Zhang and X. Wang, “Peeping tom in the neighborhood: Keystroke eavesdropping on multi-user systems,” in Proceedings of the 18th USENIX Security Symposium (USENIX Security 09) . Montreal, Canada: USENIX, 2009. [Online]. Available: https://www.usenix.org/node/
2009
Cited alongside, same era.
T. Ristenpart, E. Tromer, H. Shacham, and S. Savage, “Hey, you, get off of my cloud: Exploring information leakage in third-party compute clouds,” in Proceedings of the 16th ACM Conference on Computer and Communications Security , ser. CCS ’09. New York, NY, USA: ACM, 2009, pp. 199–212. [Online]. Available: http://doi.acm.org/10.1145/1653662.1653687
2009
Cited alongside, same era.
G. Smith, “On the foundations of quantitative information flow,” in Foundations of Software Science and Computational Structures , ser. Lecture Notes in Computer Science, L. de Alfaro, Ed. Springer Berlin Heidelberg, 2009, vol. 5504, pp. 288–302
2009
Cited alongside, same era.
C. Braun, K. Chatzikokolakis, and C. Palamidessi, “Quantitative notions of leakage for one-try attacks,” Electronic Notes in Theoretical Computer Science , vol. 249, pp. 75–91, 2009
2009
Cited alongside, same era.
2015
Later among the works it cites.
S. Kadloor, N. Kiyavash, and P. Venkitasubramaniam, “Mitigating timing side channel in shared schedulers,” Networking, IEEE/ACM Transactions on , vol. PP, no. 99, pp. 1–12, 2015
2015
Later among the works it cites.
S. Verdú, “ α \alpha -mutual information,” in Information Theory and Applications Workshop (ITA), 2015 , Feb 2015, pp. 1–6
2015
Later among the works it cites.
G. Smith, “Recent developments in quantitative information flow (invited tutorial),” in 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science , July 2015, pp. 23–31
2015
Later among the works it cites.
2015
Later among the works it cites.
S.-W. Ho and S. Verdú, “Convexity/concavity of renyi entropy and α \alpha -mutual information,” in Proc. IEEE Intl. Symp. Inf. Theory , 2015, pp. 745–749
2015
Later among the works it cites.
P. Kairouz, S. Oh, and P. Viswanath, “The composition theorem for differential privacy,” in Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015 , 2015, pp. 1376–1385
2015
Later among the works it cites.
J. Liao, O. Kosut, L. Sankar, and F. P. Calmon, “A general framework for information leakage.” [Online]. Available: http://sankar.engineering.asu.edu/wp-content/uploads/2015/02/A-General-Framework-for-Information-Leakage-Privacy-Utility-Trade-offs1.pdf
2015
Later among the works it cites.
K. Karlsson and S. B. Wicker, “The effect of location granularity on semantic location inferences,” in 2016 49th Hawaii International Conference on System Sciences (HICSS) , Jan 2016, pp. 2197–2204
2016
Later among the works it cites.
C. Schieler and P. Cuff, “The henchman problem: Measuring secrecy by the minimum distortion in a list,” IEEE Trans. Inf. Theory , vol. 62, no. 6, pp. 3436–3450, June 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
M. M. Prabhakaran and V. M. Prabhakaran, “Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound,” in 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) , ser. Leibniz International Proceedings in Informatics (LIPIcs), I. Chatzigiannakis, M. Mitzenmacher, Y. Rabani, and D. Sangiorgi, Eds., vol. 55. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2016, pp. 88:1–88:14. [Online]. Available: http://drops.dagstuhl.de/opus/volltexte/2016/6197
2016
Later among the works it cites.
G. Fanti, P. Kairouz, S. Oh, K. Ramchandran, and P. Viswanath, “Hiding the rumor source,” IEEE Trans. Inf. Theory , vol. 63, no. 10, pp. 6679–6713, Oct 2017
2017
Later among the works it cites.
I. Issa and A. B. Wagner, “Measuring secrecy by the probability of a successful guess,” IEEE Trans. Inf. Theory , vol. 63, no. 6, pp. 3783–3803, June 2017
2017
Later among the works it cites.
N. Weinberger and N. Merhav, “A large deviations approach to secure lossy compression,” IEEE Transactions on Information Theory , vol. 63, no. 4, pp. 2533–2559, April 2017
2017
Later among the works it cites.
F. d. P. Calmon, A. Makhdoumi, M. Médard, M. Varia, M. Christiansen, and K. R. Duffy, “Principal inertia components and applications,” IEEE Transactions on Information Theory , vol. 63, no. 8, pp. 5011–5038, Aug 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
J. Liao, L. Sankar, F. P. Calmon, and V. Y. F. Tan, “Hypothesis testing under maximal leakage privacy constraints,” in IEEE Int. Symp. Inf. Theory (ISIT) , June 2017, pp. 779–783
2017
Later among the works it cites.
2017
Later among the works it cites.
C. T. Li and A. E. Gamal, “Maximal correlation secrecy,” IEEE Trans. Inf. Theory , vol. 64, no. 5, pp. 3916–3926, 2018
2018
Closest in time.