24 search results - page 4 / 5 » Short Signatures from Weaker Assumptions |
LATINCRYPT
2010
13 years 4 months ago
2010
In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar’s code-based solution to use the short integer solution (SIS) problem as securi...
NDSS
2008
IEEE
14 years 20 days ago
2008
IEEE
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...
ICNS
2009
IEEE
14 years 28 days ago
2009
IEEE
—The majority of security protocols employ public key cryptography for authentication at least in the connection setup phase. However, verifying digital signatures is an expensiv...
PKC
2005
Springer
13 years 11 months ago
2005
Springer
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
ACISP
2007
Springer
14 years 14 days ago
2007
Springer
We present a new non-interactive message authentication protocol in manual channel model (NIMAP, for short) using the weakest assumption on the manual channel (i.e. assuming the st...