Abstract
The generic group model has recently been used to prove the security of certain asymmetric encryption and signature schemes. 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). In particular we show that there exist cryptographic schemes that are provably hard in the generic group model but easy to break in practice.
The work described in this paper has been supported by the Commission of the European Communities through the IST program under contract IST-1999-12324.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Bellare and P. Rogaway. ‘Random Oracles are Practical: A Paradigm for Designing Effecient Protocols.’ Proceedings of the First ACM Conference on Computer and Communications Security, 1993.
D. Brown. ‘Generic Groups, Collision Resistance, and ECDSA’. Available from http://eprint.iacr.org/, 2002.
R. Canetti, O. Goldreich and S. Halevi. ‘The Random Oracle Methodology, Revisited.’ Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1998.
M. Fischlin. ‘A Note on Security Proofs in the Generic Model.’ Advances in Cryptology-Asiacrypt 2000, 2000.
S. Micali. ‘CS proofs.’ Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, 1994.
C. Schnorr. ‘Efficient Signature Generation for Smart Cards.’ Journal of Cryptology, Vol 4, 1991.
C. Schnorr and M. Jakobsson. ‘Security of Signed El-Gamel Encryption.’ Advances in Cryptology-Asiacrypt 2000, 2000.
V. Shoup. ‘Lower Bounds for Discrete Logarithms and Related Problems.’ Theory and Application of Cryptographic Techniques, 1997.
N. Smart. ‘The Exact Security of ECIES in the Generic Group Model.’ Cryptography and Coding, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dent, A.W. (2002). Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model. In: Zheng, Y. (eds) Advances in Cryptology — ASIACRYPT 2002. ASIACRYPT 2002. Lecture Notes in Computer Science, vol 2501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36178-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-36178-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00171-3
Online ISBN: 978-3-540-36178-7
eBook Packages: Springer Book Archive