Unlinkable Divisible Electronic Cash
نویسندگان
چکیده
Recently, some divisible electronic cash (e-cash) systems have been proposed. However, in existing divisible e-cash systems, efficiency or unlinkability is not sufficiently accomplished. In the existing efficient divisible cash systems, all protocols are conducted in the order of the polynomial of logN where N is the divisibility precision (i.e., (the total coin amount)/ (minimum divisible unit amount)), but payments divided from a coin are linkable (i.e., anyone can decide whether the payments are made by the same payer). The linked payments help anyone to trace the payer, if N is large. On the other hand, in the existing unlinkable divisible e-cash system, the protocols are conducted in the order of the polynomial of N , and thus it is inefficient for large N . In this paper, an unlinkable divisible e-cash system is proposed, where all protocols are conducted in the order of (logN).
منابع مشابه
An Unlinkable Divisible Electronic Cash with User’s Less Computations Using Active Trustees
E-cash should satisfy the unlinkability and divisibility, for the privacy protection and the convenience, respectively. In the existing unlinkable divisible e-cash system, the user suffers from the inefficiency of the payment protocol, because of the vast computations of zero-knowledge proofs. This paper proposes an improved system, where the user’s load is vastly reduced. Instead of the user, ...
متن کاملEasy Come - Easy Go Divisible Cash
Recently, there has been an interest in creating practical anonymous electronic cash with the ability to conduct payments of exact amounts, as is typically the practice in physical payment systems. The most general solution for such payments is to allow electronic coins to be divisible (e.g., each coin can be spent incrementally but total purchases are limited to the monetary value of the coin)...
متن کاملUnlinkable Divisible Digital Cash without Trusted Third Party
We present an efficient divisible digital cash scheme which is unlinkable and does not require Trusted Third Party. The size of the coin is proportional to the size of the primes we use, i.e., hundreds of bytes. The computational and communication complexity of the protocol is proportional to a polynomial of the size of the primes and polylogarithm of the maximum number of pieces to which a coi...
متن کاملAn Efficient Online Electronic Cash with Unlinkable Exact Payments
Though there are intensive researches on off-line electronic cash (e-cash), the current computer network infrastructure sufficiently accepts on-line e-cash. The on-line means that the payment protocol involves with the bank, and the off-line means no involvement. For customers’ privacy, the e-cash system should satisfy unlinkability, i.e., any pair of payments is unlinkable w.r.t. the sameness ...
متن کاملDetachable Electronic Coins
We propose a non-divisible electronic cash system that combines the restrictive blind signature technique and a batch signature scheme based upon the binary tree structure. Contemporary electronic cash solutions rely on the divisibility paradigm to achieve significant computational savings, and such techniques are considered to be the most efficient. We demonstrate an alternative approach that ...
متن کامل