Heterogeneity-Aware Distributed Access Structure

2005 ◽  
Author(s):  
A.G. Beltran ◽  
P. Milligan ◽  
P. Sage
Keyword(s):  
Access Structure

Logic Test of Single Cycle Access Structure

2012 ◽  
Vol 2 (11) ◽  
pp. 203-205
Author(s):  
S. Ali Ahmed S. Ali Ahmed ◽  
◽  
Syed Jahangir Badashah ◽  
A. Farooq Hussain
Keyword(s):  
Access Structure ◽  
Single Cycle

scholarly journals Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three

10.37236/1825 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Jaume Martí-Farré ◽  
Carles Padró
Keyword(s):  
Secret Sharing ◽  
Access Structure ◽  
Open Problems ◽  
Access Structures ◽  
The Family ◽  
Ideal Access Structures ◽  
Optimal Information ◽  
Made In ◽  
The Ideal

One of the main open problems in secret sharing is the characterization of the ideal access structures. This problem has been studied for several families of access structures with similar results. Namely, in all these families, the ideal access structures coincide with the vector space ones and, besides, the optimal information rate of a non-ideal access structure is at most $2/3$. An access structure is said to be $r$-homogeneous if there are exactly $r$ participants in every minimal qualified subset. A first approach to the characterization of the ideal $3$-homogeneous access structures is made in this paper. We show that the results in the previously studied families can not be directly generalized to this one. Nevertheless, we prove that the equivalences above apply to the family of the sparse $3$-homogeneous access structures, that is, those in which any subset of four participants contains at most two minimal qualified subsets. Besides, we give a complete description of the ideal sparse $3$-homogeneous access structures.

Efficient Attribute-Based Data Sharing Scheme with Hidden Access Structures

2019 ◽  
Vol 62 (12) ◽  
pp. 1748-1760 ◽  
Author(s):  
Yang Chen ◽  
Wenmin Li ◽  
Fei Gao ◽  
Wei Yin ◽  
Kaitai Liang ◽  
...  
Keyword(s):  
Access Control ◽  
Data Sharing ◽  
Inner Product ◽  
Access Structure ◽  
Online Data ◽  
Fine Grained ◽  
Access Structures ◽  
Attribute Based Encryption ◽  
And Performance ◽  
Ciphertext Policy

AbstractOnline data sharing has become a research hotspot while cloud computing is getting more and more popular. As a promising encryption technique to guarantee the security shared data and to realize flexible fine-grained access control, ciphertext-policy attribute-based encryption (CP-ABE) has drawn wide attentions. However, there is a drawback preventing CP-ABE from being applied to cloud applications. In CP-ABE, the access structure is included in the ciphertext, and it may disclose user’s privacy. In this paper, we find a more efficient method to connect ABE with inner product encryption and adopt several techniques to ensure the expressiveness of access structure, the efficiency and security of our scheme. We are the first to present a secure, efficient fine-grained access control scheme with hidden access structure, the access structure can be expressed as AND-gates on multi-valued attributes with wildcard. We conceal the entire attribute instead of only its values in the access structure. Besides, our scheme has obvious advantages in efficiency compared with related schemes. Our scheme can make data sharing secure and efficient, which can be verified from the analysis of security and performance.

scholarly journals An Efficient Scheme to Support Direct Revocation in Cloud Computing Using CPABE :the Approach with Less Time Constraints

2018 ◽  
Vol 7 (3.8) ◽  
pp. 141
Author(s):  
Miss. Rupali G. Dande ◽  
Prof. Dr. Amol D. Potgantwar
Keyword(s):  
Cloud Computing ◽  
Data Security ◽  
Research Direction ◽  
Experimental Result ◽  
Main Concern ◽  
Access Structure ◽  
Practical Application ◽  
Cipher Text ◽  
File Access ◽  
Efficient Scheme

Secure Data sharing is a major issue of concern in cloud computing. CPABE is well known encryption technique for dealing with the problem of data security over the network. Most of the files have multilevel access hierarchy especially in health care and military domain. The hierarchy structure and revocation of shared files is not scrutinized in CP-ABE. In this paper, experts proposed the enhanced method of encryption to support the direct revocation, in which sender specifies the revocation list during encryption of cipher text so that the problem of releasing periodic key update information in indirect revocation is vanished. Here the direct revocation mechanism and file access based hierarchy are merged to get enhanced CPABE. The multilevel access structure is integrated and merged with encrypted files with the current access structure. Along with revocation, aim is also to improve the overall system performance with respect to encryption time and decryption time. Experimental result shows the enhanced performance of the proposed system as compared to existing system with respect to time and security constraints. Moreover the scheme is secure under the standard security assumption. Finally, based on the research, it gives forthcoming research direction to expand and implement the scheme in any practical application where security is main concern by proper coalition of the proposed technologies. 

Sign in / Sign up

Export Citation Format

Share Document