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 |
A Commitment-Consistent Proof of a Shuffle Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drasticallyDocID: 1r7EK - View Document | |
Privacy-Preserving Billing for e-Ticketing Systems in Public Transportation Florian Kerschbaum Hoon Wei LimDocID: 1qTmM - View Document | |
LNCSHow to Shuffle in PublicDocID: 1qrL2 - View Document | |
Privacy-Preserving Computation (Position Paper) Florian Kerschbaum SAP Research Karlsruhe, GermanyDocID: 1qobl - View Document | |
LNCSOffline/Online MixingDocID: 1q03i - View Document |