Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Communication complexity of secure computation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Asynchronous secure computation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Asynchronous secure computations with optimal resilience (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
The round complexity of verifiable secret sharing and secure multicast
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Efficient Asynchronous Secure Multiparty Distributed Computation
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Improving the Round Complexity of VSS in Point-to-Point Networks
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Simple and efficient asynchronous byzantine agreement with optimal resilience
Proceedings of the 28th ACM symposium on Principles of distributed computing
The Round Complexity of Verifiable Secret Sharing Revisited
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Trading players for efficiency in unconditional multiparty computation
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Scalable and unconditionally secure multiparty computation
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Simple and efficient perfectly-secure asynchronous MPC
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
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Round-Optimal and efficient verifiable secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Brief announcement: communication efficient asynchronous byzantine agreement
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Secure message transmission in asynchronous networks
Journal of Parallel and Distributed Computing
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Hi-index | 0.00 |
Verifiable Secret Sharing (VSS) is a fundamental primitive used in many distributed cryptographic tasks, such as Multiparty Computation (MPC) and Byzantine Agreement (BA). It is a two phase (sharing, reconstruction) protocol. The VSS and MPC protocols are carried out among n parties, where t out of n parties can be under the influence of a Byzantine (active) adversary, having unbounded computing power. It is well known that protocols for perfectly secure VSS and perfectly secure MPC exist in an asynchronous network iff n≥4t+1. Hence, we call any perfectly secure VSS (MPC) protocol designed over an asynchronous network with n=4t+1 as optimally resilient VSS (MPC) protocol. A secret is d-shared among the parties if there exists a random degree-d polynomial whose constant term is the secret and each honest party possesses a distinct point on the degree-d polynomial. Typically VSS is used as a primary tool to generate t-sharing of secret(s). In this paper, we present an optimally resilient, perfectly secure Asynchronous VSS (AVSS) protocol that can generate d-sharing of a secret for any d, where t≤d≤2t. This is the first optimally resilient, perfectly secure AVSS of its kind in the literature. Specifically, our AVSS can generate d-sharing of ℓ≥1 secrets from ${\mathbb F}$ concurrently, with a communication cost of ${\cal O}(\ell n^2 \log{|{\mathbb F}|})$ bits, where ${\mathbb F}$ is a finite field. Communication complexity wise, the best known optimally resilient, perfectly secure AVSS is reported in [2]. The protocol of [2] can generate t-sharing of ℓ secrets concurrently, with the same communication complexity as our AVSS. However, the AVSS of [2] and [4] (the only known optimally resilient perfectly secure AVSS, other than [2]) does not generate d-sharing, for any dt. Interpreting in a different way, we may also say that our AVSS shares ℓ(d+1−t) secrets simultaneously with a communication cost of ${\cal O}(\ell n^2 \log{|{\mathbb F}|})$ bits. Putting d=2t (the maximum value of d), we notice that the amortized cost of sharing a single secret using our AVSS is only ${\cal O}(n \log{|{\mathbb F}|})$ bits. This is a clear improvement over the AVSS of [2] whose amortized cost of sharing a single secret is ${\cal O}(n^2 \log{|{\mathbb F}|})$ bits. As an interesting application of our AVSS, we propose a new optimally resilient, perfectly secureAsynchronous Multiparty Computation (AMPC) protocol that communicates ${\cal O}(n^2 \log|{\mathbb F}|)$ bits per multiplication gate. The best known optimally resilient perfectly secure AMPC is due to [2], which communicates ${\cal O}(n^3 \log|{\mathbb F}|)$ bits per multiplication gate. Thus our AMPC improves the communication complexity of the best known AMPC of [2] by a factor of Ω(n).