CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model

  • Toshihide Matsuda
  • Ryo Nishimaki
  • Keisuke Tanaka
Conference paper

DOI: 10.1007/978-3-642-13013-7_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6056)
Cite this paper as:
Matsuda T., Nishimaki R., Tanaka K. (2010) CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model. In: Nguyen P.Q., Pointcheval D. (eds) Public Key Cryptography – PKC 2010. PKC 2010. Lecture Notes in Computer Science, vol 6056. Springer, Berlin, Heidelberg

Abstract

Proxy re-encryption (PRE) is a cryptographic application proposed by Blaze, Bleumer, and Strauss. It is an encryption system with a special property in which the semi-honest third party, the proxy, can re-encrypt ciphertexts for Alice into other ciphertexts for Bob without using Alice’s secret key. We can classify PRE into bidirectional and unidirectional schemes. Canetti and Hohenberger formalized the semantic security under chosen ciphertext attack for PRE, the PRE-CCA security. Several schemes satisfy the PRE-CCA security as a bidirectional or unidirectional scheme. However, some PRE schemes need a bilinear map in the standard model, and the other PRE schemes are PRE-CCA secure in the random oracle model before our work. In this paper, we construct a bidirectional PRE-CCA proxy re-encryption without bilinear maps in the standard model. We study lossy trapdoor functions (LTDFs) based on the decisional Diffie-Hellman (DDH) assumption proposed by Peikert and Waters. We define a new variant of LTDFs, re-applicable LTDFs, which are specialized LTDFs for PRE, and use them for our scheme.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Toshihide Matsuda
    • 1
  • Ryo Nishimaki
    • 2
  • Keisuke Tanaka
    • 1
  1. 1.Department of Mathematical and Computing SciencesTokyo Institute of TechnologyTokyoJapan
  2. 2.NTT LaboratoriesTokyoJapan

Personalised recommendations