First Page | Document Content | |
---|---|---|
Date: 2007-11-26 10:35:45Cryptography Ciphertext indistinguishability Paillier cryptosystem Probabilistic encryption CramerShoup cryptosystem ElGamal encryption Chosen-ciphertext attack Cryptosystem Advantage Trapdoor function Feistel cipher RSA | Easy Verifiable Primitives and Practical Public Key Cryptosystems David Galindo, Sebasti`a Mart´ın, Paz Morillo and Jorge L. Villar Dep. Matem` atica Aplicada IV. Universitat Polit`ecnica de Catalunya Campus Nord, c/JoAdd to Reading ListSource URL: www.dgalindo.esDownload Document from Source WebsiteFile Size: 195,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 |