Sciweavers

139 search results - page 15 / 28
» Identity-based Threshold Signature Secure in the Standard Mo...
Sort
View
CCS
1999
ACM
15 years 8 months ago
Signature Schemes Based on the Strong RSA Assumption
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the the signer to maintain any state, and can be proven secure against ...
Ronald Cramer, Victor Shoup
EUROPKI
2009
Springer
15 years 2 months ago
Validity Models of Electronic Signatures and Their Enforcement in Practice
Abstract. An electronic signature is considered to be valid, if the signature is mathematically correct and if the signer's public key is classified as authentic. While the fi...
Harald Baier, Vangelis Karatsiolis
IACR
2011
90views more  IACR 2011»
14 years 4 months ago
On the Security of the Winternitz One-Time Signature Scheme
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...
Johannes Buchmann, Erik Dahmen, Sarah Ereth, Andre...
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
15 years 10 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
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
14 years 7 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman