A non-interactive multiparty computation protocol
Ghodosi, Hossein, and Zaare-Nahandi, Rahim (2007) A non-interactive multiparty computation protocol. Proceedings of the Sixth International Workshop for Applied PKC. Sixth International Workshop for Applied PKC (IWAP2007) , 3-4 DEC 2007, Perth, WA, Australia , pp. 88-95.
|PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
View at Publisher Website: http://conferences.scis.ecu.edu.au/IWAP2...
Multiparty computation considers the design of protocols such that a set of n users U] ... lim each with their own secret input Xi, can compute a function Y =F(x], ... , x/J. In this paper, we study a requirement for devising non-interactive multiparty computation protocols and present the first non-interactive multiparty computation protocol, which has the following advantages: a) The amount of computation required by each participant is equal to the amount of computation in an ideal model (i.e. the proposed scheme is optimal). b) In the presence of passive adversaries, no set of less than n users can leam more than what is allowed in the underlying secret sharing scheme (other than the function value), c) In the presence of active adversaries (i.e, Byzantine faults are allowed), no set of less than nl2 users can either leam more than what is allowed in the underlying secret sharing scheme, nor can they dismpt the computation. d) The partial security provided in our scheme is unconditional. That is, the proposed scheme does not rely on any non-proven cryptographic assumption.
Repository Staff Only: item control page