中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
Metrics for differential privacy in concurrent systems
Author: Xu, Lili (1) ; Chatzikokolakis, Konstantinos (2) ; Lin, Huimin (4)
Conference Name: 34th IFIPWG6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2014 - Held as Part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014
Conference Date: June 3, 2014 - June 5, 2014
Issued Date: 2014
Conference Place: Berlin, Germany
Publish Place: Springer Verlag
Indexed Type: EI
ISSN: 3029743
ISBN: 9783662436127
Department: (1) INRIA, Paris, France; (2) CNRS, Paris, France; (3) Ecole Polytechnique, Paris, France; (4) Institute of Software, Chinese Academy of Sciences, Beijing, China; (5) Graduate University, Chinese Academy of Sciences, Beijing, China
Abstract: Originally proposed for privacy protection in the context of statistical databases, differential privacy is now widely adopted in various models of computation. In this paper we investigate techniques for proving differential privacy in the context of concurrent systems. Our motivation stems from the work of Tschantz et al., who proposed a verification method based on proving the existence of a stratified family between states, that can track the privacy leakage, ensuring that it does not exceed a given leakage budget. We improve this technique by investigating a state property which is more permissive and still implies differential privacy. We consider two pseudometrics on probabilistic automata: The first one is essentially a reformulation of the notion proposed by Tschantz et al. The second one is a more liberal variant, relaxing the relation between them by integrating the notion of amortisation, which results into a more parsimonious use of the privacy budget. We show that the metrical closeness of automata guarantees the preservation of differential privacy, which makes the two metrics suitable for verification. Moreover we show that process combinators are non-expansive in this pseudometric framework. We apply the pseudometric framework to reason about the degree of differential privacy of protocols by the example of the Dining Cryptographers Protocol with biased coins. © 2014 IFIP International Federation for Information Processing.
English Abstract: Originally proposed for privacy protection in the context of statistical databases, differential privacy is now widely adopted in various models of computation. In this paper we investigate techniques for proving differential privacy in the context of concurrent systems. Our motivation stems from the work of Tschantz et al., who proposed a verification method based on proving the existence of a stratified family between states, that can track the privacy leakage, ensuring that it does not exceed a given leakage budget. We improve this technique by investigating a state property which is more permissive and still implies differential privacy. We consider two pseudometrics on probabilistic automata: The first one is essentially a reformulation of the notion proposed by Tschantz et al. The second one is a more liberal variant, relaxing the relation between them by integrating the notion of amortisation, which results into a more parsimonious use of the privacy budget. We show that the metrical closeness of automata guarantees the preservation of differential privacy, which makes the two metrics suitable for verification. Moreover we show that process combinators are non-expansive in this pseudometric framework. We apply the pseudometric framework to reason about the degree of differential privacy of protocols by the example of the Dining Cryptographers Protocol with biased coins. © 2014 IFIP International Federation for Information Processing.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16603
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Xu, Lili ,Chatzikokolakis, Konstantinos ,Lin, Huimin . Metrics for differential privacy in concurrent systems[C]. 见:34th IFIPWG6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2014 - Held as Part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014. Berlin, Germany. June 3, 2014 - June 5, 2014.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Xu, Lili (1)]'s Articles
[Chatzikokolakis, Konstantinos (2)]'s Articles
[Lin, Huimin (4)]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Xu, Lili (1)]‘s Articles
[Chatzikokolakis, Konstantinos (2)]‘s Articles
[Lin, Huimin (4)]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2022  中国科学院软件研究所 - Feedback
Powered by CSpace