A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation
نویسندگان
چکیده
منابع مشابه
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
We study the following two related questions: – What are the minimal computational resources required for general secure multiparty computation in the presence of an honest majority? – What are the minimal resources required for two-party primitives such as zero-knowledge proofs and general secure two-party computation? We obtain a nearly tight answer to the first question by presenting a perfe...
متن کاملRound Efficient Unconditionally Secure Multiparty Computation Protocol
In this paper, we propose a round efficient unconditionally secure multiparty computation (UMPC) protocol in information theoretic model with n > 2t players, in the absence of any physical broadcast channel, which communicates O(n4) field elements per multiplication and requires O(n log(n) + D) rounds, even if up to t players are under the control of an active adversary having unbounded computi...
متن کاملA Proof of Yao's Protocol for Secure Two-Party Computation
In the mid 1980’s, Yao presented a constant-round protocol for securely computing any two-party functionality in the presence of semi-honest adversaries (FOCS 1986). In this paper, we provide a complete description of Yao’s protocol, along with a rigorous proof of security. Despite the importance of Yao’s protocol to the field of secure computation, to the best of our knowledge, this is the fir...
متن کاملSecure Multiparty Computation
A function is private if there exists a protocol that is secure; that is, no party can learn any additional information about the other parties’ inputs other than what follows from their own input and the function’s output. Previous studies have investigated multiparty computation with broadcast communication, but broadcast communication does not fully capture all secure multiparty protocols. W...
متن کاملSecure Multiparty Computation
Assume a number of parties want to compute a public function F (x1, . . . , xn) = (y1, . . . , yn). All of them want to get the correct answer, but none of them are willing to expose their secret inputs to other parties. One way to achieve this requirement is to implement the secure multiparty computation protocols. In this paper, we will make a brief introduction to secure multiparty computati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2015
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-015-9214-4