Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE

  • Authors:
  • Yang Cui;Kirill Morozov;Kazukuni Kobara;Hideki Imai

  • Affiliations:
  • National Institute of Advanced Industrial Science & Technology (AIST), Research Center for Information Security (RCIS), Japan and Chuo University, Japan;National Institute of Advanced Industrial Science & Technology (AIST), Research Center for Information Security (RCIS), Japan;National Institute of Advanced Industrial Science & Technology (AIST), Research Center for Information Security (RCIS), Japan and Chuo University, Japan;National Institute of Advanced Industrial Science & Technology (AIST), Research Center for Information Security (RCIS), Japan and Chuo University, Japan

  • Venue:
  • AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We build on the new security notion for deterministic encryption (PRIV) and the PRIV-secure schemes presented by Bellare et al at Crypto'07. Our work introduces: 1) A generic and efficient construction of deterministic length-preserving hybrid encryption, which is an improvement on the scheme sketched in the above paper; to our best knowledge, this is the first example of length-preserving hybrid encryption; 2) postquantum deterministic encryption (using the IND-CPA variant of code-based McEliece PKE) which enjoys a simplified construction, where the public key is re-used as a hash function.