On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs
A El-Mesady, T Farahat, R El-Shanawany… - Algorithms, 2023 - mdpi.com
Nowadays, graph theory is one of the most exciting fields of mathematics due to the
tremendous developments in modern technology, where it is used in many important …
tremendous developments in modern technology, where it is used in many important …
Must the communication graph of MPC protocols be an expander?
Secure multiparty computation (MPC) on incomplete communication networks has been
studied within two primary models:(1) where a partial network is fixed a priori, and thus …
studied within two primary models:(1) where a partial network is fixed a priori, and thus …
Towards topology-hiding computation from oblivious transfer
Abstract Topology-Hiding Computation (THC) enables parties to securely compute a
function on an incomplete network without revealing the network topology. It is known that …
function on an incomplete network without revealing the network topology. It is known that …
AntNest: Fully non-interactive secure multi-party computation
L Zhou, L Wang, Y Sun, T Ai - IEEE Access, 2018 - ieeexplore.ieee.org
In this paper, we focus on the research of non-interactive secure multi-party computation. At
first, we propose a fully homomorphic non-interactive verifiable secret sharing (FHNVSS) …
first, we propose a fully homomorphic non-interactive verifiable secret sharing (FHNVSS) …
Topology-hiding computation beyond semi-honest adversaries
Topology-hiding communication protocols allow a set of parties, connected by an
incomplete network with unknown communication graph, where each party only knows its …
incomplete network with unknown communication graph, where each party only knows its …
Topology-hiding communication from minimal assumptions
Topology-hiding broadcast (THB) enables parties communicating over an incomplete
network to broadcast messages while hiding the topology from within a given class of …
network to broadcast messages while hiding the topology from within a given class of …
Exploring the boundaries of topology-hiding computation
Topology-hiding computation (THC) is a form of multi-party computation over an incomplete
communication graph that maintains the privacy of the underlying graph topology. In a line of …
communication graph that maintains the privacy of the underlying graph topology. In a line of …
Is information-theoretic topology-hiding computation possible?
Topology-hiding computation (THC) is a form of multi-party computation over an incomplete
communication graph that maintains the privacy of the underlying graph topology. Existing …
communication graph that maintains the privacy of the underlying graph topology. Existing …
Towards practical topology-hiding computation
S Li - International Conference on the Theory and …, 2022 - Springer
Topology-hiding computation (THC) enables n parties to perform a secure multiparty
computation (MPC) protocol in an incomplete communication graph while keeping the …
computation (MPC) protocol in an incomplete communication graph while keeping the …
Topology-hiding computation for networks with unknown delays
Abstract Topology-Hiding Computation (THC) allows a set of parties to securely compute a
function over an incomplete network without revealing information on the network topology …
function over an incomplete network without revealing information on the network topology …