Institutional Repository
| Formalizing provable anonymity in Isabelle/HOL | |
| Li, Yongjian (1); Pang, Jun (3); Li, Yongjian | |
| 2014 | |
| Source | Formal Aspects of Computing
![]() |
| ISSN | 9345043 |
| English Abstract | 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. |
| Indexed Type | EI |
| 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 ID | WOS:000349854100003 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/17014 |
| Collection | 中国科学院软件研究所 |
| Corresponding Author | Li, 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. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment