搜索结果: 1-6 共查到“密码学 Optimal Resilience”相关记录6条 . 查询时间(0.093 秒)
Synchronous Byzantine Agreement with Expected $O(1)$ Rounds, Expected $O(n^2)$ Communication, and Optimal Resilience
Optimal Resilience authenticated setting
2018/11/2
We present new protocols for Byzantine agreement in the synchronous and authenticated setting, tolerating the optimal number of ff faults among n=2f+1n=2f+1 parties. Our protocols achieve an expected ...
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience
Verifiable Secret Sharing Multiparty Computation
2010/1/18
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...
Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience
Asynchronous Networks AVSS Optimal Resilience
2009/11/18
In this paper, we present a new statistical asynchronous verifiable secret sharing (AVSS) protocol
with optimal resilience; i.e. with n = 3t+1, where n is the total number of participating parties an...
Efficient Asynchronous Multiparty Computation with Optimal Resilience
Efficient Asynchronous Multiparty Computation Optimal Resilience
2009/6/9
We propose an efficient information theoretic secure asynchronous multiparty computation (AMPC)
protocol with optimal fault tolerance; i.e., with n = 3t + 1, where n is the total number of parties an...
Simple and Efficient Asynchronous Byzantine Agreement with Optimal Resilience
Unbounded Computing Power VSS Byzantine Agreement
2009/6/9
Consider a completely asynchronous network consisting of n parties where every two parties
are connected by a private channel. An adversary At with unbounded computing power actively
controls at mos...
Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience
Cryptographic Asynchronous Multi-Party Computation Optimal Resilience
2009/4/3
We consider secure multi-party computation in the asyn-
chronous model and present an ecient protocol with optimal resilience.
For n parties, up to t < n=3 of them being corrupted, and security
pa...