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 efficient encodings, such as those used by the finite field or elliptic curve groups used in practice.

The model includes an oracle that executes the group operation. This oracle takes two encodings of group elements as input and outputs an encoding of a third element. If the group should allow for a pairing operation this operation would be modeled as an additional oracle.

One of the main uses of the generic group model is to analyse computational hardness assumptions. An analysis in the generic group model can answer the question: "What is the fastest generic algorithm for breaking a cryptographic hardness assumption". A generic algorithm is an algorithm that only makes use of the group operation, and does not consider the encoding of the group. This question was answered for the discrete logarithm problem by Victor Shoup using the generic group model.[3] Other results in the generic group model are for instance.[4] The model can also be extended to other algebraic structures, such as, e.g., rings.[5]

The generic group model suffers from some of the same problems as the random oracle model. In particular, it has been shown[6] using a similar argument[7] 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.

See also

References

  1. ↑ Victor Shoup (1997). "Lower bounds for discrete logarithms and related problems" (pdf). Lecture Notes in Computer Science. Advances in Cryptology – Eurocrypt ’97. Springer-Verlag. pp. 256–266. Retrieved 2010-04-09.
  2. ↑ Ueli Maurer (2005). "Abstract models of computation in cryptography" (pdf). Lecture Notes in Computer Science. 10th IMA Conference On Cryptography and Coding. Springer-Verlag. pp. 1–12. Retrieved 2007-11-01.
  3. ↑ Victor Shoup: Lower Bounds for Discrete Logarithms and Related Problems. EUROCRYPT 1997: 256-266
  4. ↑ Ueli M. Maurer, Stefan Wolf: Lower Bounds on Generic Algorithms in Groups. EUROCRYPT 1998: 72-84
  5. ↑ Divesh Aggarwal, Ueli Maurer: Breaking RSA Generically Is Equivalent to Factoring. EUROCRYPT 2009:36-53
  6. ↑ Alexander W. Dent: Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model. ASIACRYPT 2002: 100-109
  7. ↑ Ran Canetti, Oded Goldreich and Shai Halevi, The Random Oracle Methodology Revisited, STOC 1998, pp. 209–218 (PS and PDF).


This article is issued from Wikipedia - version of the Thursday, February 19, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.