STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Asynchronous secure computation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast perfection-information leader-election protocol with linear immunity
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Simple and efficient leader election in the full information model
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Secure hypergraphs: privacy from partial broadcast
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Multi party computations: past and present
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Noncryptographic Selection Protocols
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Efficient reliable communication over partially authenticated networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Efficient reliable communication over partially authenticated networks
Distributed Computing - Special issue: PODC 02
On private computation in incomplete networks
Distributed Computing
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
On private computation in incomplete networks
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
Efficient two-party protocols for fault-tolerant computation of any two-argument function are presented. It is proved that the influence of a dishonest player in these protocols is the minimum one possible (up to polylogarithmic factors). Also presented are efficient m-party fault-tolerant protocols for sampling a general distribution (mor=2). Efficient m-party protocols for computation of any m-argument function are given, and it is proved for these protocols that for most functions, the influence of any t dishonest players on the outcome of the protocol is the minimum one possible (up to polylogarithmic factors).