{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T00:17:42Z","timestamp":1725409062440},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In this paper, we propose a probabilistic hybrid logic for the specification of data privacy requirements. The proposed logic is a combination of quantitative uncertainty logic and basic hybrid logic with a satisfaction operator. We show that it is expressive enough for the specification of many well-known data privacy requirements, such as &amp;lt;math&amp;gt;k&amp;lt;\/math&amp;gt;-anonymity, &amp;lt;math&amp;gt;l&amp;lt;\/math&amp;gt;-diversity and its precursor  logical safety, &amp;lt;math&amp;gt;t&amp;lt;\/math&amp;gt;-closeness, and &amp;lt;math&amp;gt;\u03b4&amp;lt;\/math&amp;gt;-disclosure privacy. The main contribution of the work is twofold. On one hand, the logic provides a common ground to express and compare existing privacy criteria. On the other hand, the uniform framework can meet the specification needs of combining new criteria as well as  existing ones.<\/jats:p>","DOI":"10.29007\/xs4z","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:57:36Z","timestamp":1516730256000},"page":"157-145","source":"Crossref","is-referenced-by-count":0,"title":["Logic, Probability, and Privacy: A Framework for Specifying Privacy Requirements"],"prefix":"10.29007","volume":"10","author":[{"given":"Tsan-Sheng","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Churn-Jung","family":"Liau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Da-Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"Turing-100. The Alan Turing Centenary"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:57:42Z","timestamp":1516730262000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/Kc"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/xs4z","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}