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 条
  • [1] A Modular Formalization of Superposition in Isabelle/HOL
    Desharnais, Martin
    Toth, Balazs
    Waldmann, Uwe
    Blanchette, Jasmin
    Tourret, Sophie
    Leibniz International Proceedings in Informatics, LIPIcs, 309
  • [2] An Isabelle/HOL Formalization of the SCL(FOL) Calculus
    Bromberger, Martin
    Desharnais, Martin
    Weidenbach, Christoph
    AUTOMATED DEDUCTION, CADE 29, 2023, 14132 : 116 - 133
  • [3] A novel formalization of symbolic trajectory evaluation semantics in Isabelle/HOL
    Li, Yongjian
    Hung, William N. N.
    Song, Xiaoyu
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (25) : 2746 - 2765
  • [4] Software Component Design with the B Method - A Formalization in Isabelle/HOL
    Deharbe, David
    Merz, Stephan
    FORMAL ASPECTS OF COMPONENT SOFTWARE, 2016, 9539 : 31 - 47
  • [5] A Formalization of the C99 Standard in HOL, Isabelle and Coq
    Krebbers, Robbert
    Wiedijk, Freek
    INTELLIGENT COMPUTER MATHEMATICS, MKM 2011, 2011, 6824 : 301 - 303
  • [6] An Isabelle/HOL Formalization of AProVE's Termination Method for LLVM IR
    Haslbeck, Max W.
    Thiemann, Rene
    CPP '21: PROCEEDINGS OF THE 10TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON CERTIFIED PROGRAMS AND PROOFS, 2021, : 238 - 249
  • [7] Formalization of Dube's Degree Bounds for Grobner Bases in Isabelle/HOL
    Maletzky, Alexander
    INTELLIGENT COMPUTER MATHEMATICS, CICM 2019, 2019, 11617 : 155 - 170
  • [8] Importing HOL into Isabelle/HOL
    Obua, Steven
    Skalberg, Sebastian
    AUTOMATED REASONING, PROCEEDINGS, 2006, 4130 : 298 - 302
  • [9] A Formalization of the CHSH Inequality and Tsirelson’s Upper-bound in Isabelle/HOL
    Mnacho Echenim
    Mehdi Mhalla
    Journal of Automated Reasoning, 2024, 68
  • [10] A Formalization of the CHSH Inequality and Tsirelson's Upper-bound in Isabelle/HOL
    Echenim, Mnacho
    Mhalla, Mehdi
    JOURNAL OF AUTOMATED REASONING, 2024, 68 (01)