Formalization of Differential Privacy in Isabelle/HOL

被引:0
|
作者
Sato, Tetsuya [1 ]
Minamide, Yasuhiko [1 ]
机构
[1] Inst Sci Tokyo, Tokyo, Japan
关键词
Differential Privacy; Isabelle/HOL; proof assistant; program verification; LOGIC; DIVERGENCES;
D O I
10.1145/3703595.3705875
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Differential privacy is a statistical definition of privacy that has attracted the interest of both academia and industry. Its formulations are easy to understand, but the differential privacy of databases is complicated to determine. One of the reasons for this is that small changes in database programs can break their differential privacy. Therefore, formal verification of differential privacy has been studied for over a decade. In this paper, we propose an Isabelle/HOL library for formalizing differential privacy in a general setting. To our knowledge, it is the first formalization of differential privacy that supports continuous probability distributions. First, we formalize the standard definition of differential privacy and its basic properties. Second, we formalize the Laplace mechanism and its differential privacy. Finally, we formalize the differential privacy of the report noisy max mechanism.
引用
收藏
页码:67 / 82
页数:16
相关论文
共 50 条
  • [41] Automating Free Logic in Isabelle/HOL
    Benzmueller, Christoph
    Scott, Dana
    MATHEMATICAL SOFTWARE, ICMS 2016, 2016, 9725 : 43 - 50
  • [42] Verified Real Asymptotics in Isabelle/HOL
    Eberl, Manuel
    PROCEEDINGS OF THE 2019 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC '19), 2019, : 147 - 154
  • [43] Extracting a normalization algorithm in Isabelle/HOL
    Berghofer, S
    TYPES FOR PROOFS AND PROGRAMS, 2006, 3839 : 50 - 65
  • [44] On the mechanization of real analysis in Isabelle/HOL
    Fleuriot, JD
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2000, 1869 : 145 - 161
  • [45] Formalizing O notation in Isabelle/HOL
    Avigad, J
    Donnelly, K
    AUTOMATED REASONING, PROCEEDINGS, 2004, 3097 : 357 - 371
  • [46] Imperative functional programming with Isabelle/HOL
    Bulwahn, Lukas
    Krauss, Alexander
    Haftmann, Horian
    Erkoek, Levent
    Matthews, John
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2008, 5170 : 134 - +
  • [47] Stateful Protocol Composition in Isabelle/HOL
    Hess, Andreas V.
    Modersheim, Sebastian A.
    Brucker, Achim D.
    ACM TRANSACTIONS ON PRIVACY AND SECURITY, 2023, 26 (03)
  • [48] Weak alternating automata in Isabelle/HOL
    Merz, S
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2000, 1869 : 424 - 441
  • [49] Bounded Model Generation for Isabelle/HOL
    Weber, Tjark
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 125 (03) : 103 - 116
  • [50] Formalizing provable anonymity in Isabelle/HOL
    Li, Yongjian
    Pang, Jun
    FORMAL ASPECTS OF COMPUTING, 2015, 27 (02) : 255 - 282