ISCAS OpenIR
Formalizing provable anonymity in Isabelle/HOL
Li, Yongjian (1); Pang, Jun (3); Li, Yongjian
2014
SourceFormal Aspects of Computing
ISSN9345043
English AbstractWe 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.
Indexed TypeEI
Department(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
Language英语
WOS IDWOS:000349854100003
Citation statistics
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/17014
Collection中国科学院软件研究所
Corresponding AuthorLi, Yongjian
Recommended Citation
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).
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li, Yongjian (1)]'s Articles
[Pang, Jun (3)]'s Articles
[Li, Yongjian]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li, Yongjian (1)]'s Articles
[Pang, Jun (3)]'s Articles
[Li, Yongjian]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li, Yongjian (1)]'s Articles
[Pang, Jun (3)]'s Articles
[Li, Yongjian]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

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