A Practical and Tightly Secure Signature Scheme Without Hash Function

@inproceedings{ChevallierMames2007APA,
  title={A Practical and Tightly Secure Signature Scheme Without Hash Function},
  author={Beno{\^i}t Chevallier-Mames and Marc Joye},
  booktitle={CT-RSA},
  year={2007}
}
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the Cramer-Shoup (CS) signature scheme. Remarkably, these schemes meet the highest security notion in the standard model. They however differ in their implementation. The CS scheme and its subsequent variants and extensions proposed so far feature a loose security reduction, which, in turn, implies larger security… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

Tight Security for Signature Schemes Without Random Oracles

Journal of Cryptology • 2013
View 2 Excerpts
Highly Influenced

Tight Proofs for Signature Schemes without Random Oracles

EUROCRYPT • 2011
View 1 Excerpt
Highly Influenced

Similar Papers

Loading similar papers…