QQ客服 官方微博 反馈留言

	Metrics for differential privacy in concurrent systems
	Xu, Lili (1) ; Chatzikokolakis, Konstantinos (2) ; Lin, Huimin (4)
	2014
会议名称	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
会议日期	June 3, 2014 - June 5, 2014
会议地点	Berlin, Germany
页码	199-215
中文摘要	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.
英文摘要	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.
收录类别	EI
会议录出版地	Springer Verlag
语种	英语
ISSN号	3029743
ISBN号	9783662436127
内容类型	会议论文
源URL	[http://ir.iscas.ac.cn/handle/311060/16603]
专题	软件研究所_软件所图书馆_会议论文
推荐引用方式 GB/T 7714	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.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。