A Cramer-Shoup Variant Related to the Quadratic Residuosity Problem

Harunaga HIWATARI; Keisuke TANAKA

doi:10.1093/ietfec/e89-a.1.203

A Cramer-Shoup Variant Related to the Quadratic Residuosity Problem

Harunaga HIWATARI, Keisuke TANAKA

Full Text Views

0

Share
Cite this

Summary :

At Eurocrypt '02, Cramer and Shoup [1] proposed a general paradigm to construct practical public-key encryption schemes secure against the adaptive chosen ciphertext attack as well as several concrete examples. One of these example is the scheme based on the quadratic residuosity (QR) problem. However this scheme is less efficient than the other examples. In this paper, we construct a new variant of the Cramer-Shoup encryption scheme which is related to the QR problem. Our variant is more efficient than the scheme based on the QR problem.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.1 pp.203-205

Publication Date: 2006/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e89-a.1.203

Type of Manuscript: Special Section LETTER (Special Section on Cryptography and Information Security)

Category: Public Key Cryptography

Cite this

Copy

Harunaga HIWATARI, Keisuke TANAKA, "A Cramer-Shoup Variant Related to the Quadratic Residuosity Problem" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 1, pp. 203-205, January 2006, doi: 10.1093/ietfec/e89-a.1.203.
Abstract: At Eurocrypt '02, Cramer and Shoup [1] proposed a general paradigm to construct practical public-key encryption schemes secure against the adaptive chosen ciphertext attack as well as several concrete examples. One of these example is the scheme based on the quadratic residuosity (QR) problem. However this scheme is less efficient than the other examples. In this paper, we construct a new variant of the Cramer-Shoup encryption scheme which is related to the QR problem. Our variant is more efficient than the scheme based on the QR problem.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.1.203/_p

Copy

@ARTICLE{e89-a_1_203,
author={Harunaga HIWATARI, Keisuke TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Cramer-Shoup Variant Related to the Quadratic Residuosity Problem},
year={2006},
volume={E89-A},
number={1},
pages={203-205},
abstract={At Eurocrypt '02, Cramer and Shoup [1] proposed a general paradigm to construct practical public-key encryption schemes secure against the adaptive chosen ciphertext attack as well as several concrete examples. One of these example is the scheme based on the quadratic residuosity (QR) problem. However this scheme is less efficient than the other examples. In this paper, we construct a new variant of the Cramer-Shoup encryption scheme which is related to the QR problem. Our variant is more efficient than the scheme based on the QR problem.},
keywords={},
doi={10.1093/ietfec/e89-a.1.203},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - A Cramer-Shoup Variant Related to the Quadratic Residuosity Problem
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 203
EP - 205
AU - Harunaga HIWATARI
AU - Keisuke TANAKA
PY - 2006
DO - 10.1093/ietfec/e89-a.1.203
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2006
AB - At Eurocrypt '02, Cramer and Shoup [1] proposed a general paradigm to construct practical public-key encryption schemes secure against the adaptive chosen ciphertext attack as well as several concrete examples. One of these example is the scheme based on the quadratic residuosity (QR) problem. However this scheme is less efficient than the other examples. In this paper, we construct a new variant of the Cramer-Shoup encryption scheme which is related to the QR problem. Our variant is more efficient than the scheme based on the QR problem.
ER -