Related papers: On Ideal Secret-Sharing Schemes for $k$-homogeneou…
A {\it $k$-uniform hypergraph} $\mathcal{H}=(V, E)$ consists of a set $V$ of vertices and a set $E$ of hyperedges ($k$-hyperedges), which is a family of $k$-subsets of $V$. A {\it forbidden $k$-homogeneous (or forbidden $k$-hypergraph)}…
An ideal secret sharing scheme is a method of sharing a secret key in some key space among a finite set of participants in such a way that only the authorized subsets of participants can reconstruct the secret key from their shares which…
One of the methods used in order to protect a secret K is a secret sharing scheme. In this scheme the secret K is distributed among a finite set of participants P by a special participant called the dealer, in such a way that only…
Perfect secret sharing scheme is a method of distribute a secret information $s$ among participants such that only predefined coalitions, called qualified subsets of the participants can recover the secret, whereas any other coalitions, the…
This paper investigates the construction of efficient quantum secret sharing schemes for quantum access structures based on hypergraphs with three hyperedges. We prove that hypercycles with three hyperedges are quantum access structures if…
The information rate for an access structure is the reciprocal of the load of the optimal secret sharing scheme for this structure. We determine this value for all trees: it is 1/(2-1/c), where c is the size of the largest core of the tree.…
We give graphical characterisation of the access structure to both classical and quantum information encoded onto a multigraph defined for prime dimension $q$, as well as explicit decoding operations for quantum secret sharing based on…
Disjunctive Hierarchical Secret Sharing (DHSS) scheme is a secret sharing scheme in which the set of all participants is partitioned into disjoint subsets. Each disjoint subset is said to be a level, and different levels have different…
In an on-line secret sharing scheme the dealer assigns shares in the order the participants show up, knowing only those qualified subsets whose all members she has seen. We assume that the overall access structure is known and only the…
Nitinawarat and Narayan proposed a perfect secret key generation scheme for the so-called \emph{pairwise independent network (PIN) model} by exploiting the combinatorial properties of the underlying graph, namely the spanning tree packing…
Traditional graph centrality measures effectively quantify node importance but fail to capture the structural uniqueness of multi-scale connectivity patterns -- critical for understanding network resilience and function. This paper…
In this paper, we consider homological properties of so-called graph ideals. Consider $\Gamma$ is a graph with vertices $t_1$, ..., $t_s$, without self-loops and multiple adjacencies. We can associate with such a graph an ideal…
Homomorphism is a key mapping technique between graphs that preserves their structure. Given a graph and a pattern, the subgraph homomorphism problem involves finding a mapping from the pattern to the graph, ensuring that adjacent vertices…
Bipartite secret sharing schemes have a bipartite access structure in which the set of participants is divided into two parts and all participants in the same part play an equivalent role. Such a bipartite scheme can be described by a…
We give, for each $k \geq 3$, the precise best possible minimum positive codegree condition for a perfect matching in a large $k$-uniform hypergraph $H$ on $n$ vertices. Specifically we show that, if $n$ is sufficiently large and divisible…
A secret sharing scheme is a cryptographic protocol to distribute a secret state in an encoded form among a group of players such that only authorized subsets of the players can reconstruct the secret. Classically, efficient secret sharing…
Secret sharing provides a means to distribute shares of a secret such that any authorized subset of shares, specified by an access structure, can be pooled together to recompute the secret. The standard secret sharing model requires public…
The co-maximal subgroup graph $\Gamma(G)$ of a group $G$ is a graph whose vertices are non-trivial proper subgroups of $G$ and two vertices $H$ and $K$ are adjacent if $HK=G$. In this paper, we continue the study of $\Gamma(G)$, especially…
We study the problem of finding a copy of a specific induced subgraph on inhomogeneous random graphs with infinite variance power-law degrees. We provide a fast algorithm that finds a copy of any connected graph $H$ on a fixed number of $k$…
Let $G$ and $H$ be $k$-graphs ($k$-uniform hypergraphs); then a perfect $H$-packing in $G$ is a collection of vertex-disjoint copies of $H$ in $G$ which together cover every vertex of $G$. For any fixed $H$ let $\delta(H, n)$ be the minimum…