International Journal of Security and Its Applications

Research on Non-interactive Construction based on Fuzzy Conditional Proxy Re-encryption

Chunpeng Ge, Jiandong Wang, Liming Fang

Published Dec 31, 2015• 0 citations

Abstract

In a conditional proxy re-encryption (C-PRE) scheme, a semi-trusted proxy can transform Alice's ciphertext into Bob's ciphertext without learning the underlying plaintext, if the ciphertext satisfies a certain condition.To achieve more fine-grained delegation on conditions, Fang, Wang and Ge introduced the notion of fuzzy conditional proxy re-encryption (FC-PRE), whereby the conditions is viewed a set of descriptive keywords.The proxy with a re-encryption key for a condition word set can convert a ciphertext encrypted with a condition word set , if and only if and are close to each other as measured by the "set overlap" distance metric.Nonetheless, they left an open problem on how to construct a non-interactive FC-PRE scheme.Furthermore, their scheme is only proved secure in the random oracle model.In this paper, we answer the above problems affirmatively by presenting a non-interactive fuzzy conditional proxy reencryption scheme.Moreover, our scheme is proved secure without random oracles.

DOI: 10.14257/ijsia.2015.9.12.36

Related papers

A Key-Policy Attribute-Based Proxy Re-Encryption Without Random Oracles: Table 1.

Chunpeng Ge, Willy Susilo, Jiandong Wang +3 more

A conditional proxy re-encryption (CPRE) scheme enables the proxy to convert a ciphertext from Alice to Bob, if the ciphertext satisfies one condition set by Alice. To improve the issue of more fine-grained on the condition set, Fang, Wang, Ge and Ren proposed a new primitive named Interactive conditional PRE with fine grain policy (ICPRE-FG) in 2011, and left an open problem on how to construct CCA-secure ICPRE-FG without random oracles. In this paper, we answer this open problem affirmatively by presenting a new construction of CCA-secure key-policy attribute-based PRE (KP-ABPRE) without random oracles. In this paper, we enhance the security model of Fang's ICPRE-FG scheme by allowing the adversary to make some extra queries, which do not help them win the game trivially. Finally, we present a CCA-secure KP-ABPRE without random oracles under the 3-weak decisional bilinear Diffie–Hellman inversion(3-wDBDHI) assumption.

The Computer JournalNov 12, 201540 citations

Identity-based multi-condition proxy re-encryption

Pingshu Wang

In a proxy re-encryption system, a semi-trusted proxy can convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob without seeing the underlying plaintext.However, a fine-grained delegation is demanded in some scenarios.For this, Weng et al. introduce the notion of conditional proxy re-encryption (CPRE), and formalize its security model and propose an efficient CPRE scheme.This paper presents the notion of identity-based multi-condition proxy re-encryption, which is a variant of identity-based condition proxy re-encryption.In such system, ciphertexts are generated under specified conditions by Alice, and the proxy can translate the ciphertext if the relevant conditions are satisfied.We formalize its security model and construct a concrete multi-condition proxy re-encryption scheme, and prove its security in the standard model.

International Conference on Advances in Mechanical Engineering and Industrial Informatics (AMEII)Jan 1, 20162 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

Lattice-based Fuzzy Conditional Proxy Re-encryption

Baohong Li, JieFei Xu, Yanzhi Liu

As an extension to conditional proxy re-encryption, fuzzy conditional proxy re-encryption allows for a proxy to re-encrypt a ciphertext only if it satisfies some t-out-of-d threshold condition. Therefore, it is more desirable in some applications where fine-grained control of the decryption delegation is required. In this paper, we construct the first lattice-based fuzzy conditional proxy re-encryption scheme as a post-quantum alternative to this primitive. In our construction, original ciphertexts and re-encryption ciphertexts have the same form, thus only one decryption algorithm is needed for both kinds of ciphertexts. We formalize its security model and prove that it is selective secure under the LWE assumption.

網際網路技術學刊Sep 1, 20191 citation

A Fine-grained Certificateless Conditional Proxy Broadcast Re-Encryption Scheme Without Pairing

Hongfei Yang, Li Li, Chunyan Yang

Proxy re-encryption allows a semi-trusted proxy to convert the ciphertext of the data owner into the ciphertext of the target user. The certificateless proxy re-encryption eliminates the need for public key certificate in traditional public-key cryptography and key-escrow problem in identity-based cryptography, which makes it more convenient to apply. However, the existing certificateless proxy re-encryption schemes cannot support one-to-many conversion and flexible control on convert conditions. In this paper, we propose a fine-grained certificateless conditional proxy broadcast re-encryption scheme without pairing. In our scheme, the data owner can delegate the decryption rights of the ciphertext that meets certain conditions to the target users, and the data owner can revoke the delegate rights. At the same time, no pairing is used, which makes the scheme more efficient. Finally, we show that the security of the scheme for chosen-ciphertext attacks in the random oracle model.

IEEE Joint International Information Technology and Artificial Intelligence Conference (ITAIC)Jun 17, 20228 citations

On the Security of Group-based Proxy Re-encryption Scheme.

B. Purushothama, B. B. Amberker

Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext intended for Alice into a ciphertext for Bob without learning anything about the underlying plaintext. Chunbo Ma et al. have proposed a group based proxy re-encryption scheme to convert a ciphertext from one group to another. Any group member can independently decrypt the ciphertexts encrypted to its group. In their paper, the authors gave a security proof to say that the scheme is secure against adaptive chosen ciphertext attack. However, we highlight the aws in their scheme and show that their scheme is not secure against adaptive chosen ciphertext attack. In this direction, we construct an adversary who issues only one decryption oracle query and break the security of their scheme with non-negligible advantage.

Jan 1, 20131 citation