16 search results - page 3 / 4 » pkc 2000 |
PKC
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
PKC
2005
Springer
13 years 10 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...
BIRTHDAY
2010
Springer
13 years 6 months ago
2010
Springer
Chosen-ciphertext security is by now a standard security property for asymmetric encryption. Many generic constructions for building secure cryptosystems from primitives with lower...
PKC
2000
Springer
13 years 9 months ago
2000
Springer
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
PKC
2009
Springer
14 years 5 months ago
2009
Springer
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatur...