Proving Tight Security for Rabin-Williams Signatures

This paper proves "tight security in the random-oracle model relative to factorization" for the lowest-cost signature systems available today: every hash-generic signature-forging attack can be converted, with negligible loss of efficiency and effectiveness, into an algorithm to factor the public key. The most surprising system is the "fixed unstructured B = 0 Rabin

• Type: Conference
• Year: 2008
• Where: EUROCRYPT
• Authors: Daniel J. Bernstein
• Keywords: Cryptology, EUROCRYPT 2008, Loose Security, Rabin­Williams Tight Security, Tight Security