KTH

Displaying 1 - 1 of 1 results

  • A Commitment-Consistent Proof of a Shuffle

    White Papers // Apr 2011 // provided by KTH

    The authors introduce a pre-computation technique that drastically reduces the online computational complexity of mix-nets based on homomorphic cryptosystems. More precisely, the authors show that there is a permutation commitment scheme that allows a mix-server to: commit to a permutation and efficiently prove knowledge of doing so correctly in the ...

    Download Now