UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Verifiable shuffle of large size ciphertexts

Groth, J; Lu, S; (2007) Verifiable shuffle of large size ciphertexts. In: Okamoto, T and Wang, X, (eds.) Public Key Cryptography - PKC 2007. (pp. 377 - 392). SPRINGER-VERLAG BERLIN

Full text not available from this repository.


A shuffle is a permutation and rerandomization of a set of cipher-texts. Among other things, it can be used to construct mix-nets that are used in anonymization protocols and voting schemes. While shuffling is easy, it is hard for an outsider to verify that a shuffle has been performed correctly. We suggest two efficient honest verifier zero-knowledge (HVZK) arguments for correctness of a shuffle. Our goal is to minimize round-complexity and at the same time have low communicational and computational complexity.The two schemes we suggest are both 3-move HVZK arguments for correctness of a shuffle. We first suggest a HVZK argument based on homomorphic integer commitments, and improve both on round complexity, communication complexity and computational complexity in comparison with state of the art. The second HVZK argument is based on homomorphic commitments over finite fields. Here we improve on the computational complexity and communication complexity when shuffling large ciphertexts.

Type: Proceedings paper
Title: Verifiable shuffle of large size ciphertexts
Event: 10th International Conference on Practice and Theory in Public-Key Cryptography
Location: Beijing, PEOPLES R CHINA
Dates: 2007-04-16 - 2007-04-20
ISBN-13: 978-3-540-71676-1
Keywords: shuffle, homomorphic commitment, homomorphic encryption, mix-net, honest verifier zero-knowledge, MIX-NET, EFFICIENT, SECURE
URI: http://discovery.ucl.ac.uk/id/eprint/148917
Downloads since deposit
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item