A Verifiable Secret Shuffe of Homomorphic Encryptions

DOI10.1007/3-540-36288-6_11MaRDI QIDQ4414704zbMATH OpenOpenAlexFDO

Authors Jens Groth

Publication date 27 July 2003

Published in Public Key Cryptography — PKC 2003 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-36288-6_11

zbMATH Keywords

homomorphic commitmentsroot decryptionsecret shuffles

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• A verifiable secret shuffle of homomorphic encryptions
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Verifiable Shuffle of Large Size Ciphertexts
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• A Non-interactive Shuffle with Pairing Based Verifiability

Cited in

(31)

• 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
• Malleable proof systems and applications
• SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers
• Efficient and secure generalized pattern matching via Fast Fourier Transform
• Secure Multi-party Shuffling
• Privacy Preserving Data Mining within Anonymous Credential Systems
• Towards Robust Computation on Encrypted Data
• Verifiable Rotation of Homomorphic Encryptions
• A Commitment-Consistent Proof of a Shuffle
• Applied Cryptography and Network Security
• Succinct malleable NIZKs and an application to compact shuffles
• Verifiable elections that scale for free
• 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
• Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
• A Sender Verifiable Mix-Net and a New Proof of a Shuffle
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Verifiable Shuffle of Large Size Ciphertexts
• Public Key Cryptography – PKC 2004
• A verifiable secret shuffle of homomorphic encryptions
• Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
• Lattice-Based Proof of a Shuffle
• Maliciously secure multi-client ORAM
• Efficient succinct zero-knowledge arguments in the CL framework
• Efficient verifiable mixnets from lattices, revisited
• Shuffle invariance of the super-RSK algorithm
• Special soundness revisited

This page was built for publication: A Verifiable Secret Shuffe of Homomorphic Encryptions

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