{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/differential-privacy-at-risk-bridging","title":"Differential Privacy at Risk: Bridging Randomness and Privacy Budget","arxiv_id":"2003.00973","date":"2020-03-02","proceeding":null,"authors":["Ashish Dandekar","Debabrota Basu","Stephane Bressan"],"abstract":"The calibration of noise for a privacy-preserving mechanism depends on the sensitivity of the query and the prescribed privacy level. A data steward must make the non-trivial choice of a privacy level that balances the requirements of users and the monetary constraints of the business entity. We analyse roles of the sources of randomness, namely the explicit randomness induced by the noise distribution and the implicit randomness induced by the data-generation distribution, that are involved in the design of a privacy-preserving mechanism. The finer analysis enables us to provide stronger privacy guarantees with quantifiable risks. Thus, we propose privacy at risk that is a probabilistic calibration of privacy-preserving mechanisms. We provide a composition theorem that leverages privacy at risk. We instantiate the probabilistic calibration for the Laplace mechanism by providing analytical results. We also propose a cost model that bridges the gap between the privacy level and the compensation budget estimated by a GDPR compliant business entity. The convexity of the proposed cost model leads to a unique fine-tuning of privacy level that minimises the compensation budget. We show its effectiveness by illustrating a realistic scenario that avoids overestimation of the compensation budget by using privacy at risk for the Laplace mechanism. We quantitatively show that composition using the cost optimal privacy at risk provides stronger privacy guarantee than the classical advanced composition.","url_abs":"https://arxiv.org/abs/2003.00973v2","url_pdf":"https://arxiv.org/pdf/2003.00973v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"differential-privacy-at-risk-bridging","repo_url":"https://github.com/ashishdandekar/Privacy-at-risk","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"privacy-preserving","task_name":"Privacy Preserving"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2003.00973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00973"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ashishdandekar/Privacy-at-risk","reach":null}],"summary":{"ran_honours":1,"ran_draft_wrong":1,"unverified":6},"by_repo_kind":{"listed":{"samples":8,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":8,"samples":[{"code_sha256_prefix":"9966c955580f8296","entry":"L1","repo":"ashishdandekar/Privacy-at-risk","repo_kind":"listed","path":"new_expt.py","file_url":"https://github.com/ashishdandekar/Privacy-at-risk/blob/HEAD/new_expt.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"9966c955580f8296"}},{"code_sha256_prefix":"916315cce911684b","entry":"ridge_regression","repo":"ashishdandekar/Privacy-at-risk","repo_kind":"listed","path":"new_expt.py","file_url":"https://github.com/ashishdandekar/Privacy-at-risk/blob/HEAD/new_expt.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"916315cce911684b"}},{"code_sha256_prefix":"e204aded3269579c","entry":"bound","repo":"ashishdandekar/Privacy-at-risk","repo_kind":"listed","path":"formulae.py","file_url":"https://github.com/ashishdandekar/Privacy-at-risk/blob/HEAD/formulae.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"e204aded3269579c"}},{"code_sha256_prefix":"40742f74ebb94401","entry":"bound","repo":"ashishdandekar/Privacy-at-risk","repo_kind":"listed","path":"composition.py","file_url":"https://github.com/ashishdandekar/Privacy-at-risk/blob/HEAD/composition.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"40742f74ebb94401"}},{"code_sha256_prefix":"ef5fd13d36c05a41","entry":"integral","repo":"ashishdandekar/Privacy-at-risk","repo_kind":"listed","path":"formulae.py","file_url":"https://github.com/ashishdandekar/Privacy-at-risk/blob/HEAD/formulae.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"ef5fd13d36c05a41"}},{"code_sha256_prefix":"0be4be588fe40495","entry":"integral","repo":"ashishdandekar/Privacy-at-risk","repo_kind":"listed","path":"composition.py","file_url":"https://github.com/ashishdandekar/Privacy-at-risk/blob/HEAD/composition.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"0be4be588fe40495"}},{"code_sha256_prefix":"3a4de03070528eec","entry":"regularizedHyper","repo":"ashishdandekar/Privacy-at-risk","repo_kind":"listed","path":"formulae.py","file_url":"https://github.com/ashishdandekar/Privacy-at-risk/blob/HEAD/formulae.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"3a4de03070528eec"}},{"code_sha256_prefix":"01f322431558962f","entry":"regularizedHyper","repo":"ashishdandekar/Privacy-at-risk","repo_kind":"listed","path":"composition.py","file_url":"https://github.com/ashishdandekar/Privacy-at-risk/blob/HEAD/composition.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"01f322431558962f"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}