102 search results - page 10 / 21 » Practical Identity-Based Encryption Without Random Oracles |
121
click to vote
DCC
2008
IEEE
15 years 11 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 ...
EUROCRYPT
2007
Springer
15 years 5 months ago
2007
Springer
Among the three broad classes of Identity-Based Encryption schemes built from pairings, the exponent inversion paradigm tends to be the most efficient, but also the least extensibl...
145
click to vote
JOC
2010
14 years 10 months ago
2010
We present a new encryption scheme which is secure against adaptive chosenciphertext attack (or CCA2-secure) in the standard model (i.e. without the use of random oracle). Our sch...
112
click to vote
PKC
1998
Springer
15 years 3 months ago
1998
Springer
The ElGamal encryption scheme has been proposed several years ago and is one of the few probabilistic encryption schemes. However, its security has never been concretely proven bas...
101
click to vote
ASIACRYPT
2000
Springer
15 years 4 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 ...