Formalizing provable anonymity in Isabelle/HOL

CORC > 软件研究所 > 软件所图书馆 > 期刊论文

	Formalizing provable anonymity in Isabelle/HOL
	Li, Yongjian (1) ; Pang, Jun (3)
刊名	Formal Aspects of Computing
	2014
ISSN号	9345043
通讯作者	Li, Yongjian
中文摘要	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
语种	英语
WOS记录号	WOS:000349854100003
公开日期	2014-12-16
内容类型	期刊论文
源URL	[http://ir.iscas.ac.cn/handle/311060/17014]
专题	软件研究所_软件所图书馆_期刊论文
推荐引用方式 GB/T 7714	Li, Yongjian ,Pang, Jun . Formalizing provable anonymity in Isabelle/HOL[J]. Formal Aspects of Computing,2014.
APA	Li, Yongjian ,&Pang, Jun .(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).