First Page | Document Content | |
---|---|---|
![]() Date: 2006-05-19 13:27:55Ciphertext indistinguishability Paillier cryptosystem Semantic security Threshold cryptosystem Chosen-ciphertext attack Adaptive chosen-ciphertext attack ElGamal encryption RSA Optimal asymmetric encryption padding Cryptography Public-key cryptography Electronic commerce | Source URL: www.cs.berkeley.eduDownload Document from Source WebsiteFile Size: 528,09 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 |