136 search results - page 6 / 28 » Threshold Cryptosystems Secure against Chosen-Ciphertext Att... |
DCC
2008
IEEE
14 years 6 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 ...
ASIACRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
PKC
2004
Springer
14 years 1 days 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 ...
ACNS
2004
Springer
14 years 3 days ago
2004
Springer
We study the data privacy of cryptosystems with All-or-Nothing transform (AONT). An AONT is an efficient computable transform with two properties: Given all the bits of its output...
PROVSEC
2009
Springer
14 years 1 months ago
2009
Springer
Signcryption is a cryptographic primitive that provides authentication and confidentiality simultaneously in a single logical step. It is often required that multiple senders have...