First Page | Document Content | |
---|---|---|
Date: 2012-05-30 08:52:53Cryptography Public-key cryptography Computational complexity theory Paillier cryptosystem Proof of knowledge Commitment scheme RSA Zero-knowledge proof Permutation ElGamal encryption IP | A Commitment-Consistent Proof of a Shuffle Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drasticallyAdd to Reading ListSource URL: www.nada.kth.seDownload Document from Source WebsiteFile Size: 280,75 KBShare Document on Facebook |