IEEE Symposium on Computer Applications and Communications (SCAC)

A CCA-Secure Multi-use Identity-Based Proxy Re-encryption Scheme

Yi Cai, Xudong Liu

Published Jul 1, 2014• 2 citations

Abstract

Proxy re-encryption (PRE) has recently become a hot topic in cryptography research field. PRE can be classified as single-hop PRE and multi-use PRE according to the times the cipher text can be transformed. Finding a unidirectional, multi-use, and chosen cipher text attack (CCA) secure PRE is presented as an open problem by Green et al. Wang claimed to resolve this problem by proposing the first multi-use CCA-secure unidirectional PRE scheme. But we found that different with single-hop PRE, multi-use PRE without randomize encrypt key in its encryption algorithm could be vulnerable to attack. A new type attack to multi-use CCA-secure PRE named proxy bypass attack is proposed with a concrete attacks on Wang-Multi-Use-IB-PRE scheme. This attack is also effective for other multi-use scheme. At last we propose an improvement for Multi-Use-IB-PRE to resist proxy bypass attack by randomize re-encryption algorithm.

DOI: 10.1109/scac.2014.18

Related papers

A Multi-use CCA-Secure Proxy Re-encryption Scheme

Yi Cai, Xudong Liu

Proxy re-encryption (PRE) can be classified as single-hop PRE and multi-use PRE according to the times which the ciphertext is transformed. Finding a unidirectional, multi-use, and chosen ciphertext attack (CCA) secure PRE is presented as an open problem by Canetti et al. Wang claimed to resolve this problem by proposing the first multi-use CCAsecure unidirectional PRE scheme. But we found that different with single-hop PRE, multi-use PRE without randomize encrypt key in its re-encryption algorithm could be vulnerable to attack. A new type attack to multi-use CCA-secure PRE named proxy bypass attack is proposed with a concrete attacks on Wang-MultiUse-PRE scheme. This attack is also effective for other multi-use scheme. At last we propose an improvement for Multi-Use-PRE to resist proxy bypass attack by randomize re-encryption algorithm.

IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)Aug 1, 20146 citations

Security Analysis of a Multi-use Identity Based CCA-Secure Proxy Re-encryption Scheme

Jindan Zhang, Xu An Wang

In proxy re-encryption (PRE), a semi-trusted proxy can convert a cipher text originally intended for Alice into one which can be decrypted by Bob, while the proxy can not know the underlying plaintext. In multi-use PRE schemes, the cipher text can be transformed from Alice to Bob and to Charlie and so on. Due to its cipher text transformation property, it is difficult to achieve chosen cipher text security for PRE, especially for multi-use PRE. IBE is a new kind of public-key encryption where the recipient's public key is an arbitrary string that represents the recipient's identity. Identity based proxy re-encryption (IBPRE) is a primitive combing the feature of IBE and PRE. Recently Wang et al. proposed a multi-use unidirectional CCA-secure identity based proxy re-encryption (IBPRE) scheme. Unfortunately, we show their proposal is not CCA-secure in the corresponding security models by giving concrete attacks.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)Sep 1, 201210 citations

On the security of two multi-use CCA-secure proxy re-encryption schemes

Jindan Zhang, Xu An Wang, Yi Ding +1 more

In proxy re-encryption (PRE), a semi-trusted proxy can convert a ciphertext originally intended for Alice into one which can be decrypted by Bob, while the proxy cannot know the corresponding plaintext. PRE can be classified as single-use PRE and multi-use PRE according to the times the ciphertext can be transformed. In multi-use PRE schemes, the ciphertext can be transformed from A to B and to C and so on. In CCS’09 (post session), Wang et al. proposed a multi-use unidirectional CCA-secure proxy re-encryption scheme. Unfortunately, we show their proposal is not CCA-secure in the corresponding security models by giving concrete attacks. In 2010, Ren et al. proposed a hierarchical identity-based proxy re-encryption scheme without random oracles, and claimed their scheme was also multi-use and CCA-secure, we also show their scheme is not secure.

International Journal of Intelligent Information and Database SystemsJan 1, 20133 citations

On the Security of a Multi-use CCA-Secure Proxy Re-encryption Scheme

Jindan Zhang, Xu An Wang

In proxy re-encryption (PRE), a semi-trusted proxy can convert a cipher text originally intended for Alice into one which can be decrypted by Bob, while the proxy can not know the corresponding plaintext. PREcan be classified as single-use PRE and multi-use PRE according to the times the cipher text can be transformed. In multi-use PRE schemes, the cipher text can be transformed from A to B and to C and so on. In CCS'09 (post session), Wan get al. proposed a multi-use unidirectional CCA-secure proxy re-encryption scheme. Unfortunately, we show their proposal is not CCA-secure in the corresponding security models by giving concrete attacks.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)Sep 1, 20126 citations

New CCA-Secure Proxy Re-encryption Scheme without Random Oracles

Xu An Wang, Ping Wei, Minqing Zhang

Proxy re-encryption (PRE) allows a ciphertext computed under Alice's public key to be transformed to those which can be decrypted by Bob. In PKC'08, Libert and Vergnaud proposed the first unidirectional RCCA-secure PRE scheme in the standard model. They left the open problem of constructing unidirectional CCA-secure PRE scheme in the standard model open. Until recently, this open problem was solved by Weng et al. and Shao et al. independently. In this paper, based on Shao et al.'s proposal, we give a new efficient CCA-secure PRE scheme without random oracles and prove its security.

International Conference on Computational Intelligence and Security (CIS)Dec 1, 20102 citations

Improving the Security of an Efficient Unidirectional Proxy Re-Encryption Scheme

Sébastien Canard, Julien Devigne, Fabien Laguillaumie

A proxy re-encryption (PRE) scheme allows a designated proxy, that has beforehand received aso-called re-encryption key, to translate a ciphertext intended to one user to a ciphertext intendedto another one. Traditionally, the re-encryption key is generated at the initiative of the initialreceiver and ideally, no secret keys should be known to the proxy. Such scheme is said unidirectionalif the transformation from one user to another does not necessarily imply the possibility tomake the inverse transformation. Regarding the literature on unidirectional proxy re-encryption, itseems hard to prove the strongest security level (namely indistinguishability under chosen ciphertextattacks - IND-CCA) of such schemes. Most of the time, PRE either reaches a chosen-plaintextsecurity or a replayable CCA security. At Africacrypt 2010, Chow, Weng, Yang and Deng proposeda scheme that satisfies CCA security in the random oracle model. However, their modelcan actually be strengthen. Indeed, we show in this paper how to modify this scheme so that itsimproved security achieves a full CCA security. In particular, we now allow the adversary of theCCA security for re-encryption to corrupt the user i′ who is the initial receiver of the challengedciphertext and at the same time to obtain the re-encryption key from i′ to the targeted users. Theresulting scheme is therefore a fully secure PRE which does not rely on pairings, and secure in therandom oracle model. It can be implemented efficiently with any traditional modular arithmetic.

Jan 1, 201121 citations