Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Commitment-Consistent Proof of a Shuffle
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0003-4157-1371
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, Published paper (Refereed)
Abstract [en]

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.
Series
Lecture Notes in Computer Science, ISSN 0302-9743
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-30777DOI: 10.1007/978-3-642-02620-1_28ISI: 000268100500028Scopus ID: 2-s2.0-70350645559ISBN: 978-3-642-02619-5 (print)OAI: oai:DiVA.org:kth-30777DiVA: diva2:404721
Conference
14th Australasian Conference on Information Security and Privacy Queensland Univ Technol, Informat Secur Inst, Brisbane, AUSTRALIA, JUL 01-03, 2009
Note
QC 20110318Available from: 2011-03-18 Created: 2011-03-04 Last updated: 2012-01-20Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Wikström, Douglas

Search in DiVA

By author/editor
Wikström, Douglas
By organisation
Theoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 27 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf