Topology-hiding computation on all graphs
A distributed computation in which nodes are connected by a partial communication graph is
called topology hiding if it does not reveal information about the graph beyond what is …
called topology hiding if it does not reveal information about the graph beyond what is …
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 …
Secure multi-party computation of graphs' intersection and union under the malicious model
X Liu, XF Tu, D Luo, G Xu, NN Xiong, XB Chen - Electronics, 2023 - mdpi.com
In recent years, with the development of information security, secure multi-party computation
has gradually become a research hotspot in the field of privacy protection. The intersection …
has gradually become a research hotspot in the field of privacy protection. The intersection …
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 …