Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Communications of the ACM
Secure Distributed Linear Algebra in a Constant Number of Rounds
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Multiparty computation for interval, equality, and comparison without bit-decomposition protocol
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Share conversion, pseudorandom secret-sharing and applications to secure computation
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Hi-index | 0.00 |
It is becoming more and more important to make use of personal or classified information while keeping it confidential. A promising tool for meeting this challenge is multiparty computation (MPC), which enables multiple parties, each given a snippet of a secret s, to compute a function f(s) by communicating with each other without revealing s. However, one of the biggest problems with MPC is that it requires a vast amount of communication and thus a vast amount of processing time. We analyzed existing MPC protocols and found that the random number bitwise-sharing protocol used by many of them is notably inefficient. We proposed efficient random number bitwise-sharing protocols, dubbed ‘‘Extended-Range I and II," by devising a representation of the truth values that reduces the communication complexity to approximately 1/6th that of the best of the existing such protocol. We reduced the communication complexity to approximately 1/26th by reducing the abort probability, thereby making previously necessary backup computation unnecessary. Using our improved protocols, ‘‘Lightweight Extended-Range II," we reduced the communication complexities of equality testing, comparison, interval testing, and bit-decomposition, all of which use the random number bitwise-sharing protocol, by approximately 91, 79, 67, and 23% (for 32-bit data) respectively. Our protocols are fundamental to sharing random number r∈ℤp in binary form and can be applicable to other higher level protocols