Efficient cryptosystems from 2ᵏ-th power residue symbols
From MaRDI portal
Publication:4924404
Recommendations
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- New assumptions and efficient cryptosystems from the \(e\)-th power residue symbol
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- scientific article; zbMATH DE number 1303131
- Two Generic Constructions of Probabilistic Cryptosystems and Their Applications
Cited in
(17)- On the tightness of forward-secure signature reductions
- New assumptions and efficient cryptosystems from the \(e\)-th power residue symbol
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- The distribution of quadratic residues and non-residues in the Goldwasser-Micali type of cryptosystem. II
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Improved multiplication triple generation over rings via RLWE-based AHE
- Cryptanalysis of the co-ACD assumption
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- 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 -protocols
- Exponent-VRFs and their applications
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Beyond the 1/2 bound: on the theory and practice of biprimality tests
This page was built for publication: Efficient cryptosystems from \(2^k\)-th power residue symbols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924404)
