Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

21

EUROCRYPT
2008
Springer

favoriteEmaildiscussreport

79views Cryptology» more EUROCRYPT 2008»

Proving Tight Security for Rabin-Williams Signatures

14 years 19 days ago

Proving Tight Security for Rabin-Williams Signatures

Download cr.yp.to

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

Daniel J. Bernstein

Real-time Traffic

Cryptology | EUROCRYPT 2008 | Loose Security | RabinWilliams Tight Security | Tight Security |

claim paper

Related Content

» How Risky Is the RandomOracle Model

» How to Compress Rabin Ciphertexts and Signatures and More

» Short Signatures Without Random Oracles

» The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures

» Verifying a signature architecture a comparative case study

» Cryptographic tamper evidence

» RoundEfficient Broadcast Authentication Protocols for Fixed Topology Classes

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	EUROCRYPT
Authors	Daniel J. Bernstein

Comments (0)