A Comparative Study of Available Protocols during Privacy Preservation in Secure Multiparty Computation

نویسندگان

  • Zulfa Shaikh
  • Poonam Garg
چکیده

In this paper, comparative study of different available Secure Multiparty Computation (SMC) protocols have been addressed. In SMC, a set of parties wishes to jointly compute some function on their inputs. This computation must preserve certain security properties, like privacy and correctness. The general approach for such kind of computation is to make use of trusted third party to do the computation and then announce the result publicly. The major problem with this approach is that it is difficult to find a third party which is trusted by all the parties providing the inputs. This implies that the data of parties must be secured. Security is meant to achieve correctness of the result of computation and keeping the party’s input private even if some of the parties are corrupted.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

پروتکل کارا برای جمع چندسویه امن با قابلیت تکرار

In secure multiparty computation (SMC), a group of users jointly and securely computes a mathematical function on their private inputs, such that the privacy of their private inputs will be preserved. One of the widely used applications of SMC is the secure multiparty summation which securely computes the summation value of the users’ private inputs. In this paper, we consider a secure multipar...

متن کامل

Secure Multiparty Computation for Privacy-Preserving Data Mining

In this paper, we survey the basic paradigms and notions of secure multiparty computation and discuss their relevance to the field of privacy-preserving data mining. In addition to reviewing definitions and constructions for secure multiparty computation, we discuss the issue of efficiency and demonstrate the difficulties involved in constructing highly efficient protocols. We also present comm...

متن کامل

Implementing Privacy-Preserving Bayesian-Net Discovery for Vertically Partitioned Data

The great potential of data mining in a networked world cannot be realized without acceptable guarantees that private information will be protected. In theory, general cryptographic protocols for secure multiparty computation enable data mining with privacy preservation that is optimal with respect to the desired end results. However, the performance expense of such general protocols is prohibi...

متن کامل

Secure Multiparty Sorting Protocols with Covert Privacy

We introduce the notion of covert privacy for secret-sharingbased secure multiparty computation (SMC) protocols. We show how covertly or actively private SMC protocols, together with recently introduced verifiable protocols allow the construction of SMC protocols secure against active adversaries. For certain computational problems, the relative overhead of our protocols, when compared to proto...

متن کامل

Verifiable Computation in Multiparty Protocols with Honest Majority

We present a generic method for turning passively secure protocols into protocols secure against covert attacks. The method adds a post-execution verification phase to the protocol that allows a misbehaving party to escape detection only with negligible probability. The execution phase, after which the computed protocol result is already available for parties, has only negligible overhead added...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011