A Commitment-Consistent Proof of a Shuffle
2009 (English)In: INFORMATION SECURITY AND PRIVACY, PROCEEDINGS / [ed] Boyd C, Nieto JG, Berlin: SPRINGER-VERLAG BERLIN , 2009, Vol. 5594, 407-421 p.Conference paper (Refereed)
We introduce a pre-computation technique that drastically reduces the online computational complexity of mix-nets based on homomorphic cryptosystems. More precisely, we show that there is a permutation commitment scheme that allows a mix-server to: (1) commit to a permutation and efficiently prove knowledge of doing so correctly in the offline phase, and (2) shuffle its input and give an extremely efficient commitment-consistent proof of a shuffle in the online phase. We prove our result for a general class of shuffle maps that generalize a known types of shuffles, and even allows shuffling ciphertexts of different cryptosystems in parallel.
Place, publisher, year, edition, pages
Berlin: SPRINGER-VERLAG BERLIN , 2009. Vol. 5594, 407-421 p.
, Lecture Notes in Computer Science, ISSN 0302-9743
IdentifiersURN: urn:nbn:se:kth:diva-30777DOI: 10.1007/978-3-642-02620-1_28ISI: 000268100500028ScopusID: 2-s2.0-70350645559ISBN: 978-3-642-02619-5OAI: oai:DiVA.org:kth-30777DiVA: diva2:404721
14th Australasian Conference on Information Security and Privacy Queensland Univ Technol, Informat Secur Inst, Brisbane, AUSTRALIA, JUL 01-03, 2009
QC 201103182011-03-182011-03-042012-01-20Bibliographically approved