A Commitment-Consistent Proof of a Shuﬄe Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drastically

First Page		Document Content
Date: 2012-05-30 08:52:53 Cryptography 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 Shuﬄe Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drastically Add to Reading List Source URL: www.nada.kth.se Download Document from Source Website File Size: 280,75 KB Share Document on Facebook

	A Commitment-Consistent Proof of a Shuﬄe Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drastically DocID: 1r7EK - View Document
	Privacy-Preserving Billing for e-Ticketing Systems in Public Transportation Florian Kerschbaum Hoon Wei Lim DocID: 1qTmM - View Document
	LNCSHow to Shuffle in Public DocID: 1qrL2 - View Document
	Privacy-Preserving Computation (Position Paper) Florian Kerschbaum SAP Research Karlsruhe, Germany DocID: 1qobl - View Document
	LNCSOffline/Online Mixing DocID: 1q03i - View Document