2015
DOI: 10.1007/s10703-015-0232-5
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of anonymity and confidentiality protocols using theorem proving

Abstract: Anonymity and confidentiality protocols constitute crucial parts in many network applications as they ensure anonymous communications between entities in a network or provide security in insecure communication channels. Evaluating the properties of these protocols is therefore of paramount importance, especially in the case of safety-critical applications. However, traditional analysis techniques, like simulation, cannot ascertain accurate analysis in this domain. We propose to overcome this limitation by cond… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 23 publications
0
4
0
Order By: Relevance
“…eorem proving is an effective method when dealing with general systems of infinite state apace. e notion of provable anonymity theory was built in Isabelle/HOL to achieve a mechanical framework for the analysis of anonymity protocols [17,18]. Its feasibility is illustrated through two case studies of the Crowds and Onion Routing protocols.…”
Section: Related Workmentioning
confidence: 99%
“…eorem proving is an effective method when dealing with general systems of infinite state apace. e notion of provable anonymity theory was built in Isabelle/HOL to achieve a mechanical framework for the analysis of anonymity protocols [17,18]. Its feasibility is illustrated through two case studies of the Crowds and Onion Routing protocols.…”
Section: Related Workmentioning
confidence: 99%
“…Moreover, there is some other communication system including Mixes and Mixnet that have been studied with several 9 publications. Improving security and anonymity [38]- [42], presentation [36], [39], traffic inquiry [43] and assessment of anonymity [33], [42] are the ACS problems covered in the study [28]. AP3, ANODR (on-demand routing protocol for mobile ad hoc network), and Salsa are considered in four different studies.…”
Section: Anonymous Communication System For Fintechmentioning
confidence: 99%
“…Next, the authors built upon Lebesgue integral to formalize the Radon-Nikodym derivative and used it for formalizing the fundamentals of information theory, i.e., Shannon and relative entropies [64]. Later, Mhamdi et al [65] used the probabilistic analysis support developed in HOL4 to evaluate the security properties of the confidentiality protocols. A library for the formal probabilistic analysis has also been developed in Isabelle.…”
Section: Formal Probabilistic and Performance Analysismentioning
confidence: 99%