The search functionality is under construction.

The search functionality is under construction.

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 original Boyen-Mei-Waters scheme.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.11 pp.1984-1993

- Publication Date
- 2010/11/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.E93.A.1984

- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)

- Category
- Cryptography and Information Security

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Shota YAMADA, Yutaka KAWAI, Goichiro HANAOKA, Noboru KUNIHIRO, "Public Key Encryption Schemes from the (B)CDH Assumption with Better Efficiency" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 11, pp. 1984-1993, November 2010, doi: 10.1587/transfun.E93.A.1984.

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 original Boyen-Mei-Waters scheme.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1984/_p

Copy

@ARTICLE{e93-a_11_1984,

author={Shota YAMADA, Yutaka KAWAI, Goichiro HANAOKA, Noboru KUNIHIRO, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={Public Key Encryption Schemes from the (B)CDH Assumption with Better Efficiency},

year={2010},

volume={E93-A},

number={11},

pages={1984-1993},

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 original Boyen-Mei-Waters scheme.},

keywords={},

doi={10.1587/transfun.E93.A.1984},

ISSN={1745-1337},

month={November},}

Copy

TY - JOUR

TI - Public Key Encryption Schemes from the (B)CDH Assumption with Better Efficiency

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 1984

EP - 1993

AU - Shota YAMADA

AU - Yutaka KAWAI

AU - Goichiro HANAOKA

AU - Noboru KUNIHIRO

PY - 2010

DO - 10.1587/transfun.E93.A.1984

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E93-A

IS - 11

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - November 2010

AB - 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 original Boyen-Mei-Waters scheme.

ER -