Secure Multiparty Computation via Oblivious Polynomial Evaluation

View Sample PDF

Author(s): Mert Özarar (Middle East Technical University, Turkey)and Attila Özgit (Middle East Technical University, Turkey)
Copyright: 2013
Pages: 26
Source title: Theory and Practice of Cryptography Solutions for Secure Information Systems
Source Author(s)/Editor(s): Atilla Elçi (Hasan Kalyoncu University, Turkey), Josef Pieprzyk (Macquarie University, Australia), Alexander G. Chefranov (Eastern Mediterranean University, North Cyprus), Mehmet A. Orgun (Macquarie University, Australia), Huaxiong Wang (Nanyang Technological University, Singapore)and Rajan Shankaran (Macquarie University, Australia)
DOI: 10.4018/978-1-4666-4030-6.ch011

Keywords: Information Science Reference / Information Security & Privacy / IT Security and Ethics / Security & Forensics

Purchase

View Secure Multiparty Computation via Oblivious Polynomial Evaluation on the publisher's website for pricing and purchasing information.

Abstract

The number of opportunities for cooperative computation has exponentially been increasing with growing interaction via Internet technologies. These computations could occur between almost trusted partners, between partially trusted partners, or even between competitors. Most of the time, the communicating parties may not want to disclose their private data to the other principal while taking the advantage of collaboration, hence concentrating on the results rather than private data values. For performing such computations, one party must know inputs from all the participants; however, if none of the parties can be trusted enough to know all the inputs, privacy will become a primary concern. Hence, the techniques for Secure Multiparty Computation (SMC) are quite relevant and practical to overcome such kind of privacy gaps. The subject of SMC has evolved from earlier solutions of combinational logic circuits to the recent proposals of anonymity-enabled computation. In this chapter, the authors put together the significant research that has been carried out on SMC. They demonstrate the concept by concentrating on a specific technique called Oblivious Polynomial Evaluation (OPE) together with concrete examples. The authors put critical issues and challenges and the level of adaptation achieved before the researchers. They also provide some future research proposals based on the literature survey.

The IRMA Community

Research IRM

Secure Multiparty Computation via Oblivious Polynomial Evaluation

Purchase

Abstract

Related Content

IRMA Sponsors