Formalizing provable anonymity in Isabelle/HOL-Reference-Cited by-同舟云学术

Formalizing provable anonymity in Isabelle/HOL

Published:2015-03 Issue:2 Volume:27 Page:255-282
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Li Yongjian¹²,Pang Jun³⁴

Affiliation:

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

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-014-0315-x.pdf

Reference43 articles.

1. Deciding knowledge in security protocols under equational theories

2. Automated verification of selected equivalences for security protocols

3. Baudet M (2005) Deciding security of protocols against off-line guessing attacks. In: Proceedings of 12th ACM conference on computer and communications security. ACM Press New York pp 16–25

4. Blanchet B (2001) An efficient cryptographic protocol verifier based on prolog rules. In: Proceedings of 14th IEEE computer security foundations workshop. IEEE Press New York pp 82–96

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automatic Algorithm Programming Model Based on the Improved Morgan's Refinement Calculus;Wuhan University Journal of Natural Sciences;2022-10

2. A Framework for Formal Analysis of Anonymous Communication Protocols;Security and Communication Networks;2022-05-02

3. Encoding Induction Proof in Dafny;2021 International Symposium on Theoretical Aspects of Software Engineering (TASE);2021-08

4. A Probabilistic Small Model Theorem to Assess Confidentiality of Dispersed Cloud Storage;Quantitative Evaluation of Systems;2017