Proxy re-encryption allows a semi-trusted proxy with a re-encryption key to convert a delegator's ciphertext into a delegatee's ciphertext, and the semi-trusted proxy cannot learn anything about the underlying plaintext. If a proxy re-encryption scheme is indistinguishable against chosen-ciphertext attacks, its initialized ciphertext should be non-malleable. Otherwise, there might exist an adversary who can break the chosen-ciphertext security of the scheme. Recently, Liang et al. proposed two proxy re-encryption schemes. They claimed that their schemes were chosen-ciphertext secure in the standard model. However, we find that the original ciphertext in their schemes are malleable. Thus, we present some concrete attacks and indicate their schemes fail to achieve chosen-ciphertext security in the standard model.
Conditional proxy re-encryption; Identity-based; Single hop; Multi-hop; Chosen-ciphertext security
Theoretical Computer Science
HE, Kai; WENG, Jian; DENG, Robert H.; and LIU, Joseph K..
On the security of two identity-based conditional proxy re-encryption schemes. (2016). Theoretical Computer Science. 652, 18-27. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/3881