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

First Page		Document Content
Date: 2018-10-23 14:58:02 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 Source URL: smeiklej.com Download Document from Source Website File Size: 498,11 KB Share Document on Facebook