Collusion Attack-Resilient Hierarchical Encryption of JPEG 2000 Codestreams with Scalable Access Control

Author(s):  
Shoko Imaizumi ◽  
Masaaki Fujiyoshi ◽  
Yoshito Abe ◽  
Hitoshi Kiya
2021 ◽  
Vol 13 (10) ◽  
pp. 262
Author(s):  
Jia Shi ◽  
Xuewen Zeng ◽  
Yang Li

Standalone Name Resolution (SNR) is an essential component of many Information-Centric Networking (ICN) infrastructures that maps and stores the mappings of IDs and locators. The delivery of data can be realized only when the name resolution process is completed correctly. It also makes the SNR become the key target of network attackers. In this paper, our research focuses on the more covert and complex Content Pollution Attack (CPA). By continuously sending invalid content to the network at a low speed, attackers will consume a lot of the resources and time of the SNR system, resulting in a serious increase in the resolution delay of normal users and further cache pollution in ICN. It is difficult to be quickly detected because the characteristics of attack are inconspicuous. To address the challenge, a register access control scheme for an SNR system based on a malicious user blacklist query is proposed. A neighbor voting algorithm is designed to discover possible attacks in the network quickly and build a blacklist of malicious users reasonably. Users on the blacklist will be restricted from accessing the ICN network during the registration phase with the resolution system. Incentives and punishments for network users are introduced to automate responses about the potential malicious behavior reports. Our scheme is more efficient as users do not have to wait for an additional system component to perform operations. In addition, our algorithm can better solve the collusion problem in the voting process when compared with the others. We experimentally evaluate our protocol to demonstrate that the probability of successful collusion attack can be reduced to less than 0.1 when the attacker ratio is 0.5.


2007 ◽  
Vol 9 (6) ◽  
pp. 1314-1324 ◽  
Author(s):  
Yongdong Wu ◽  
Di Ma ◽  
R.H. Deng
Keyword(s):  

Author(s):  
Ayman Haggag ◽  
◽  
Mohamed Ghoneim ◽  
Jianming Lu ◽  
Takashi Yahagi ◽  
...  

The access control and scalable encryption scheme we propose for JPEG 2000 encoded images encrypts JEPG 2000 codestreams using the SNOW 2 progressive encryption algorithm to encrypt resolutions, quality layers, or packets independently to provide resolution, quality or fine-grain scalability. Access is controlled to different image resolutions or quality levels granted to different users receiving the same encrypted JPEG 2000 codestream but having different decryption keys. Keys used with successive resolutions or quality layers are mutually dependent based on the SHA-256 one-way hashing function. Encrypted JPEG 2000 codestreams are transcoded by an intermediate untrusted network transcoder, without decryption and without access to decryption keys. Our encryption scheme preserves most of the inherent flexibility of JPEG 2000 encoded images and is carefully designed to produce encrypted codestreams backward-compatible with JPEG 2000 compliant decoders.


2021 ◽  
Author(s):  
Baris Celiktas ◽  
Sueda Guzey ◽  
Enver Ozdemır

An inner product space-based hierarchical key assignment/access control scheme is presented in this work. The proposed scheme can be utilized in any cloud delivery model where the data controller implements a hierarchical access control policy. In other words, the scheme adjusts any hierarchical access control policy to a digital medium. The scheme is based on inner product spaces and the method of orthogonal projection. While distributing a basis for each class by the data controller, the left-to-right and bottom-up policy can ensure much more flexibility and efficiency, especially during any change in the structure. For each class, the secret keys can be derived only when a predetermined subspace is available. The parent class can obtain the keys of the child class, which means a one-way function, and the opposite direction is not allowed. Our scheme is collusion attack and privilege creep problem resistant, as well as key recovery and indistinguishability secure. The performance analysis shows that the data storage overhead is much more tolerable than other schemes in the literature. In addition, the other advantage of our scheme over many others in the literature is that it needs only one operation for the derivation of the key of child classes.


Author(s):  
Shoko Imaizumi ◽  
Masaaki Fujiyoshi ◽  
Hitoshi Kiya ◽  
Naokazu Aoki ◽  
Hiroyuki Kobayashi

2001 ◽  
Author(s):  
Raphael Grosbois ◽  
Pierre Gerbelot ◽  
Touradj Ebrahimi

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Bing-Zhe He ◽  
Chien-Ming Chen ◽  
Tsu-Yang Wu ◽  
Hung-Min Sun

The time-bound hierarchical key assignment scheme provides a cryptographic solution for the access control problem in distributed systems (e.g., Pay-TV and cloud computing applications). Most time-bound hierarchical key assignment schemes can be divided into two types: adopting tamper-resistant devices and utilizing public values. Despite the fact that adopting tamper-resistant devices can easily resist to collusion attacks, utilizing public values is much cheaper and more suitable for cloud environment. In this paper, we proposed a new time-bound hierarchical key assignment scheme, which can effectively defeat the collusion attack. Besides, the proposed scheme utilizes public values instead of tamper-resistant devices, which will restrict user’s convenience. Compared with the previous works, our scheme requires fewer public values and has better performance.


Sign in / Sign up

Export Citation Format

Share Document