Signature Schemes: Security Against Chosen Message Attacks

• Papers
  • A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks (Goldwasser, Micali, Rivest 1988)
    • note (19.02.99)
  • TSH-ESIGN: Efficient Digital Signature Scheme Using Trisection Size Hash (Okamoto, Fujisaki, Morita, 1998)
  • Design Validations for Discrete Logarithm Based Signature Schemes (Ernest Brickell, David Pointcheval, Serge Vaudenay, and Moti Yung, PKC 2000)
  • Provably Secure Signature Scheme from Bilinear Mapping (Dan Boneh, Ilya Mironov, RSA-CT 2003)
  • In plain model (without random oracles)
    • Secure Hash-and-Sign Signatures without the Random Oracle (Gennaro, Halevi, Rabin, Eurocrypt '99)
    • Signature Schemes Based on the Strong RSA Assumption (Ronald Cramer and Victor Shoup ACM TISSEC 2000/ACM CCS 1999)
    • Twin Signatures ( an Alternative to the Hash-and-Sign Paradigm)
    • The Cramer-Shoup Strong-RSA Signature Scheme Revisited (Marc Fischlin, eprint 2002/017)
    • A Signature Scheme with Efficient Protocols (Jan Camenisch, Anna Lysyanskaya, SCN 2002)
    • Short Signatures Without Random Oracles (Dan Boneh and Xavier Boyen, Eurocrypt 2004)
    • Efficient Identity-Based Encryption Without Random Oracles (Brent Waters, Eurocrypt 2005)
    • A Practical and Tightly Secure Signature Scheme Without Hash Function (Benoît Chevallier-Mames and Marc Joye, CT-RSA 2007)

---

Cryptology Pointers by Helger Lipmaa
Got any suggestions or additional links? Mail to <helger.lipmaa>gmail.com
NB! If you find any broken links, please be kind and report them to me together with their current location!

(C) Helger Lipmaa 1997-2009.