Provided by: Innovative Information Science & Technology Research Group (ISYOU)
Date Added: Sep 2011
The programmability has long been used as a tool to prove security of schemes in the Random Oracle Model (ROM) even in the cases where schemes do not seem to have a security proof in the standard model. On the other hand, it seems that a similar property has never been studied in the generic models, i.e., the generic ring and group models, respectively the GRM and the GGM. The authors start by proposing the use of the GRM and the GGM in simulation based security proofs, instead of the classical two-step approach: find an efficient reduction R from a problem P to an adversary breaking the scheme in some sense, and use the GRM/GGM to find a lower bound in the complexity of solving P.