Verifiable Shuffle of Large Size Ciphertexts

DOI10.1007/978-3-540-71677-8_25zbMath1161.94401OpenAlexW1801339841MaRDI QIDQ5756543

Jens Groth, Steve Lu

Publication date: 4 September 2007

Published in: Public Key Cryptography – PKC 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71677-8_25

zbMATH Keywords

shufflehomomorphic encryptionmix-nethomomorphic commitmenthonest verifier zero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

Automata evaluation and text search protocols with simulation-based security ⋮ A verifiable secret shuffle of homomorphic encryptions ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle ⋮ Lattice-Based Proof of a Shuffle ⋮ Generic Fully Simulatable Adaptive Oblivious Transfer ⋮ Formal and Precise Analysis of Soundness of Several Shuffling Schemes ⋮ On publicly-accountable zero-knowledge and small shuffle arguments

This page was built for publication: Verifiable Shuffle of Large Size Ciphertexts