ISCAS OpenIR
Formalizing provable anonymity in Isabelle/HOL
Li, Yongjian (1); Pang, Jun (3); Li, Yongjian
2014
发表期刊Formal Aspects of Computing
ISSN9345043
摘要We formalize in a theorem prover the notion of provable anonymity. Our formalization relies on inductive definitions of message distinguishing ability and observational equivalence on traces observed by the intruder. Our theory differs from its original proposal and essentially boils down to the inductive definition of distinguishing messages with respect to a knowledge set for the intruder. We build our theory in Isabelle/HOL to achieve a mechanical framework for the analysis of anonymity protocols. Its feasibility is illustrated through two case studies of the Crowds and Onion Routing protocols.; We formalize in a theorem prover the notion of provable anonymity. Our formalization relies on inductive definitions of message distinguishing ability and observational equivalence on traces observed by the intruder. Our theory differs from its original proposal and essentially boils down to the inductive definition of distinguishing messages with respect to a knowledge set for the intruder. We build our theory in Isabelle/HOL to achieve a mechanical framework for the analysis of anonymity protocols. Its feasibility is illustrated through two case studies of the Crowds and Onion Routing protocols.
收录类别EI
部门归属(1) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.O. Box 8717, Beijing, China; (2) College of Information Engineering, Capital Normal University, Beijing, China; (3) Computer Science and Communications, Faculty of Science, Technology and Communication, University of Luxembourg, Walferdange, Luxembourg; (4) Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, Walferdange, Luxembourg
语种英语
WOS记录号WOS:000349854100003
引用统计
内容类型期刊论文
URI标识http://ir.iscas.ac.cn/handle/311060/17014
专题中国科学院软件研究所
通讯作者Li, Yongjian
推荐引用方式
GB/T 7714
Li, Yongjian ,Pang, Jun ,Li, Yongjian. Formalizing provable anonymity in Isabelle/HOL[J]. Formal Aspects of Computing,2014.
APA Li, Yongjian ,Pang, Jun ,&Li, Yongjian.(2014).Formalizing provable anonymity in Isabelle/HOL.Formal Aspects of Computing.
MLA Li, Yongjian ,et al."Formalizing provable anonymity in Isabelle/HOL".Formal Aspects of Computing (2014).
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Li, Yongjian (1)]的文章
[Pang, Jun (3)]的文章
[Li, Yongjian]的文章
百度学术
百度学术中相似的文章
[Li, Yongjian (1)]的文章
[Pang, Jun (3)]的文章
[Li, Yongjian]的文章
必应学术
必应学术中相似的文章
[Li, Yongjian (1)]的文章
[Pang, Jun (3)]的文章
[Li, Yongjian]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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