CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient cryptographic primitives for non-interactive zero-knowledge proofs and applications
Efficient cryptographic primitives for non-interactive zero-knowledge proofs and applications
Pinocchio: Nearly Practical Verifiable Computation
SP '13 Proceedings of the 2013 IEEE Symposium on Security and Privacy
Zerocoin: Anonymous Distributed E-Cash from Bitcoin
SP '13 Proceedings of the 2013 IEEE Symposium on Security and Privacy
| Hi-index | 0.00 |
Bitcoin is the first widely adopted distributed e-cash system and Zerocoin is a recent proposal to extend Bitcoin with anonymous transactions. The original Zerocoin protocol relies heavily on the Strong RSA assumption and double-discrete logarithm proofs, long-standing techniques with known performance restrictions. We show a variant of the Zerocoin protocol using instead elliptic curves and bilinear pairings. The proof system makes use of modern techniques based on quadratic arithmetic programs resulting in smaller proofs and quicker verification. We remark on several extensions to Zerocoin that are enabled by the general-purpose nature of these techniques.