Search arXivSearch

arXiv · 1706.10078

Novel Logical Method for Security Analysis of Electronic Payment Protocols

Abstract

Electronic payment protocols play a vital role in electronic commerce security, which is essential for secure operation of electronic commerce activities. Formal method is an effective way to verify the security of protocols. But current formal method lacks the description and analysis of timeliness in electronic payment protocols. In order to improve analysis ability, a novel approach to analyze security properties such as accountability, fairness and timeliness in electronic payment protocols is proposed in this paper. This approach extends an existing logical method by adding a concise time expression and analysis method. It enables to describe the event time, and extends the time characteristics of logical inference rules. We analyzed the Netbill protocol with the new approach and found that the fairness of the protocol is not satisfied, due to timeliness problem. The result illustrates the new approach is able to analyze the key properties of electronic payment protocols. Furthermore, the new approach can be introduced to analyze other time properties of cryptographic protocols.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yi Liu, Xingtong Liu, Lei Zhang, Jian Wang, Chaojing Tang. 2017-06-30. Novel Logical Method for Security Analysis of Electronic Payment Protocols. https://doi.org/10.1587/transinf.2018edp7108

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Probabilistic Choreography Language for PRISM

We present a choreographic framework for modelling and analysing concurrent probabilistic systems based on the PRISM model-checker. This is achieved through the development of a choreography language, which is a specification language that allows to describe the desired interactions within a concurrent system from a global viewpoint. Using choreographies gives a clear and complete view of system interactions, making it easier to understand the process flow and identify potential errors, which helps ensure correct execution and improves system reliability. We equip our language with a probabilistic semantics and then define a formal encoding into the PRISM language and discuss its correctness. Properties of programs written in our choreographic language can be model-checked by the PRISM model-checker via their translation into the PRISM language. Finally, we implement a compiler for our language and demonstrate its practical applicability via examples drawn from the use cases featured in the PRISM website.

cs.LO

Monotone weak distributive laws over the lifted powerset monad in categories of algebras

Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminism in sets and in compact Hausdorff spaces, we study whether the latter law can be obtained automatically as a weak lifting of the former. This holds partially, but does not generalize to other categories of algebras: we then characterize when exactly monotone weak distributive laws over powerset monads in categories of algebras exist, exhibiting a law combining probabilities and non-determinism in compact Hausdorff spaces and showing on the other hand that such laws do not exist in a lot of other cases.

cs.LO

Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas

First-order logic is the basis for many knowledge representation formalisms and methods. Providing technological support for learning to write first-order formulas for natural language specifications requires methods to test formulas for (non-)equivalence and to provide explanations for non-equivalence. We propose such methods based on both theoretical insights and existing tools, implement them, and report on experiments testing their effectiveness on a large educational data set with > 100,000 pairs of first-order formulas.

cs.LO