CryptoDB
Adapting the weaknesses of the Random Oracle model to the Generic Group model
Authors: | |
---|---|
Download: | |
Abstract: | This paper presents results that show that there exist problems in that are provably hard in the generic group model but easy to solve whenever the random encoding function is replaced with a specific encoding function (or one drawn from a specific set of encoding functions). We also show that there exist cryptographic schemes that are provably hard in the generic group model but easy to break in practice. |
BibTeX
@misc{eprint-2002-11609, title={Adapting the weaknesses of the Random Oracle model to the Generic Group model}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / discrete logarithm problem}, url={http://eprint.iacr.org/2002/086}, note={ alex@fermat.ma.rhul.ac.uk 11869 received 1 Jul 2002}, author={Alexander W. Dent}, year=2002 }