An Association Ring Signature for Block Chain E-Money Transactions

Citation metadata

Date: Apr. 2019
Publisher: Springer
Document Type: Report
Length: 358 words

Document controls

Main content

Abstract :

Byline: Kai Yang (1), Mingsheng Hu (1), Zhijuan Jia (1), Bei Gong (1), Xiaofei Zhang (1) Keywords: block chain; ring signature; strong anonymity; relevance; TP 309 Abstract: Block chain is widely used in the financial field for its characteristics of decentralization, anonymity and trust. Electronic money payment is an important application hotspot. Ring signature is widely used in strong anonymous authentication such as electronic cash and electronic voting because of its unconditional anonymity, spontaneity and flexible group structure. Among them, the correlation ring signature can prove whether two signatures are issued by the same person without revealing the identity of the real signer. Therefore, the signature right breach can be avoided based on the premise of guaranteeing anonymity, such as repeated voting, electronic money repetition cost and so on. Most of the existing correlation ring signature security is based on the discrete logarithm problem, and most of the schemes result in the degradation of anonymity because of strong association. These methods do not apply to the block chain electronic currency transaction scene with strong anonymity. Therefore, this paper first proposes a blockchain-based electronic currency transaction security model. The model ensures not only the anonymity of both parties but also a certain degree of traceability. In order to support these two characteristics, this paper proposes an association ring signature method based on large integer decomposition problem. This method has strong anonymity and can be applied to blockchain scenes. On the other hand, it can be converted into group signatures in specific scenarios. It is therefore traceable. Finally, the adaptive selection message of the scheme and the unforgeability under the selection of public key attack are proved under the random oracle model. Author Affiliation: (1) 0000 0001 0089 5666, grid.495488.c, School of Information Science and Technology, Zhengzhou Normal University, Zhengzhou, Henan, 450044, China Article History: Registration Date: 19/03/2019 Received Date: 17/10/2018 Online Date: 20/03/2019 Article note: Foundation item: Supported by the National Natural Science Foundation of China(U1304614, U1204703), the Construct Program of the Key Discipline in Zhengzhou Normal University, Aid Program for Science and Technology Innovative Research Team of Zhengzhou Normal University, Henan Province Education Science Plan General Topic ((2018)-JKGHYB-0279)

Source Citation

Source Citation   

Gale Document Number: GALE|A579551808