FASE: Fine-Grained Accountable and Space-Efficient Access Control for Multimedia Content With In-Network Caching

He, Peixuan; Xue, Kaiping; Yang, Jiayu; Xia, Qiudong; Liu, Jianqing; Wei, Dennis

doi:10.1109/tnsm.2021.3096428

Cited by 13 publications

(7 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The more flexible access control model attribute-based encryption [12], [13], [14] and broadcast encryption [15] presented in the literature. However, the user/attribute revocation and change of class/channel needs the update of whole system parameters [16], and so it is not practical.…”

Section: Introductionmentioning

confidence: 99%

A Dynamic Time-Bound Access Control for Secure Hierarchical Content Sharing

Odelu¹

2023

Preprint

View full text Add to dashboard Cite

With rapid growth of mobile users, protecting content from unauthorized users become a complex problem. The concept of temporal role-based access control reduces complexity of user management and restricts access to specified time-slots. But, content privacy is still questionable in case of system resources compromise unexpectedly. Therefore, cryptographic solution for time-bound hierarchical content management is an emerging problem. Most of the related schemes focused on individual user keys and/or revocation, but not on time-bound keys. Hence, these are not well suitable for subscription-based services like pay-TV and newspaper. In this paper, we propose a cryptographic time-bound access control with constant size time-bound keys. In our scheme, subscribed time-slots embed into individual user keys to avoid periodical broadcasting of temporal keys. We prove that our scheme is selectively secure against collision attack under chosen-ciphertext attack. We then discuss cloud-based application to show the strategies of efficient revocation and reduced computational overheads for end-users.

show abstract

Section: Introductionmentioning

confidence: 99%

A Dynamic Time-Bound Access Control for Secure Hierarchical Content Sharing

Odelu¹

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…To address the aforementioned issues, previous studies have put forth over 60 enhanced bloom filters with the aim of enhancing their adaptability and performance [ 4 ]. These enhanced bloom filters exhibit enhanced flexibility and performance benefits in various application scenarios, including content caching [ 5 , 6 , 7 , 8 , 9 , 10 ], data storage [ 11 , 12 , 13 , 14 , 15 ], and other domains. By reducing false positives, optimizing implementation, augmenting collection diversity, and enriching functionalities, these enhanced bloom filters offer improved adaptability and efficacy, thereby rendering bloom filters a more potent tool for handling extensive datasets.…”

Section: Introductionmentioning

confidence: 99%

“…The calculation process for determining the probability P of false positives for n numbers is illustrated in Equation (7).…”

mentioning

confidence: 99%

PSBF: p-adic Integer Scalable Bloom Filter

Yi,

Wang,

Xie

et al. 2023

Sensors

View full text Add to dashboard Cite

Given the challenges associated with the dynamic expansion of the conventional bloom filter’s capacity, the prevalence of false positives, and the subpar access performance, this study employs the algebraic and topological characteristics of p-adic integers to introduce an innovative approach for dynamically expanding the p-adic Integer Scalable Bloom Filter (PSBF). The proposed method involves converting the target element into an integer using a string hash function, followed by the conversion of said integer into a p-adic integer through algebraic properties. This process automatically establishes the topological tree access structure of the PSBF. The experiment involved a comparison of access performance among the standard bloom filter, dynamic bloom filter, and scalable bloom filter. The findings indicate that the PSBF offers advantages such as avoidance of a linear storage structure, enhanced efficiency in element insertion and query, improved storage space utilization, and reduced likelihood of false positives. Consequently, the PSBF presents a novel approach to the dynamic extensibility of bloom filters.

show abstract

“…The more flexible access control model Attribute-Based Encryption (ABE) [12], [13], [14] presented in the literature. However, the user/attribute revocation is little challenging in the ABE models [15].…”

Section: Introductionmentioning

confidence: 99%

A Dynamic Time-Bound Access Control for Secure Hierarchical Content Sharing

Odelu¹

2022

Preprint

View full text Add to dashboard Cite

With rapid growth of mobile users, protecting content from unauthorized users become a complex problem. The concept of temporal role-based access control reduces complexity of user management and restricts access to specified time-slots. But, content privacy is still questionable in case of system resources compromise unexpectedly. Therefore, cryptographic solution for time-bound hierarchical content management is an emerging problem. Most of the related schemes focused on individual user keys and/or revocation, but not on time-bound keys. Hence, these are not well suitable for subscription-based services like pay-TV and newspaper. In this paper, we propose a cryptographic time-bound access control with constant size time-bound keys. In our scheme, subscribed time-slots embed into individual user keys to avoid periodical broadcasting of temporal keys. We prove that our scheme is selectively secure under chosen-ciphertext attack. We then discuss cloud-based application to show the strategies of efficient revocation and reduce user computational overheads.

show abstract

FASE: Fine-Grained Accountable and Space-Efficient Access Control for Multimedia Content With In-Network Caching

Cited by 13 publications

References 42 publications

A Dynamic Time-Bound Access Control for Secure Hierarchical Content Sharing

A Dynamic Time-Bound Access Control for Secure Hierarchical Content Sharing

PSBF: p-adic Integer Scalable Bloom Filter

A Dynamic Time-Bound Access Control for Secure Hierarchical Content Sharing

Contact Info

Product

Resources

About