5 search results - page 1 / 1 » Security Arguments for a Class of ID-Based Signatures |
JOC
2000
13 years 4 months ago
2000
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
ICDS
2008
IEEE
13 years 11 months ago
2008
IEEE
SP
2008
IEEE
13 years 11 months ago
2008
IEEE
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
CRYPTO
2003
Springer
13 years 10 months ago
2003
Springer
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
ICS
2010
Tsinghua U.
14 years 2 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...