The search functionality is under construction.
The search functionality is under construction.

Practical Public-Key Encryption Scheme Tightly Secure in the Random Oracle Model

Yusuke SAKAI, Goichiro HANAOKA

  • Full Text Views

    0

  • Cite this

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