Reduced access structures with four minimal qualified subsets on six participants
type: Item
instance of: scholarly article
title: Reduced access structures with four minimal qualified subsets on six participants
zbMATH Open document ID: 1414.94921
author: Motahhareh Gharahi
author: Shahram Khazaei
published in: Advances in Mathematics of Communications
publication date: 2018-09-21T00:00:00Z
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6941224
zbMATH Keywords: secret sharing scheme
zbMATH Keywords: optimal information ratio
zbMATH Keywords: decomposition techniques
MaRDI profile type: Publication
full work available at URL: amc.2018014
OpenAlex ID: W2791789808
cites work: Secret-Sharing Schemes: A Survey
cites work: Multi-linear Secret-Sharing Schemes
cites work: Graph decompositions and secret sharing schemes
cites work: Tight bounds on the information rate of secret sharing schemes
cites work: Some improved bounds on the information rate of perfect secret sharing schemes
cites work: On the size of shares for secret sharing schemes
cites work: An impossibility result on graph secret sharing
cites work: Secret sharing on the \(d\)-dimensional cube
cites work: Optimal Information Rate of Secret Sharing Schemes on Trees
cites work: Optimal Non-perfect Uniform Secret Sharing Schemes
cites work: On the optimization of bipartite secret sharing schemes
cites work: Perfect secret sharing schemes for graph access structures on six participants
cites work: The complexity of the graph access structures on six participants
cites work: Geometric secret sharing schemes and their duals
cites work: Perfect secret sharing schemes on five participants
cites work: On secret sharing systems
cites work: Secret sharing schemes with three or four minimal qualified subsets
cites work: Secret sharing schemes on access structures with intersection number equal to one
cites work: Optimal complexity of secret sharing schemes with four minimal qualified subsets
cites work: Q4288075
cites work: Secret sharing schemes with bipartite access structure
cites work: Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
cites work: Finding lower bounds on the complexity of secret sharing schemes by linear programming
cites work: How to share a secret
cites work: An explication of secret sharing schemes
cites work: Decomposition constructions for secret-sharing schemes
cites work: Weighted decomposition construction for perfect secret sharing schemes
cites work: Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time
cites work: On the information rate of perfect secret sharing schemes
cites work: A general decomposition construction for incomplete secret sharing schemes
cites work: Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
Wikidata QID: Q130002424
DOI: 10.3934/AMC.2018014
description: scientific article; zbMATH DE number 6941224