Abstract Let G:{0, 1} n→{0, 1} m be a pseudorandom generator. We say that a circuit
implementation of G is (k, q)-robust if for every set S of at most k wires anywhere in the …

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 …

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 …

In cryptography we investigate security aspects of data distributed in a network. This kind of
security does not protect the secrecy of the network topology against being discovered if …

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 …

Emerging approaches to network monitoring involve large numbers of agents collaborating
to produce performance or security related statistics on huge, partial mesh networks. The …

In a distributed network, computing a function privately requires that no participant gains any
additional knowledge other than the value of the function. We study this problem for …

Suppose that some parties are connected by an incomplete network of reliable and private
channels. The parties cooperate to execute some protocol. However, the parties are curious …

We consider the amount of randomness necessary in information-theoretic private protocols.
We prove that at least Ω(\logn) random bits are necessary for the t-private computation of the …

We consider interactive computation of randomized functions between two users with the
following privacy requirement: the interaction should not reveal to either user any extra …