Back to Results
First PageMeta Content
Cryptography / Computational complexity theory / Proof of knowledge / Zero-knowledge proof / FiatShamir heuristic / Malleability / Applied mathematics


Succinct Malleable NIZKs and an Application to Compact Shuffles Melissa Chase Microsoft Research Redmond Markulf Kohlweiss
Add to Reading List

Document Date: 2018-10-23 14:58:02

Open Document

File Size: 498,11 KB

Share Result on Facebook
UPDATE