Name
Abstract | ||
|---|---|---|
In this paper we propose two new chosen ciphertext (CCA) secure schemes from the computational Diffie Hellman (CDH) and bilinear computational Diffie Hellman (BCDH) assumptions Our first scheme from the CDH assumption is constructed by extending Cash Kiltz Shoup scheme This scheme yields the same ciphertext as that of Hanaoka Kurosawa scheme (and thus Cramer Shoup scheme) with cheaper computational cost for encryption However key size is still the same as that of Hanaoka Kurosawa scheme Our second scheme from the BCDH assumption is constructed by extending Boyen Mei Waters scheme Though this scheme requires a stronger underlying assumption than the CDH assumption it yields significantly shorter key size for both public and secret keys Furthermore ciphertext length of our second scheme is the same as that of the onginal Boyen Mei Waters scheme |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1587/transfun.E93.A.1984 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | DocType | Volume |
public key encryption, chosen ciphertext security computational Diffie Hellman assumption, bilinear computational Diffie Hellman assumption | Journal | E93A |
Issue | ISSN | Citations |
11 | 0916-8508 | 6 |
PageRank | References | Authors |
0.42 | 15 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shota Yamada | 1 | 94 | 18.10 |
| Yutaka Kawai | 2 | 94 | 11.48 |
| Goichiro Hanaoka | 3 | 910 | 101.53 |
| Noboru Kunihiro | 4 | 425 | 45.72 |