A variant of the Cramer-Shoup cryptosystem for groups of unknown order
From MaRDI portal
Recommendations
Cited in
(9)- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Practical chosen ciphertext secure encryption from factoring
- A cryptographic primitive based on hidden-order groups
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- Cryptographic primitives based on groups on hidden order
- Practical Chosen Ciphertext Secure Encryption from Factoring
- A new public key cryptosystem over \(\mathbb Z_{n^2}^\ast\)
- Cryptanalysis of Cramer-Shoup like cryptosystems based on index exchangeable family
- Punctured syndrome decoding problem. Efficient side-channel attacks against \textit{Classic McEliece}
This page was built for publication: A variant of the Cramer-Shoup cryptosystem for groups of unknown order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412787)