First Page | Document Content | |
---|---|---|
Date: 2018-10-23 14:58:02Cryptography 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 KohlweissAdd to Reading ListSource URL: smeiklej.comDownload Document from Source WebsiteFile Size: 498,11 KBShare Document on Facebook |