Cryptographic primitives based on groups on hidden order
From MaRDI portal
Publication:3369007
Recommendations
Cited in
(9)- A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- A new public key scheme based on DRSA and generalized GDLP
- A cryptographic primitive based on hidden-order groups
- A new public key cryptosystem over \(\mathbb Z_{n^2}^\ast\)
- scientific article; zbMATH DE number 5025700 (Why is no real title available?)
- Robust Threshold Schemes Based on the Chinese Remainder Theorem
- On time-lock cryptographic assumptions in abelian hidden-order groups
- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
This page was built for publication: Cryptographic primitives based on groups on hidden order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3369007)