Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOctober 2016
Advanced Probabilistic Couplings for Differential Privacy
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications SecurityPages 55–67https://doi.org/10.1145/2976749.2978391Differential privacy is a promising formal approach to data privacy, which provides a quantitative bound on the privacy cost of an algorithm that operates on sensitive information. Several tools have been developed for the formal verification of ...
- ArticleJuly 2014
Proving Differential Privacy in Hoare Logic
CSF '14: Proceedings of the 2014 IEEE 27th Computer Security Foundations SymposiumPages 411–424https://doi.org/10.1109/CSF.2014.36Differential privacy is a rigorous, worst-case notion of privacy-preserving computation. Informally, a probabilistic program is differentially private if the participation of a single individual in the input database has a limited effect on the program'...
- research-articleJune 2012
Proving acceptability properties of relaxed nondeterministic approximate programs
PLDI '12: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 169–180https://doi.org/10.1145/2254064.2254086Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dynamic knobs [16], synchronization elimination [20, 32], approximate ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 6 - research-articleJanuary 2012
Probabilistic relational reasoning for differential privacy
POPL '12: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesPages 97–110https://doi.org/10.1145/2103656.2103670Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential privacy guarantees for real programs is a difficult and error-prone task that ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 1 - research-articleJanuary 2009
Formal certification of code-based cryptographic proofs
POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesPages 90–101https://doi.org/10.1145/1480881.1480894As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-based techniques provide a popular approach in which proofs are structured as ...
Also Published in:
ACM SIGPLAN Notices: Volume 44 Issue 1