Hierarchical attribute based encryption with continuous leakage-resilience

Li, Jiguo; Yu, Qihong; Zhang, Yichen

doi:10.1016/j.ins.2019.01.052

Cited by 96 publications

(42 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Authors gave the formal definition and security model of hierarchical attribute-based encryption (HABE) with continuous leakage-resilience in [32]. They presented a ciphertext-policy HABE scheme with continuous leakageresilience.…”

Section: Attribute-based Encryptionmentioning

confidence: 99%

How to Hide the Real Receiver Under the Cover Receiver: CP-ABE With Policy Deniability

2020

View full text Add to dashboard Cite

Attribute-based encryption (ABE) is a useful tool for sharing an encrypted data to a target group. In a ciphertext-policy ABE (CP-ABE) scheme, a ciphertext includes a policy to indicate its receivers and only those receivers can correctly decrypt the ciphertext. Since this design leaks the receiver identity, it may raise a new security issue about user privacy. Some hidden-policy ABE schemes, where the policy is secretly protected, are proposed to keep user privacy. However, these hidden-policy ABE schemes rely on the user trying all possibilities to decide if it belongs to the wanted receiver group. The decryption costs too much and every potential receiver will run the decryption process in vain since it does not know the policy. In this work, we apply the deniability concept to solve this problem. The encryption scheme allows the sender to claim the ciphertext is for some receiver group while actually it is for another receiver group. Both receiver groups can correctly decrypt the ciphertext except that the real group can get the real message and the cover group will get the cover message. While coercion, the sender can definitely claim the ciphertext is for the cover group and the real group is kept confidential. INDEX TERMS Attribute-based encryption, deniable encryption, identity-based encryption.

show abstract

Section: Attribute-based Encryptionmentioning

confidence: 99%

How to Hide the Real Receiver Under the Cover Receiver: CP-ABE With Policy Deniability

2020

View full text Add to dashboard Cite

show abstract

“…If the key is leaked, every address being randomized from that key could be calculated. The key management can be further secured with advanced leakage-resilience key policies [45], [46].…”

Section: B Linux Implementationmentioning

confidence: 99%

An Info-Leak Resistant Kernel Randomization for Virtualized Systems

Vañó-García

Marco-Gisbert

2020

IEEE Access

View full text Add to dashboard Cite

Given the significance that the cloud paradigm has in modern society, it is extremely important to provide security to users at all levels, especially at the most fundamental ones since these are the most sensitive and potentially harmful in the event of an attack. However, the cloud computing paradigm brings new challenges in which security mechanisms are weakened or deactivated to improve profitability and exploitation of the available resources. Kernel randomization is an important security mechanism that is currently present in all main operating systems. Function-Granular Kernel Randomization is a new step that aims to be the future of the kernel randomization, because it provides much more security than current kernel randomization approaches. Unfortunately, function-granular kernel randomization also impacts significantly on the performance and potential benefits of memory deduplication. Both functiongranular kernel randomization and memory deduplication are desired and beneficial; the first for the strong protection it gives, and the second for the reduction of costs in terms of memory consumption. In this paper, we analyse the impact of function-granular kernel randomization on memory deduplication revealing why it cannot offer maximum security and shareability of memory simultaneously. We also discuss the reasons why having a full position independent kernel code counter-intuitively does not solve the problem introducing a challenge to kernel randomization designers. To solve these problems, we propose a functiongranular kernel randomization modification for cloud systems that enables full function-granular kernel randomization while reduces memory deduplication cancellations to almost zero. The proposed approach forces guest kernels of the same tenant to have the same random memory layout of memory regions with high impact on deduplication, ensuring a high rate of deduplicated pages while the kernel randomization is fully enabled. Our approach enables cloud providers to have both, high levels of security and an efficient use of resources.

show abstract

“…In order to improve efficiency, Emura et al [28] presented a CP-ABE scheme with constant ciphertext size. Many ABE schemes [29][30][31][32][33][34][35][36][37][38] were presented in various application domains, such as ABE with outsourced data decryption [29,30,37], ABE with efficient attribute revocation [31], ABE with full verifiability [30], ABE with keyword search function [29,31], traceable ABE [32,33], ABE with leakage resilience [34][35][36], auditable ABE [38], etc. In order to solve key escrow problem, Li et al [39,40] presented two certificate-based encryption schemes with leakage resilience.…”

Section: Related Workmentioning

confidence: 99%

Two-Party Attribute-Based Key Agreement Protocol with Constant-Size Ciphertext and Key

Zhang

2018

Security and Communication Networks

Self Cite

View full text Add to dashboard Cite

Based on mutual authentication, the session key is established for communication nodes on the open network. In order to satisfy fine-grained access control for cloud storage, the two-party attribute-based key agreement protocol (TP-AB-KA) was proposed. However, the existing TP-AB-KA protocol is high in the cost of computation and communication and is not unfit for application in a mobile cloud setting because mobile devices are generally resource constrained. To solve the above issue, we propose a TP-AB-KA protocol with constant-size ciphertext and key. Our TP-AB-KA protocol is provable security in the standard model. The concrete proof is given under the augmented multisequence of exponents' decisional Diffie-Hellman (aMSE-DDH) hypothesis in the attribute-based BJM model (AB-BJM). Compared with the existing TP-AB-KA protocols, the computation cost and communication cost of our protocol are largely reduced.

show abstract

Hierarchical attribute based encryption with continuous leakage-resilience

Cited by 96 publications

References 21 publications

How to Hide the Real Receiver Under the Cover Receiver: CP-ABE With Policy Deniability

How to Hide the Real Receiver Under the Cover Receiver: CP-ABE With Policy Deniability

An Info-Leak Resistant Kernel Randomization for Virtualized Systems

Two-Party Attribute-Based Key Agreement Protocol with Constant-Size Ciphertext and Key

Contact Info

Product

Resources

About