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 | Add to Reading List |
![]() | 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 |