Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs

This publication has 17 references indexed in Scilit:

• Approximation Metrics Based on Probabilistic Bisimulations for General State-Space Markov Processes: A Survey
  Electronic Notes in Theoretical Computer Science, 2013
• Computing Distances between Probabilistic Automata
  Electronic Proceedings in Theoretical Computer Science, 2011
• Computer-Aided Security Proofs for the Working Cryptographer
  2011
• On the Relation between Differential Privacy and Quantitative Information Flow
  2011
• Privacy integrated queries
  Communications of the ACM, 2010
• ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA
  International Journal of Foundations of Computer Science, 2008
• L_p DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
  International Journal of Foundations of Computer Science, 2007
• Measuring the confinement of probabilistic systems
  Theoretical Computer Science, 2005
• Probabilistic Extensions of Process Algebras**This chapter is dedicated to the fond memory of Linda Christoff.
  2001
• About distances of discrete distributions satisfying the data processing theorem of information theory
  IEEE Transactions on Information Theory, 1997