CSP-DHIES: a new public-key encryption scheme from matrix conjugation

  • Authors:
  • Ping Pan;Lihua Wang;Licheng Wang;Lixiang Li;Yixian Yang

  • Affiliations:
  • Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China;National Institute of Information and Communications Technology (NICT), 4-2-1 Nukui-Kitamachi, Koganei, Tokyo, 184-8795, Japan;Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China;Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China;Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China

  • Venue:
  • Security and Communication Networks
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a new public-key cryptosystem named conjugacy search problem-based Diffie–Hellman integrated encryption scheme (CSP-DHIES), by using conjugation-related assumptions for a special monoid of matrices of truncated multi-variable polynomials over the ring ℤ12 where the CSP is assumed to be intractable. Our construction can be viewed as the first noncommunicative variant of the well-known DHIES cryptosystem. Under the assumptions of the intractability of the CSP-based hash Diffie–Hellman problem and the CSP-based oracle Diffie–Hellman problem, our scheme is provably secure against both chosen-plaintext attacks and secure against chosen-ciphertext attacks. Our proofs are constructed in the standard model. We also discuss the possibility of implementing our proposal using braid groups. Copyright © 2011 John Wiley & Sons, Ltd.