Book ChapterDOI
Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation
Junzuo Lai,Zhengan Huang,Man Ho Au,Xianping Mao +3 more
- Vol. 847, pp 1-16
Reads0
Chats0
TLDR
The proposed scheme is proved to be CCA-secure in the standard model (i.e., without using the random oracle heuristic), and its ciphertext remains constant-size regardless of how many times it has been transformed.Abstract:
In this paper, we utilize the recent advances in indistinguishability obfuscation, overcome several obstacles and propose a multi-hop unidirectional proxy re-encryption scheme. The proposed scheme is proved to be CCA-secure in the standard model (i.e., without using the random oracle heuristic), and its ciphertext remains constant-size regardless of how many times it has been transformed.read more
Citations
More filters
Journal ArticleDOI
Proxy Re-Encryption
TL;DR: This paper analyzes the secure access delegation problem, which occurs naturally in the cloud, and postulate that Proxy Re-Encryption is a feasible cryptographic solution, both from the functional and efficiency perspectives.
Journal ArticleDOI
A Novel Revocable and Identity-Based Conditional Proxy Re-Encryption Scheme With Ciphertext Evolution for Secure Cloud Data Sharing
TL;DR: Wang et al. as mentioned in this paper proposed an improved revocable and identity-based conditional proxy re-encryption scheme with ciphertext evolution (RIB-CPRE-CE), which inherits the characteristics of multi-use, constant ciphertext length, fine-grained authorization, collision-resistance security, and chosen ciphertext attack (CCA) from the original method.
Proceedings ArticleDOI
Towards IoT Security Automation and Orchestration
TL;DR: In this paper, a framework integrating key elements for IoT security automation and orchestration is proposed, and the authors investigate the existing landscapes, discuss the current challenges, and identify future directions.
Journal ArticleDOI
Proxy re-encryption for fine-grained access control: Its applicability, security under stronger notions and performance
Gaurav Pareek,B. R. Purushothama +1 more
TL;DR: 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 shows that the traditional PRE security notions are insufficient to address all the security aspects of theaccess control model.
Book ChapterDOI
Attribute-Based Conditional Proxy Re-encryption in the Standard Model Under LWE
TL;DR: Wang et al. as mentioned in this paper proposed an attribute-based conditional proxy re-encryption (AB-CPRE) scheme based on the learning with errors (LWE) assumption, which is unidirectional, single-hop, and enables a polynomial-depth boolean circuit as its policy.
References
More filters
Proceedings ArticleDOI
Fully homomorphic encryption using ideal lattices
TL;DR: This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
Book ChapterDOI
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Dan Boneh,Xavier Boyen +1 more
TL;DR: The first secure IBE scheme without random oracles was presented in this article, where the adversary must commit ahead of time to the identity that it intends to attack, whereas in the standard model the adversary is allowed to choose this identity adaptively.
Journal ArticleDOI
Improved proxy re-encryption schemes with applications to secure distributed storage
TL;DR: Performance measurements of the experimental file system demonstrate the usefulness of proxy re-encryption as a method of adding access control to a secure file system and present new re-Encryption schemes that realize a stronger notion of security.
Book ChapterDOI
Divertible protocols and atomic proxy cryptography
TL;DR: A definition of protocol divertibility is given that applies to arbitrary 2-party protocols and is compatible with Okamoto and Ohta's definition in the case of interactive zero-knowledge proofs and generalizes to cover several protocols not normally associated with divertibility.
Book ChapterDOI
On the (Im)possibility of Obfuscating Programs
TL;DR: It is proved that obfuscation is impossible, by constructing a family of functions F that are inherently unobfuscatable in the following sense: there is a property π : F → {0, 1} such that given any program that computes a function f ∈ F, the value π(f) can be efficiently computed.
Related Papers (5)
Multi-use unidirectional identity-based proxy re-encryption from hierarchical identity-based encryption
Jun Shao,Zhenfu Cao +1 more