Sciweavers

186 search results - page 2 / 38
» Signature Schemes Based on the Strong RSA Assumption
Sort
View
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
14 years 5 months ago
A Practical and Tightly Secure Signature Scheme Without Hash Function
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...
Benoît Chevallier-Mames, Marc Joye
ASIACRYPT
2011
Springer
12 years 10 months ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
14 years 5 months ago
Short and Stateless Signatures from the RSA Assumption
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
Susan Hohenberger, Brent Waters
CSREASAM
2009
13 years 12 months ago
A Tripartite Strong Designated Verifier Scheme Based On Threshold RSA Signatures
In this paper we propose a new designated verifier signature scheme based on the threshold signature scheme presented [8] by Ghodosi and Pieprzyk. The advantages of the new scheme ...
Jerome Dossogne, Olivier Markowitch
CRYPTO
2004
Springer
118views Cryptology» more  CRYPTO 2004»
14 years 4 months ago
Short Group Signatures
ded abstract of this paper is to appear in Advances in Cryptology—CRYPTO 2004, Springer-Verlag. We construct a short group signature scheme. Signatures in our scheme are approxi...
Dan Boneh, Xavier Boyen, Hovav Shacham