IEICE TRANSACTIONS on Fundamentals
Practical Public-Key Encryption Scheme Tightly Secure in the Random Oracle Model
Summary :
Chosen-ciphertext security is a central goal in designing a secure public-key encryption scheme, and it is also important that the chosen-ciphertext security is tightly reduced to some well-established hard problem. Moreover, it is more important to have a tight reduction in the multi-user multi-challenge setting, since a tight security reduction in the single-user single-challenge setting generally does not imply a tight reduction to the multi-user multi-challenge setting. We propose the first fully tightly secure and practical public-key encryption scheme which is chosen-ciphertext secure in the multi-user multi-challenge setting in the random oracle model. The scheme is proven secure under the decisional Diffie-Hellman assumption in a pairing-free group. The ciphertext overhead of our scheme is two group elements and two exponents.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.1 pp.165-172
- Publication Date
- 2020/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2019CIP0020
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
Authors
Yusuke SAKAI
National Institute of Advanced Industrial Science and Technology
Goichiro HANAOKA
National Institute of Advanced Industrial Science and Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Yusuke SAKAI, Goichiro HANAOKA, "Practical Public-Key Encryption Scheme Tightly Secure in the Random Oracle Model" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 1, pp. 165-172, January 2020, doi: 10.1587/transfun.2019CIP0020.
Abstract: Chosen-ciphertext security is a central goal in designing a secure public-key encryption scheme, and it is also important that the chosen-ciphertext security is tightly reduced to some well-established hard problem. Moreover, it is more important to have a tight reduction in the multi-user multi-challenge setting, since a tight security reduction in the single-user single-challenge setting generally does not imply a tight reduction to the multi-user multi-challenge setting. We propose the first fully tightly secure and practical public-key encryption scheme which is chosen-ciphertext secure in the multi-user multi-challenge setting in the random oracle model. The scheme is proven secure under the decisional Diffie-Hellman assumption in a pairing-free group. The ciphertext overhead of our scheme is two group elements and two exponents.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019CIP0020/_p
Copy
@ARTICLE{e103-a_1_165,
author={Yusuke SAKAI, Goichiro HANAOKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Practical Public-Key Encryption Scheme Tightly Secure in the Random Oracle Model},
year={2020},
volume={E103-A},
number={1},
pages={165-172},
abstract={Chosen-ciphertext security is a central goal in designing a secure public-key encryption scheme, and it is also important that the chosen-ciphertext security is tightly reduced to some well-established hard problem. Moreover, it is more important to have a tight reduction in the multi-user multi-challenge setting, since a tight security reduction in the single-user single-challenge setting generally does not imply a tight reduction to the multi-user multi-challenge setting. We propose the first fully tightly secure and practical public-key encryption scheme which is chosen-ciphertext secure in the multi-user multi-challenge setting in the random oracle model. The scheme is proven secure under the decisional Diffie-Hellman assumption in a pairing-free group. The ciphertext overhead of our scheme is two group elements and two exponents.},
keywords={},
doi={10.1587/transfun.2019CIP0020},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Practical Public-Key Encryption Scheme Tightly Secure in the Random Oracle Model
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 165
EP - 172
AU - Yusuke SAKAI
AU - Goichiro HANAOKA
PY - 2020
DO - 10.1587/transfun.2019CIP0020
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2020
AB - Chosen-ciphertext security is a central goal in designing a secure public-key encryption scheme, and it is also important that the chosen-ciphertext security is tightly reduced to some well-established hard problem. Moreover, it is more important to have a tight reduction in the multi-user multi-challenge setting, since a tight security reduction in the single-user single-challenge setting generally does not imply a tight reduction to the multi-user multi-challenge setting. We propose the first fully tightly secure and practical public-key encryption scheme which is chosen-ciphertext secure in the multi-user multi-challenge setting in the random oracle model. The scheme is proven secure under the decisional Diffie-Hellman assumption in a pairing-free group. The ciphertext overhead of our scheme is two group elements and two exponents.
ER -
English
