76 search results - page 6 / 16 » Confirmer Signature Schemes Secure against Adaptive Adversar... |
64
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
JOC
2000
14 years 9 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...
CRYPTO
2004
Springer
15 years 3 months ago
2004
Springer
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
CCS
2003
ACM
15 years 2 months ago
2003
ACM
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
74
Voted
TCC
2007
Springer
15 years 3 months ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...