What is communication overhead in networking?

Abstract
We believe communication complexity of secure multi-party computation networks of processors each with unlimited computing power. Tell me what protocol N-party for the m bit is effective, if it uses a constant number of rounds and the total number of bits in the message that a polynomial time MAX (M, N). We show that every function has an effective protocol that achieves (n § p)/m sustainability, our first secure multi-party protocol communication complexity does not depend on the computational complexity of function is not evaluated.
We also believe the communication complexity with zero knowledge proof properties of bits. We show that each function F of the m bit is effectively notarized envelope schema; that is, there is a protocol in computing any prover commits a sequence of bits x to a computationally unbounded by the Verifier, and then proves in a perfect zero-knowledge (without decommitting x), F (X) = 1, using a constant number of rounds and poly (m) bits of the message. Our first notary envelope Scheme, in which the complexity of communication does not depend on the computational complexity of F.
Finally, we install a new upper bound on the number of oracles, required in the instance of shelters for arbitrary functions. These schemes allow computing limited Interrogation to earn on the superior power of one or more computationally unbounded oracles to get F (X) without revealing his personal input x any of the oracles. We show that each function of the m bit is (m/log m)-oracle schema instance cache.
The Central technique used in all these results locally random privodimost′, which was used for the first time and formally defines for the first time here. In addition to applications that we present, locally random svodimost′ was applied to interactive proof systems software verification and testing programs.