Cryptographic primitives based on groups on hidden order
From MaRDI portal
Publication:3369007
zbMATH Open1114.94016MaRDI QIDQ3369007FDOQ3369007
Authors: Wandi Wei, Tran van Trung, Spyros S. Magliveras, Frederick Hoffman
Publication date: 22 March 2007
Recommendations
factorizationdiscrete logarithmgrouppublic key cryptographyRSA cryptosystemElGamal cryptosystemhidden-order
Cited In (9)
- A new public key scheme based on DRSA and generalized GDLP
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- A cryptographic primitive based on hidden-order groups
- Robust Threshold Schemes Based on the Chinese Remainder Theorem
- A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
- Title not available (Why is that?)
- A new public key cryptosystem over \(\mathbb Z_{n^2}^\ast\)
- 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)