A Verifiable Secret Shuffe of Homomorphic Encryptions

DOI10.1007/3-540-36288-6_11zbMath1033.94527OpenAlexW2120506990MaRDI QIDQ4414704

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

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

Related Items (13)

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 ⋮ Mix-nets from re-randomizable and replayable CCA-secure public-key encryption ⋮ Lattice-Based Proof of a Shuffle ⋮ Privacy Preserving Data Mining within Anonymous Credential Systems ⋮ Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform ⋮ Verifiable Elections That Scale for Free ⋮ Formal and Precise Analysis of Soundness of Several Shuffling Schemes ⋮ Towards Robust Computation on Encrypted Data ⋮ A Commitment-Consistent Proof of a Shuffle ⋮ On publicly-accountable zero-knowledge and small shuffle arguments ⋮ Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security

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