569 search results - page 30 / 114 » On the Security of the Digital Signature Algorithm |
107
click to vote
SCN
2010
Springer
15 years 10 days ago
2010
Springer
The Fiat-Shamir (FS) transform is a popular tool to produce particularly efficient digital signature schemes out of identification protocols. It is known that the resulting signat...
121
click to vote
CTRSA
2007
Springer
15 years 8 months ago
2007
Springer
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...
115
click to vote
ASIACRYPT
2006
Springer
15 years 5 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
119
click to vote
CTRSA
2007
Springer
15 years 8 months ago
2007
Springer
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
163
click to vote
PAIRING
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The me...