The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Keselamatan teks sifir terpilih ialah matlamat utama dalam mereka bentuk skim penyulitan kunci awam yang selamat, dan juga penting bahawa keselamatan teks sifir terpilih adalah ketat dikurangkan kepada beberapa masalah keras yang mantap. Lebih-lebih lagi, adalah lebih penting untuk mempunyai pengurangan yang ketat dalam pelbagai pengguna pelbagai cabaran tetapan, kerana pengurangan keselamatan yang ketat dalam tetapan cabaran tunggal pengguna tunggal secara amnya tidak membayangkan pengurangan ketat kepada tetapan berbilang cabaran berbilang pengguna. Kami mencadangkan skim penyulitan kunci awam yang selamat sepenuhnya dan praktikal yang pertama yang dipilih-teks sifir selamat dalam tetapan berbilang cabaran berbilang pengguna dalam model oracle rawak. Skim ini terbukti selamat di bawah andaian keputusan Diffie-Hellman dalam kumpulan tanpa pasangan. Overhed teks sifir skema kami ialah dua elemen kumpulan dan dua eksponen.
Yusuke SAKAI
National Institute of Advanced Industrial Science and Technology
Goichiro HANAOKA
National Institute of Advanced Industrial Science and Technology
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.
Salinan
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
Salinan
@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},}
Salinan
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 -