Generic group model
The generic group model [1] [2] is an idealised cryptographic model, where the adversary is only given access to a randomly chosen encoding of a group, instead of compact encodings, such as those used by the finite field or elliptic curve groups used in practice.
The generic group model suffers from some of the same problems as the random oracle model. In particular, it can be shown using a similar argument[3] as in [4] that there exist cryptographic schemes which are provable secure in the generic group model, but which are trivially insecure once the random group encoding is replaced with any efficiently computable instantiation of the encoding function.
References
- ^ Victor Shoup (1997). "Lower bounds for discrete logarithms and related problems" (pdf). Lecture Notes in Computer Science. Advances in Cryptology – Eurocrypt ’97. Vol. 1233. Springer-Verlag. pp. 256–266. Retrieved 2007-11-01.
{{cite conference}}: Unknown parameter|booktitle=ignored (|book-title=suggested) (help) - ^ Ueli Maurer (2005). "Abstract models of computation in cryptography" (pdf). Lecture Notes in Computer Science. 10th IMA Conference On Cryptography and Coding. Vol. 2796. Springer-Verlag. pp. 1–12. Retrieved 2007-11-01.
{{cite conference}}: Unknown parameter|booktitle=ignored (|book-title=suggested) (help) - ^ Alexander W. Dent: Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model. ASIACRYPT 2002: 100-109
- ^ Ran Canetti, Oded Goldreich and Shai Halevi, The Random Oracle Methodology Revisited, STOC 1998, pp. 209–218 (PS and PDF).
See also
 | This cryptography-related article is a stub. You can help Wikipedia by expanding it. |