Pinocchio coin: building zerocoin from a succinct pairing-based proof system

George Danezis, Cédric Fournet, Markulf Kohlweiss, Bryan Parno

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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, longstanding 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.
Original languageEnglish
Title of host publicationPETShop'13, Proceedings of the 2013 ACM Workshop on Language Support for Privacy-Enhancing Technologies, Co-located with CCS 2013, November 4, 2013, Berlin, Germany
PublisherACM
Pages27-30
Number of pages4
ISBN (Electronic)978-1-4503-2489-2
DOIs
Publication statusPublished - 2013
EventPETShop '13 First ACM workshop on Language support for privacy-enhancing technologies - Berlin, Germany
Duration: 4 Nov 2013 → …

Conference

ConferencePETShop '13 First ACM workshop on Language support for privacy-enhancing technologies
Abbreviated titlePETShop '13 (CCS 2013)
CountryGermany
CityBerlin
Period4/11/13 → …

Fingerprint

Dive into the research topics of 'Pinocchio coin: building zerocoin from a succinct pairing-based proof system'. Together they form a unique fingerprint.

Cite this