326 search results - page 10 / 66 » Digital Signature Scheme Based on a New Hard Problem |
CTRSA
2007
Springer
14 years 1 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...
ASIACRYPT
2000
Springer
13 years 12 months ago
2000
Springer
We consider a problem which was stated in a request for comments made by NIST in the FIPS97 document. The question is the following: Can we have a digital signature public key infr...
CSJM
2006
13 years 7 months ago
2006
A new method is proposed to design short signature schemes based on difficulty of factorizing a composite number n = qr, where q and r are two large primes. Using the method new d...
ASIACRYPT
1992
Springer
13 years 11 months ago
1992
Springer
Collision resistant hash functions are an important basic tool for cryptographic applications such as digital signature schemes and integrity protection based on "fingerprinti...
CCS
1999
ACM
13 years 12 months ago
1999
ACM
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 ...