New York
LondonBeijing
Blockchain Security Using Secure Multi-Party Computation

Blockchain Security Using Secure Multi-Party Computation

Jenila Livingston L. M. (Vellore Institute of Technology, India), Ashutosh Satapathy (Vellore Institute of Technology, India), Agnel Livingston L. G. X. (St. Xavier's Catholic College of Engineering, India), and Merlin Livingston L. M. (Jeppiaar Institute of Technology, India)
Copyright: © 2021 |Pages: 18
DOI: 10.4018/978-1-7998-3295-9.ch011
OnDemand:
(Individual Chapters)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In secure multi-party computation (SMC), multiple distributed parties jointly carry out the computation over their confidential data without compromising data security and privacy. It is a new emerging cryptographic technique used in huge applications such as electronic auction bidding, electronic voting, protecting personal information, secure transaction processing, privacy preserving data mining, and privacy preserving cooperative control of connected autonomous vehicles. This chapter presents two model paradigms of SMC (i.e., ideal model prototype and real model prototype). It also deals with the type and applications of adversaries, properties, and the techniques of SMC. The three prime types of SMC techniques such as randomization, cryptographic techniques using oblivious transfer, and anonymization methods are discussed and illustrated by protective procedures with suitable examples. Finally, autonomous vehicle interaction leveraged with blockchain technology to store and use vehicle data without any human interaction is also discussed.
Chapter Preview
Top

2. Smc Models

Multiple parties carry out computation over their confidential data without any loss of data security or privacy. Let multiple parties P1, P2.....Pn want to perform computation Ci on their private data. D1, D2.....Dn be the data corresponding to P1, P2.....Pn. Di should not be accessible to any Pj during computation Ci where i1j and j = 1,2.....n. Generally two model paradigms are popular in SMC; Ideal model prototype and Real model prototype (Shukla & Sadashivappa, 2012).

Ideal model prototype of SMC is also called Uncorrupted Trusted Third Party (UTTP). In ideal model, there exists an incorruptible trusted party (UTTP); who can be trusted by all the parties; to whom each protocol participant sends its data/ input to perform computation. This trusted party computes the function on its own and sends back the appropriate output to each party (Figure 1). Thus the privacy of the inputs is preserved. In real model prototype of SMC, no external party is used. All the parties agree on a common protocol to exchange data for preserving privacy and maintain correctness result (Figure 2).

Let Di is private data of Pi, i = 1,2.....n. In ideal model, data are send to UTTP directly where as in real model, f(D1), f(D2).....f(Dn) exchange between the parties.

Figure 1.

Ideal model prototype of SMC

978-1-7998-3295-9.ch011.f01

In ideal model, the computation result may be wrong, if few parties behave maliciously and supply invalid input to the UTTP. The privacy will be destroyed if an UTTP turns corrupt and it is the major limitation of this model. The implementation process is costly due to the cost of working model of this incorruptible trusted party UTTP.

Figure 2.

Real model prototype of SMC

978-1-7998-3295-9.ch011.f02

Complete Chapter List

Search this Book:
Reset