Efficient Cryptosystems from 2 k -th Power Residue Symbols
From MaRDI portal
Publication:4924404
DOI10.1007/978-3-642-38348-9_5zbMath1300.94064OpenAlexW2162670020MaRDI QIDQ4924404
Publication date: 31 May 2013
Published in: Advances in Cryptology – EUROCRYPT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_5
standard modelpublic-key encryptionhomomorphic encryptionquadratic residuosityGoldwasser-Micali cryptosystem
Related Items (11)
Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ Cryptanalysis of the Co-ACD Assumption ⋮ Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ On the tightness of forward-secure signature reductions ⋮ Improved Multiplication Triple Generation over Rings via RLWE-Based AHE ⋮ Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ ⋮ Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
This page was built for publication: Efficient Cryptosystems from 2 k -th Power Residue Symbols
