Succinct Malleable NIZKs and an Application to Compact Shuffles

  title={Succinct Malleable NIZKs and an Application to Compact Shuffles},
  author={Melissa Chase and Markulf Kohlweiss and Anna Lysyanskaya and Sarah Meiklejohn},
  journal={IACR Cryptology ePrint Archive},
Depending on the application, malleability in cryptography can be viewed as either a flaw or — especially if sufficiently understood and restricted — a feature. In this vein, Chase, Kohlweiss, Lysyanskaya, and Meiklejohn recently defined malleable zero-knowledge proofs, and showed how to control the set of allowable transformations on proofs. As an application, they construct the first compact verifiable shuffle, in which one such controlled-malleable proof suffices to prove the correctness of… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 10 extracted citations

Symbolic Malleable Zero-Knowledge Proofs

2015 IEEE 28th Computer Security Foundations Symposium • 2015
View 4 Excerpts
Highly Influenced

Mergeable Functional Encryption

IACR Cryptology ePrint Archive • 2015

The Hunting of the SNARK

Journal of Cryptology • 2014
View 1 Excerpt


Publications referenced by this paper.
Showing 1-10 of 30 references

Quadratic Span Programs and Succinct NIZKs without PCPs

IACR Cryptology ePrint Archive • 2012
View 4 Excerpts
Highly Influenced

Short Pairing-Based Non-interactive Zero-Knowledge Arguments

View 7 Excerpts
Highly Influenced

Succinct malleable NIZKs and an application to compact shuffles

M. Chase, M. Kohlweiss, A. Lysyanskaya, S. Meiklejohn
Cryptology ePrint Archive , Report • 2012

Similar Papers

Loading similar papers…