DCAP: A Secure and Efficient Decentralized Conditional Anonymous Payment System Based on Blockchain
- 27 January 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 15 (15566013) , 2440-2452
Abstract
Blockchain, a distributed ledger technology, can potentially be deployed in a wide range of applications. Among these applications, decentralized payment systems (e.g. Bitcoin) have been one of the most mature blockchain applications with widespread adoption. While the early designs (e.g. Bitcoin) are often the currency of choice by cybercriminals (e.g., in ransomware incidents), they only provide pseudo-anonymity, in the sense that anyone can deanonymize Bitcoin transactions by using information in the blockchain. To strengthen the privacy protection of decentralized payment systems, a number of solutions such as Monero and Zerocash have been proposed. However, completely Decentralized Anonymous Payment (DAP) systems can be criminally exploited, for example in online extortion and money laundering activities. Recognizing the importance of regulation, we present a novel definition of Decentralized Conditional Anonymous Payment (DCAP) and describe the corresponding security requirements. In order to construct a concrete DCAP system, we first design a Condition Anonymous Payment (CAP) scheme (based on our proposed signature of knowledge), whose security can be demonstrated under the defined formal semantic and security models. To demonstrate utility, we compare the performance of our proposal with that of Zerocash under the same parameters and testing environment.Keywords
This publication has 27 references indexed in Scilit:
- Mixcoin: Anonymity for Bitcoin with Accountable Mixes2014
- An Analysis of Anonymity in Bitcoin Using P2P Network Traffic2014
- Challenges and Opportunities Associated with a Bitcoin-Based Transaction Rating System2014
- Zerocoin: Anonymous Distributed E-Cash from Bitcoin2013
- Quantitative Analysis of the Full Bitcoin Transaction Graph2013
- On the Non-malleability of the Fiat-Shamir Transform2012
- On Signatures of Knowledge2006
- Pairing-Friendly Elliptic Curves of Prime Order2006
- Robust Non-interactive Zero Knowledge2001
- Auditable, Anonymous Electronic Cash1999