Welcome to the resource topic for 2002/052
A Variant of the Cramer-Shoup Cryptosystem for Groups with Unknwon Order
Authors: Stefan LucksAbstract:
The Cramer-Shoup cryptosystem for groups of prime order is a
practical public-key cryptosystem, provably secure in the standard
model under standard assumptions. This paper extends the
cryptosystem for groups of unknown order, namely the group of
quadratic residues modulo a composed N. Two security
In the standard model, the scheme is provably secure if both the
Decisional Diffie-Hellman assumption for QR_N and the
factorisation assumption for N hold. In the random oracle model, the
security of the scheme is provable by a quite efficient reduction.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .