scholarly journals An Inner Product Space-Based Hierarchical Key Assignment Scheme for Access Control

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.

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.


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

<div>An inner product space-based hierarchical access control scheme is presented in this work. The proposed scheme can be utilized in any cloud delivery model where the data owner 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 owner, left-to-right and bottom-up (LRBU) 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. Our scheme is resistant to collusion attacks and privilege creep problems, as well as providing key recovery and key indistinguishability security. The performance analysis also shows us that the data storage overhead is much more tolerable than other schemes in the literature. In addition, the other advantage of our key access scheme over many others in the literature is that it requires only one operation to derive the secret key of child classes securely and efficiently.</div>


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

<div>An inner product space-based hierarchical access control scheme is presented in this work. The proposed scheme can be utilized in any cloud delivery model where the data owner 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 owner, left-to-right and bottom-up (LRBU) 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. Our scheme is resistant to collusion attacks and privilege creep problems, as well as providing key recovery and key indistinguishability security. The performance analysis also shows us that the data storage overhead is much more tolerable than other schemes in the literature. In addition, the other advantage of our key access scheme over many others in the literature is that it requires only one operation to derive the secret key of child classes securely and efficiently.</div>


Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 765
Author(s):  
Lorena Popa ◽  
Lavinia Sida

The aim of this paper is to provide a suitable definition for the concept of fuzzy inner product space. In order to achieve this, we firstly focused on various approaches from the already-existent literature. Due to the emergence of various studies on fuzzy inner product spaces, it is necessary to make a comprehensive overview of the published papers on the aforementioned subject in order to facilitate subsequent research. Then we considered another approach to the notion of fuzzy inner product starting from P. Majundar and S.K. Samanta’s definition. In fact, we changed their definition and we proved some new properties of the fuzzy inner product function. We also proved that this fuzzy inner product generates a fuzzy norm of the type Nădăban-Dzitac. Finally, some challenges are given.


1994 ◽  
Vol 37 (3) ◽  
pp. 338-345 ◽  
Author(s):  
D. Ž. Doković ◽  
P. Check ◽  
J.-Y. Hée

AbstractLet R be a root system (in the sense of Bourbaki) in a finite dimensional real inner product space V. A subset P ⊂ R is closed if α, β ∊ P and α + β ∊ R imply that α + β ∊ P. In this paper we shall classify, up to conjugacy by the Weyl group W of R, all closed sets P ⊂ R such that R\P is also closed. We also show that if θ:R —> R′ is a bijection between two root systems such that both θ and θ-1 preserve closed sets, and if R has at most one irreducible component of type A1, then θ is an isomorphism of root systems.


Sign in / Sign up

Export Citation Format

Share Document