Proxy re-encryption

About: Proxy re-encryption is a research topic. Over the lifetime, 708 publications have been published within this topic receiving 33624 citations.

Improved anonymous proxy re-encryption with CCA security

Abstract: Outsourcing private data and heavy computation tasks to the cloud may lead to privacy breach as attackers (e.g., malicious outsiders or cloud administrators) may correlate any relevant information to penetrate information of their interests. Therefore, how to preserve cloud users' privacy has been a top concern when adopting cloud solutions. In this paper, we investigate the identity privacy problem for the proxy re-encryption, which allows any third party (e.g., cloud) to re-encrypt ciphertexts in order to delegate the decryption right from one to another user. The relevant identity information, e.g., whose ciphertext was re-encrypted to the ciphertext under whose public key, may leak because re-encryption keys and ciphertexts (before and after re-encryption) are known to the third party. We review prior anonymity (identity privacy) notions, and find that these notions are either impractical or too weak. To address this problem thoroughly, we rigorously define the anonymity notion that not only embraces the prior anonymity notions but also captures the necessary anonymity requirement for practical applications. In addition, we propose a new and efficient proxy re-encryption scheme. The scheme satisfies the proposed anonymity notion under the Squared Decisional Bilinear Diffie-Hellman assumption and achieves security against chosen ciphertext attack under the Decisional Bilinear Diffie-Hellman assumption in the random oracle model. To the best of our knowledge, it is the first proxy re-encryption scheme attaining both chosen-ciphertext security and anonymity simultaneously.We implement a prototype based on the proposed proxy re-encryption scheme and the performance study shows that it is efficient.

Proxy re-encryption system, transmitter, re-encryption key generating device, proxy device, receiver, proxy re-encryption method, programs therefor, and recording medium

Abstract: PROBLEM TO BE SOLVED: To obtain a bidirectional multi-hop type proxy re-encryption system having security as high as that in the case that bilinear mapping is used with a standard model without using bilinear mapping SOLUTION: In a bidirectional multi-hop type proxy re-encryption system including a disclosed parameter generator 110, a transmitter 120, receivers 130 and 160, a re-encryption key generating means 140 and a proxy, in the case of key generation, encryption processing and decryption processing, an ABO-TDF (All-But-One lossy trapdoor unidirectional function), a reLTDF (re-applicable (n, k)-lossy trapdoor unidirectional function) and its homomorphism are utilized COPYRIGHT: (C)2011,JPO&INPIT

Proxy re-encryption for fine-grained access control: Its applicability, security under stronger notions and performance

Abstract: Proxy Re-encryption (PRE) offers an efficient solution for enforcing access control on outsourced data through delegation of decryption rights of a delegator to a delegatee. However, to meet practical security requirements of an access control model, the delegator must control these delegations such that a re-encryption key enables the delegation of decryption rights of only a subset of the delegator’s ciphertexts. In this paper, we focus on a category of PRE-based primitives, which we refer to as “PRE with controlled delegation”. In these primitives, instead of the re-encryption key alone, the re-encryption key and authorization of the delegatee for a data item collectively determine whether the ciphertext transformation results in a valid re-encrypted ciphertext under the delegatee’s public key. This paper provides an exhaustive functional, security and performance analysis of all the existing schemes for PRE with controlled delegation in a concrete fine-grained access control model. We show that the traditional PRE security notions are insufficient to address all the security aspects of the access control model. Motivated by our analysis, we formulate stronger security notions and state the desirable efficiency requirements for PRE schemes applicable in the concrete fine-grained access control model. We show the validity of the proposed security notions by formally proving the insecurity of a conventional PRE scheme and security of one of the PRE schemes with controlled delegation under the proposed stronger PRE security notions. We critically analyze all schemes for PRE with controlled delegation under the proposed stronger security notions and with respect to the efficiency requirements. We show that no scheme for PRE with controlled delegation simultaneously satisfies the efficiency and security requirements formulated in this paper. Finally, we present possible future research directions to obtain a PRE-based solution that is secure under the proposed stronger security notions and satisfies all desirable performance requirements in a fine-grained access control model.

A Secure Privacy Preserving Proxy re-encryption Scheme for IoT Security using Near-ring

Abstract: In current years, Internet of Things (IoT) has attained tremendous growth which includes all the aspects of private and public sectors. The resource constrained nature of IoT devices enables the IoT devices to store and access their sensitive data across the cloud computing platforms. The outsourced data do not only include users personal information's but also contain various information's such as sensor data, device data and several other confidential information's. Thus, the property of security remains to be the major concern across IoT based cloud system. In this article, we describe a secure privacy preserving proxy re- encryption scheme for IoT security using near-ring. The proposed approach solves DLP based factor problem using near-ring. It is observed from the security analysis that the proposed approach is highly secure with lesser computational overheads