The complexity of verifying boolean programs as differentially private

M Bun, M Gaboardi, L Glinskih - 2022 IEEE 35th Computer …, 2022 - ieeexplore.ieee.org
We study the complexity of the problem of verifying differential privacy for while-like
programs working over boolean values and making probabilistic choices. Programs in this …
被引用次数：3 相关文章

The Complexity of Verifying Boolean Programs as Differentially Private

M Bun, M Gaboardi, L Glinskih - arXiv preprint arXiv:2309.04642, 2023 - arxiv.org
We study the complexity of the problem of verifying differential privacy for while-like
programs working over boolean values and making probabilistic choices. Programs in this …

The Complexity of Verifying Boolean Programs as Differentially Private

M Bun, M Gaboardi, L Glinskih - 2022 IEEE 35th Computer Security …, 2022 - computer.org
We study the complexity of the problem of verifying differential privacy for while-like
programs working over boolean values and making probabilistic choices. Programs in this …
[PDF] nsf.gov

[PDF][PDF] The Complexity of Verifying Boolean Programs as Differentially Private

M Bun, M Gaboardi, L Glinskih - IEEE 35th Computer Security …, 2022 - par.nsf.gov
We study the complexity of the problem of verifying differential privacy for while-like
programs working over boolean values and making probabilistic choices. Programs in this …

The Complexity of Verifying Boolean Programs as Differentially Private

M Bun, M Gaboardi, L Glinskih - arXiv e-prints, 2023 - ui.adsabs.harvard.edu
We study the complexity of the problem of verifying differential privacy for while-like
programs working over boolean values and making probabilistic choices. Programs in this …

The Complexity of Verifying Boolean Programs as Differentially Private

M Bun, M Gaboardi, L Glinskih - 2022 IEEE 35th Computer Security …, 2022 - computer.org
We study the complexity of the problem of verifying differential privacy for while-like
programs working over boolean values and making probabilistic choices. Programs in this …
[PDF] nsf.gov

[PDF][PDF] The Complexity of Verifying Boolean Programs as Differentially Private

M Bun, M Gaboardi, L Glinskih - 2022 IEEE 35th Computer Security …, 2022 - par.nsf.gov
We study the complexity of the problem of verifying differential privacy for while-like
programs working over boolean values and making probabilistic choices. Programs in this …