当前位置: X-MOL 学术IEEE Trans. Dependable Secure Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Compact E-Cash with Efficient Coin-Tracing
IEEE Transactions on Dependable and Secure Computing ( IF 7.3 ) Pub Date : 2021-01-01 , DOI: 10.1109/tdsc.2018.2882507
Bin Lian , Gongliang Chen , Jialin Cui , Maode Ma

Compact E-cash achieves an efficient system by withdrawing ${\text{2}}^{n}$2n coins within $O{\text{(1)}}$O(1) operations and storing the coins in $O(n)$O(n) bits. For preventing a double-spender from cheating again, it is necessary to trace his e-coins. So full-tracing in compact E-cash system means tracing double-spender and tracing his coins. However, the efficiency problem caused by coin-tracing without TTP (trusted third party) has not been solved. For solving this problem, we introduce a non-standard construction into zero-knowledge proof of payment protocol, which leaks coin information when double-spending but is proven to be perfect zero-knowledge to verifier when spending a coin only once. Therefore, it achieves tracing dishonest users’ coins and preserving the anonymity of honest users. Comparing with the existing most efficient method of coin-tracing without TTP, we improve computational complexity from $O(k)$O(k) to $O{\text{(1)}}$O(1) with less storage space. In addition, to improve efficiency and practicality further, batch-spending (spending any number of coins in one operation) and compact-spending (spending all coins in one operation) had been proposed. Based on the non-standard zero-knowledge proof, our scheme provides more efficient batch/compact–spending. Moreover, we also make a comparison with Bitcoin and Bitcoin Lightning Network, which have attracted considerable attention.

中文翻译:

具有高效硬币追踪功能的紧凑型电子现金

Compact E-cash通过取款实现高效系统 ${\text{2}}^{n}$2n 里面的硬币 $O{\text{(1)}}$(1) 操作和存储硬币 $O(n)$(n)位。为了防止双重支付者再次作弊,有必要追踪他的电子币。因此,在紧凑型电子现金系统中进行全面追踪意味着追踪双重支付者并追踪他的硬币。然而,没有TTP(可信第三方)的硬币追踪导致的效率问题并没有得到解决。为了解决这个问题,我们在支付协议的零知识证明中引入了一种非标准的结构,它在双花时会泄漏硬币信息,但在只花一次硬币时被证明是完美的零知识证明。因此,它实现了追踪不诚实用户的硬币并保护诚实用户的匿名性。与现有最有效的没有 TTP 的硬币追踪方法相比,我们提高了计算复杂度$O(k)$()$O{\text{(1)}}$(1)更少的存储空间。此外,为了进一步提高效率和实用性,还提出了批量支出(在一次操作中花费任意数量的硬币)和紧凑支出(在一次操作中花费所有硬币)。基于非标准的零知识证明,我们的方案提供了更高效的批量/紧凑支出。此外,我们还与备受关注的比特币和比特币闪电网络进行了比较。
更新日期:2021-01-01
down
wechat
bug