Sciweavers

139 search results - page 8 / 28
» On the Security of Two Key-Updating Signature Schemes
Sort
View
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
16 years 5 days 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
CCS
2007
ACM
16 years 5 days ago
Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing
We construct two new multiparty digital signature schemes that allow multiple signers to sequentially produce a compact, fixed-length signature. First, we introduce a new primiti...
Alexandra Boldyreva, Craig Gentry, Adam O'Neill, D...
CTRSA
2010
Springer
232views Cryptology» more  CTRSA 2010»
16 years 25 days ago
On Extended Sanitizable Signature Schemes
Sanitizable signature schemes allow a semi-trusted entity to modify some specific portions of a signed message while keeping a valid signature of the original off-line signer. In...
Sébastien Canard, Amandine Jambert
WEWORC
2007
132views Cryptology» more  WEWORC 2007»
15 years 7 months ago
Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
Léonard Dallot
IACR
2011
104views more  IACR 2011»
14 years 5 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia