DT-CP: A Double-TTPs-Based Contract-Signing Protocol With Lower Computational Cost

Guangquan Xu,Yao Zhang,Kaitai Liang,Xiaotong Li,Litao Jiao,Hao Wang,Emmanouil Panaousis

doi:10.1109/access.2019.2952213

Abstract

This paper characterizes a contract signing protocol with high efficiency in Internet of Things. Recent studies show that existing contract-signing protocols can achieve abuse-freeness and resist inference attack, but cannot meet the high-efficiency and convenience requirement of the future Internet of things applications. To solve this problem, we propose a novel contract-signing protocol. Our proposed protocol includes two main parts: 1) we use the partial public key of the sender, instead of the zero-knowledge protocol, to verify the intermediate result; 2) we employ two independent Trusted Third Parties (TTPs) to prevent the honest-but-curious TTP. Our analysis shows that our double TTP protocol can not only result in lower computational cost, but also can achieve abuse-freeness with trapdoor commitment scheme. In a word, our proposed scheme performs better than the state of the art in terms of four metrics: encryption time, number of exponentiations, data to be exchanged and exchange steps in one round contract-signing.

Highlights

Internet of Things (IoT) has been called ‘‘the Industrial Revolution’’ because of the rapid growth and how it’s changing the way people live, and interact
If a customer needs to subscribe an E-journal, an online contract is required to be signed by the customer and the IoT supporter, and these smart device help you connect to the journal company
During the signature exchange protocol, after Bob received (CA, V1, V2, σ1, e1, t1, t2) from Alice, he is required to check whether e1 is valid via the trapdoor commitment verification algorithm r1 = TCvrfy(e1, t1) and r2 = TCvrfy(e1, t2)

Summary

INTRODUCTION

Internet of Things (IoT) has been called ‘‘the Industrial Revolution’’ because of the rapid growth and how it’s changing the way people live, and interact. If Alice and Bob (for convenient, we call the sender Alice and the receiver Bob) are resigning a protocol by TTP-free, whenever any of the two participants terminates prematurely, both of them can still complete the exchange offline by exhaustively searching the remaining bits of the signatures It is impractical for most real-word applications this approach enjoys the great advantage of being TTP-free. Park et al [16] proposed an approach for constructing fair-exchange protocols They employed RSA-based multisignatures to construct efficient optimistic protocols. To solve this problem, Wang [22] proposed a contract-signing protocol for two mutually distrusted parties based on RSA multi-signature. To improve the efficiency of former researches, a new contract-signing protocol is proposed for two mutually distrusted parties in our work.

RELATED WORK

SIGATURE EXCHANGE

DISCUSSION

CONCLUSION AND FUTURE WORK