14 search results - page 2 / 3 » Rerandomizable and Replayable Adaptive Chosen Ciphertext Att... |
SCN
2008
Springer
13 years 5 months ago
2008
Springer
In this paper, we build, in a generic way, two asymmetric cryptosystems with a careful study of their security. We present first an additively homomorphic scheme which generalizes,...
CCS
2005
ACM
13 years 10 months ago
2005
ACM
We describe a new encryption technique that is secure in the standard model against adaptive chosen ciphertext (CCA2) attacks. We base our method on two very efficient Identity-Ba...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
TYPES
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
In a practical system, a message is often encrypted more than once by different encryptions, here called multiple encryption, to enhance its security. Additionally, new features ...