Related papers: On Ideal Secret-Sharing Schemes for $k$-homogeneou…
We study common randomness generation problems where $n$ players aim to generate same sequences of random coin flips where some subsets of the players share an independent common coin which can be tossed multiple times, and there is a…
Hypergraph partitioning is an important problem in machine learning, computer vision and network analytics. A widely used method for hypergraph partitioning relies on minimizing a normalized sum of the costs of partitioning hyperedges…
Real-world complex systems are often better modeled as hypergraphs, where edges represent group interactions involving multiple entities. Understanding and quantifying homophily (similarity-driven association) in such networks is essential…
A {k,n}-threshold scheme based on two-dimensional memory cellular automata is proposed to share images in a secret way. This method allows to encode an image into n shared images so that only qualified subsets of k or more shares can…
Suppose $k\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\lfloor n/k\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings…
We explore the role of intrinsic structural properties of hypergraphs in governing group-driven social dynamics with social reinforcement. First, we analyze simplicial contagion dynamics on random hypergraphs in which the level of hyperedge…
A sequence of vertices $(v_1,\, \dots , \,v_k)$ of a graph $G$ is called a {\it dominating closed neighborhood sequence} if $\{v_1,\, \dots , \,v_k\}$ is a dominating set of $G$ and $N[v_i]\nsubseteq \cup _{j=1}^{i-1} N[v_j]$ for every $i$.…
Heterogeneous graph neural networks (HGNNs) have powerful capability to embed rich structural and semantic information of a heterogeneous graph into node representations. Existing HGNNs inherit many mechanisms from graph neural networks…
In this paper we study some variants of Dirac-type problems in hypergraphs. First, we show that for $k\ge 3$, if $H$ is a $k$-graph on $n\in k\mathbb N$ vertices with independence number at most $n/p$ and minimum codegree at least…
Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities. In this work, we propose a novel approach for the partitioning…
This work focuses on the (k,l)-anonymity of some networks as a measure of their privacy against active attacks. Two different types of networks are considered. The first one consists of graphs with a predetermined structure, namely…
Hypergraphs provide a natural representation for many-to-many relationships in data-intensive applications, yet their scalability is often hindered by high memory consumption. While prior work has improved computational efficiency, reducing…
Traditional threshold secret sharing cannot realizing all access structures of secret sharing. So, Ito introduced the concept of Secret sharing scheme realizing general access structure. But Its scheme has to send multiple shares to each…
We introduce a new random key predistribution scheme for securing heterogeneous wireless sensor networks. Each of the n sensors in the network is classified into r classes according to some probability distribution {\mu} = {{\mu}_1 , . . .…
A dealer aims to share a secret with participants so that only predefined subsets can reconstruct it, while others learn nothing. The dealer and participants access correlated randomness and communicate over a one-way, public, rate-limited…
Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social community detection, network visualization, and network topology analysis. Most of existing cohesive subgraph…
We consider network graphs $G=(V,E)$ in which adjacent nodes share common secrets. In this setting, certain techniques for perfect end-to-end security (in the sense of confidentiality, authenticity (implying integrity) and availability,…
Homomorphic encryption (HE) has found extensive utilization in federated learning (FL) systems, capitalizing on its dual advantages: (i) ensuring the confidentiality of shared models contributed by participating entities, and (ii) enabling…
Homophily, the tendency of similar nodes to connect, is a fundamental phenomenon in network science and a critical factor in the performance of graph neural networks (GNNs). While existing studies primarily explore homophily in homogeneous…
When working with user data providing well-defined privacy guarantees is paramount. In this work, we aim to manipulate and share an entire sparse dataset with a third party privately. In fact, differential privacy has emerged as the gold…