A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
On blind signatures and perfect crimes
Computers and Security
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
How To Break and Repair A "Provably Secure" Untraceable Payment System
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Divisible Electronic Cash Scheme
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Unlinkable Electronic Coupon Protocol with Anonymity Control
ISW '99 Proceedings of the Second International Workshop on Information Security
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Co-operatively Formed Group Signatures
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
A Group Signature Scheme Committing the Group
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Divisible E-Cash Systems Can Be Truly Anonymous
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Practical Anonymous Divisible E-Cash from Bounded Accumulators
Financial Cryptography and Data Security
Recent Advances in Electronic Cash Design
CARDIS '08 Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Anonymous authentication with optional shared anonymity revocation and linkability
CARDIS'06 Proceedings of the 7th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
A study on the e-cash system with anonymity and divisibility
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Towards secure mobile agent based e-cash system
Proceedings of the First International Workshop on Security and Privacy Preserving in e-Societies
A universally composable scheme for electronic cash
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Fuzzy virtual card agent for customizing divisible card payments
EC-Web'05 Proceedings of the 6th international conference on E-Commerce and Web Technologies
Multiple denominations in e-cash with compact transaction data
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Divisible e-cash in the standard model
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
| Hi-index | 0.00 |
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 log N 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 (log N)2.