Verifiable Shuffle of Large Size Ciphertexts

DOI10.1007/978-3-540-71677-8_25MaRDI QIDQ5756543zbMATH OpenOpenAlexFDO

Authors 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

homomorphic commitmenthomomorphic encryptionhonest verifier zero-knowledgemix-netshuffle

Mathematics Subject Classification ID

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

Recommendations

• A verifiable secret shuffle of homomorphic encryptions
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• A Non-interactive Shuffle with Pairing Based Verifiability

Cited in

(27)

• Linearly-homomorphic signatures and scalable mix-nets
• On publicly-accountable zero-knowledge and small shuffle arguments
• Reconciling non-malleability with homomorphic encryption
• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
• Efficient culpably sound NIZK shuffle argument without random oracles
• Automata evaluation and text search protocols with simulation-based security
• A shuffle argument secure in the generic model
• Generic fully simulatable adaptive oblivious transfer
• Verifiable Rotation of Homomorphic Encryptions
• A Commitment-Consistent Proof of a Shuffle
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• Formal and precise analysis of soundness of several shuffling schemes
• VERIFICATION OF A PAILLIER BASED SHUFFLE USING REPRESENTATIONS OF THE SYMMETRIC GROUP
• A Non-interactive Shuffle with Pairing Based Verifiability
• An Efficient Aggregate Shuffle Argument Scheme
• Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Public Key Cryptography – PKC 2004
• A verifiable secret shuffle of homomorphic encryptions
• Lattice-Based Proof of a Shuffle
• Distributed shuffling in adversarial environments
• Shuffle arguments based on subset-checking
• Efficient succinct zero-knowledge arguments in the CL framework
• Efficient verifiable mixnets from lattices, revisited
• Shuffle invariance of the super-RSK algorithm
• Lattice-based proof of shuffle and applications to electronic voting
• More efficient shuffle argument from unique factorization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756543)