The round complexity of verifiable secret sharing and secure multicast
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On 2-Round Secure Multiparty Computation
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Adaptability and the Usefulness of Hints (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Fast consensus in networks of bounded degree
Distributed Computing
Optimally efficient multi-valued byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Towards optimal and efficient perfectly secure message transmission
TCC'07 Proceedings of the 4th conference on Theory of cryptography
How many oblivious transfers are needed for secure multiparty computation?
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Efficient Byzantine agreement with faulty minority
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Perfectly-secure MPC with linear communication complexity
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Error-free multi-valued consensus with byzantine failures
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Byzantine broadcast in point-to-point networks using local linear coding
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the complexity of broadcast setup
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |