The Complexity of Verifying Boolean Programs as Differentially Private (Journal Article) | NSF PAGES

skip to main content

Citation Details

The Complexity of Verifying Boolean Programs as Differentially Private

Authors:: Bun, Mark; Gaboardi, Marco; Glinskih, Ludmila

Award ID(s):: 2040249 2040215

Publication Date:: 2022-08-01

NSF-PAR ID:: 10410396

Journal Name:: IEEE 35th Computer Security Foundations Symposium (CSF)

Page Range or eLocation-ID:: 396 to 411

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Publisher's Version of Record
https://doi.org/10.1109/CSF54842.2022.9919653