Pinocchio coin: Building Zerocoin from a succinct pairing-based proof system

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2013, Pages 27-29

  Danezis, George ^a   Fournet, Cédric ^a   Kohlweiss, Markulf ^a   Parno, Bryan ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b MICROSOFT RESEARCH   (United States)

Author keywords

anonymous electronic cash; bitcoin; zero knowledge proofs; zerocoin

Indexed keywords

ANONYMOUS TRANSACTION; BILINEAR PAIRING; BITCOIN; ELECTRONIC CASH; MODERN TECHNIQUES; STRONG RSA ASSUMPTION; ZERO KNOWLEDGE PROOF; ZEROCOIN;

SECURITY OF DATA;

ELECTRONIC COMMERCE;

EID: 84889044813     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2517872.2517878     Document Type: Conference Paper

References (5)

1. Melissa Chase and Anna Lysyanskaya. On signatures of knowledge. In CRYPTO, 2006.
2. Rosario Gennaro, Craig Gentry, Bryan Parno, and Mariana Raykova. Quadratic span programs and succinct NIZKs without PCPs.In EUROCRYPT, 2013.
3. Kristiyan Haralambiev. Efficient cryptographic primitives for non-interactive zero-knowledge proofs and applications. PhD thesis, 2011.
4. Ian Miers, Christina Garman, Matthew Green, and Aviel D. Rubin. Zerocoin: Anonymous distributed e-cash from bitcoin. In IEEE Symposium on Security and Privacy, 2013.
5. Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. Pinocchio: Nearly practical verifiable computation. In IEEE Symposium on Security and Privacy, 2013.