How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Demonstrating possession of a discrete logarithm without revealing it
Proceedings on Advances in cryptology---CRYPTO '86
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th 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
Efficient Transferable Cash with Group Signatures
ISC '01 Proceedings of the 4th International Conference on Information Security
Proofs of Knowledge for Non-monotone Discrete-Log Formulae and Applications
ISC '02 Proceedings of the 5th International Conference on Information Security
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
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 proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security
Efficient non-interactive proof systems for bilinear groups
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
A verifiable random function with short proofs and keys
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
A digital cash protocol based on additive zero knowledge
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Balancing accountability and privacy using e-cash (extended abstract)
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Conditional e-payments with transferability
Journal of Parallel and Distributed Computing
Achieving optimal anonymity in transferable e-cash with a judge
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
| Hi-index | 0.00 |
Conditional e-cash or conditional e-payments have been introduced by Shi et al. as the means for enabling electronic payments to be based on the outcome of a certain condition not known in advance. In this framework, a payer obtains an electronic coin and can transfer it to a payee under a certain condition. Once the outcome of the condition is known, if it was favorable to the payee, the payee can deposit the coin; otherwise, the payer keeps the money. In this work, we formalize conditional payments and give a scheme to achieve conditional e-payments that outperforms the original solution in several respects.