A Case Study of Model Checking Retail Banking System with SPIN

Shi, Huiling; Ma, Wen-ke; Yang, Meihong; Zhang, Xinchang

doi:10.4304/jcp.7.10.2503-2510

Cited by 17 publications

(14 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Model checking is one of the most promising techniques to address the security properties, and it has been widely used for verifying and analyzing the wireless network security protocols. 10,44,45…”

Section: Disadvantagesmentioning

confidence: 99%

A secure end‐to‐end SMS‐based mobile banking protocol

Bojjagani

Sastry

2017

Int J Communication

View full text Add to dashboard Cite

Short message service (SMS) provides a wide channel of communication for banking in mobile commerce and mobile payment. The transmission of SMS is not secure in the network using global system for mobile communications or general packet radio service. Security threats in SMS restricted the use of SMS in mobile banking within certain limits. This paper proposed a model to address the security of SMS using elliptic curve cryptography. The proposed model provides end-to-end SMS communication between the customer and the bank through the mobile application. The main objective of the proposed model is to design and develop a security framework for SMS banking. Further, the protocol is verified for its correctness and security properties because most of the protocols are not having the facility to be verified by using the formal methods. Our proposed framework is experimentally validated by formal methods using model checking tool called automated validation of internet security protocols and Scyther tools. Security analysis shows that the proposed mechanism works better compared to existing SMS payment protocols for real-world applications.

show abstract

Section: Disadvantagesmentioning

confidence: 99%

A secure end‐to‐end SMS‐based mobile banking protocol

Bojjagani

Sastry

2017

Int J Communication

View full text Add to dashboard Cite

show abstract

“…GPVW algorithm has been applied in SPIN [8]. [9], [10] presented a GBA simplification method which use the table-filling algorithm of DFA. [11], [12] improved simplification method of GBA by using Fair (Bi)Simulation or Delayed (Bi)Simulation.…”

Section: Related Workmentioning

confidence: 99%

Conversion Algorithm of Linear-Time Temporal Logic to Buchi Automata

Shan¹,

Qin²,

Li³

et al. 2014

JSW

View full text Add to dashboard Cite

The size of Büchi Automata(BA) is a key factor during converting Linear-Time Temporal Logic(LTL) formulae to BA in model checking. Most algorithms for generating BA from LTL formulas involved intermediate automata, degeneralization algorithm and simplification of the formulas, but size of BA and time of converting can be reduced further. In this paper, we present an improved Tableau-based algorithm, which converts LTL formulae to Transition-based Büchi Automata(TBA) more efficiently. The algorithm is geared towards being used in model checking in on-the-fly fashion. By attaching the satisfy information of ∪-formula on states and transitions, we can decide whether the sequences of the BA are acceptable by using only one acceptance condition set, not multiple ones. Binary Decision Diagrams(BDD) is used to describe BA and simplify formulae. A better data structure, syntax Directed Acyclic Graph(DAG), is adopted in the algorithm. The size of product BA and computational complexity can be reduced significantly by using on-the-fly degeneralization. The algorithm can expand the state nodes while detecting the validity of nodes, removing the invalid nodes and combining equivalent states and transitions. Compared with other recent conversion tools, the algorithm proposed in this paper runs faster, with the smaller size of BA.

show abstract

“…Therefore, SPIN is a tool suitable for verifying communication protocols [6]. Other verification techniques are also studied in the literature [7] [8] [9] [10].…”

Section: Introductionmentioning

confidence: 99%

Model Checking the Convergence Property of BGP Networks

Yin¹,

Ma²,

Chen³

2014

JSW

View full text Add to dashboard Cite

The Border Gateway Protocol (BGP) is an important inter-domain routing protocol, which is widely used in Internet. It allows independent policies to be designed for each Autonomous System (AS). However, the flexibility in designing independent policies causes the convergence problem, i.e., a BGP network may constantly send routing information between ASes and cannot reach a stable state. In this paper, we propose an approach for model checking the convergence property of BGP networks. We firstly establish a formal model of BGP networks and define its convergence property. Then we use the Promela language to describe this model and analyze its convergence. The model is generic enough, thus different instances of BGP networks can be simulated and verified by only modifying parameters and policies. Finally, as examples, we simulate and verify some typical instances of BGP networks by using the SPIN model checker.

show abstract

A Case Study of Model Checking Retail Banking System with SPIN

Cited by 17 publications

References 4 publications

A secure end‐to‐end SMS‐based mobile banking protocol

A secure end‐to‐end SMS‐based mobile banking protocol

Conversion Algorithm of Linear-Time Temporal Logic to Buchi Automata

Model Checking the Convergence Property of BGP Networks

Contact Info

Product

Resources

About