Results 261 to 270 of about 250,057 (298)
Visual Cryptography Schemes for Graph Based Access Structures
2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2013 Visual cryptography schemes (VCS) have been introduced by Naor and Shamir [NS94] and involve a dealer encoding a secret image into shares that are distributed to a number of participants. In general, the collection of subsets of participants that can recover the secret is organized in an access structure.
S. Cimato, Stelvio Cimato
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Optimal Information Rates of Novel Graph Based Access Structures
2009 Fifth International Conference on Information Assurance and Security, 2009The optimal information rate of a graph (based access structure) is the best achievable information rate of any PSSS realizing it, which has been studied in a large number of articles during the last two decades. However the optimal information rates are only known for certain graphs.
openaire +3 more sources
SIAM Journal on Discrete Mathematics, 2010
The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes.
Hung-Min Sun +3 more
openaire +4 more sources
The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes.
Hung-Min Sun +3 more
openaire +4 more sources
A knowledge graph empowered online learning framework for access control decision-making [PDF]
World Wide Web, 2022 Knowledge graph, as an extension of graph data structure, is being used in a wide range of areas as it can store interrelated data and reveal interlinked relationships between different objects within a large system.
Mingshan You, Jiao Yin, Hua Wang
exaly +2 more sources
The complexity of the graph access structures on six participants
Designs, Codes and Cryptography, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Motahhareh Gharahi +1 more
openaire +1 more source
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures
IEEE Transactions on Information Theory, 2017A secret-sharing scheme realizes the forbidden graph access structure determined by a graph \(G=(V,E)\) if a pair of vertices can reconstruct the secret if and only if it is an edge in G. Secret-sharing schemes for forbidden graph access structures of bipartite graphs are equivalent to conditional disclosure of secrets protocols, a primitive that is ...
Amos Beimel +3 more
openaire +2 more sources
The optimal information rate for graph access structures of nine participants
Frontiers of Computer Science, 2015The information rate is an important metric of the performance of a secret-sharing scheme. In this paper we consider 272 non-isomorphic connected graph access structures with nine vertices and eight or nine edges, and either determine or bound the optimal information rate in each case.
Yun Song +3 more
openaire +1 more source
Optimal linear secret sharing schemes for graph access structures on six participants
Theoretical Computer Science, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Motahhareh Gharahi, Shahram Khazaei
openaire +2 more sources
The Optimal Information Rates of the Graph Access Structures on Seven Participants
Advanced Materials Research, 2013The information rate is an important metric of the performance of a secret-sharing scheme. In this paper, we deal with determining the exact values for the optimal information rates of the six graph access structures and improving the information rate of a graph access structure on seven participants, which remained as open problems in Song's and Wang ...
Zhi Hui Li, Yun Song, Yong Ming Li
openaire +1 more source
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs
2020The share size of general secret-sharing schemes is poorly understood. The gap between the best known upper bound on the total share size per party of \(2^{0.64n}\) (Applebaum et al., STOC 2020) and the best known lower bound of \(\varOmega (n/\log n)\) (Csirmaz, J. of Cryptology 1997) is huge (where n is the number of parties in the scheme).
Amos Beimel, Oriol Farràs
openaire +2 more sources