How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th 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
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
New Protocols for Electronic Money
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Unlinkable Divisible Electronic Cash
ISW '00 Proceedings of the Third International Workshop on Information Security
Decision Oracles are Equivalent to Matching Oracles
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
On monotone formula closure of SZK
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Proving in zero-knowledge that a number is the product of two safe primes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient concurrent zero-knowledge in the auxiliary string model
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
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
Transferable Constant-Size Fair E-Cash
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
A conceptual framework for specification, analysis, and design of anonymity services
Proceedings of the 2009 EDBT/ICDT Workshops
Provably secure integrated on/off-line electronic cash for flexible and efficient payment
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Proof-of-knowledge of representation of committed value and its applications
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Electronic cash with anonymous user suspension
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Multiple denominations in e-cash with compact transaction data
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Efficient schemes for anonymous yet authorized and bounded use of cloud resources
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
Anonymous reputation based reservations in e-commerce (amnesic)
Proceedings of the 13th International Conference on Electronic Commerce
Divisible e-cash in the standard model
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
| Hi-index | 0.00 |
This paper presents an off-line divisible e-cash scheme where a user can withdraw a divisible coin of monetary value 2Lthat he can parceled and spend anonymously and unlinkably. We present the construction of a security tag that allows to protect the anonymity of honest users and to revoke anonymity only in case of cheat for protocols based on a binary tree structure without using a trusted third party. This is the first divisible e-cash scheme that provides both full unlinkability and anonymity without requiring a trusted third party.