A non-interactive electronic cash system
CIAC '94 Proceedings of the second Italian conference on Algorithms and complexity
Communication Efficient Zero-Knowledge Proofs of Knowledge (With Applications to Electronic Cash)
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Transferred cash grows in size
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
How to break another "provably secure" payment system
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
In this extended abstract we present an unpublished result in [6] which extends a result in [4]. We give a non-interactive zero-knowledge proof system of knowledge with preprocessing, whose main property is that, after executing two preprocessing phases and given a transcript of a proof phase, the verifier is not able to relate the transcript to any of the two preprocessing phases significantly better than random guessing. The technique used has motivated the cash scheme in [3]. Because of this result, only mentioned but used in [3], the main observation of Pfitzmann et al. in [8] against the cash scheme in [3] doesn't hold. We also discuss the other observations of Pfitzmann et al. in [8] against the cash schemes in [3, 5] and show that all of them don't hold. As a conclusion, the cash schemes in [3, 5] are not broken at all.