Formalizing provable anonymity in Isabelle/HOL

Li, Yongjian; Pang, Jun

doi:10.1007/s00165-014-0315-x

Cited by 5 publications

(4 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Isabelle [16][17][18][19] is an auxiliary theorem prover who provides theorem proving with strong theoretical and technical support. Compared with other traditional theorem provers, the Isabelle theorem prover has the following distinguishing features.…”

Section: Isabelle Theorem Provermentioning

confidence: 99%

See 1 more Smart Citation

Automatic Algorithm Programming Model Based on the Improved Morgan's Refinement Calculus

Zuo

Huang

et al. 2022

Wuhan Univ. J. Nat. Sci.

View full text Add to dashboard Cite

The automatic algorithm programming model can increase the dependability and efficiency of algorithm program development, including specification generation, program refinement, and formal verification. However, the existing model has two flaws: incompleteness of program refinement and inadequate automation of formal verification. This paper proposes an automatic algorithm programming model based on the improved Morgan's refinement calculus. It extends the Morgan's refinement calculus rules and designs the C++ generation system for realizing the complete process of refinement. Meanwhile, the automation tools VCG (Verification Condition Generator) and Isabelle are used to improve the automation of formal verification. An example of a stock's maximum income demonstrates the effectiveness of the proposed model. Furthermore, the proposed model has some relevance for automatic software generation.

show abstract

Section: Isabelle Theorem Provermentioning

confidence: 99%

“…6. Therefore the loop invariant could be defined as inv≡s=maxincome(m, P)Ù0<m≤n, which is similar to the postcondition(post≡s= maxincome(n, P) ≡invÙm=n), so the program specification could be replaced equivalently by m, s: [n>1, invÙm =n] [16] .…”

Section: Choosing the Invariantmentioning

confidence: 99%

Automatic Algorithm Programming Model Based on the Improved Morgan's Refinement Calculus

Zuo

Huang

et al. 2022

Wuhan Univ. J. Nat. Sci.

View full text Add to dashboard Cite

show abstract

“…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%

A Framework for Formal Analysis of Anonymous Communication Protocols

Yang

Xiao

2022

Security and Communication Networks

View full text Add to dashboard Cite

Anonymity is the property of keeping secret the identity of the user performing a certain action. The need for anonymity may arise in a wide range of situations, like electronic voting, Web browsing, and so on. In order to verify the anonymity of security protocols, a framework for formal analysis of anonymous communication protocols is proposed. In this framework, we define operational semantics for security protocols using a labelled transition system; the transition relation is defined by the transition rules, which include create rule, send rule, and receive rule. In addition, the formal description of intruder model in this framework is given. The proposed intruder model specifies the capabilities of the intruder and is weaker than the Dolev–Yao model. Moreover, the concepts of mapping and trace equivalence are proposed; the sender anonymity is formally defined. To illustrate the applicability of proposed framework, we explore the use of probabilistic model checking tool PRISM to analyze the sender anonymity of Crowds protocol. The experimental results show the relationship between sender anonymity and the number of nodes, path reformulations, and forwarding probability, which provides a good way about how to protect the sender anonymity of anonymous communication protocols.

show abstract

“…In our work we employed a passive intruder model, and indeed several authors agree that this is enough when analyzing confidentiality requirements. For example, Li and Pang [26], and Shmatikov [15] used passive intruders to verify anonymity of protocols, a special case of confidentiality. The latter work also considers probabilistic attacks.…”

Section: Related Workmentioning

confidence: 99%

Parametric and probabilistic model checking of confidentiality in data dispersal algorithms

Baldi

Cucchiarelli

Senigagliesi

et al. 2016

2016 International Conference on High Performance Computing &Amp; Simulation (HPCS)

View full text Add to dashboard Cite

Recent developments in cloud storage architectures have originated new models of online storage as cooperative storage systems and interconnected clouds. Such distributed environments involve many organizations, thus ensuring confidentiality becomes crucial: only legitimate clients should recover the information they distribute among storage nodes.In this work we present a unified framework for verifying confidentiality of dispersal algorithms against probabilistic models of intruders. Two models of intruders are given, corresponding to different types of attackers: one aiming at intercepting as many slices of information as possible, and the other aiming at attacking the storage providers in the network. Both try to recover the original information, given the intercepted slices. By using probabilistic model checking, we can measure the degree of confidentiality of the system exploring exhaustively all possible behaviors. Our experiments suggest that dispersal algorithms ensure a high degree of confidentiality against the slice intruder, no matter the number of storage providers in the system. On the contrary, they show a low level of confidentiality against the provider intruder in networks with few storage providers (e.g. interconnected cloud storage solutions).

show abstract

Formalizing provable anonymity in Isabelle/HOL

Cited by 5 publications

References 49 publications

Automatic Algorithm Programming Model Based on the Improved Morgan's Refinement Calculus

Automatic Algorithm Programming Model Based on the Improved Morgan's Refinement Calculus

A Framework for Formal Analysis of Anonymous Communication Protocols

Parametric and probabilistic model checking of confidentiality in data dispersal algorithms

Contact Info

Product

Resources

About