Files in this item

FilesDescriptionFormat

application/pdf

application/pdfSP20-ECE499-Thesis-Gandlur, Shreyas.pdf (349kB)
(no description provided)PDF

Description

Title:The smart contract model of asynchronous, robust MPC
Author(s):Gandlur, Shreyas
Contributor(s):Miller, Andrew
Subject(s):multiparty computation
cryptographic protocols
universal composability
protocol security
Abstract:Over the past few years, massive cyberattacks have dominated the public imagination. Most Americans have been directly affected by data breaches and an overwhelming majority believe that they are no longer in control of their data. At the same time, there are important applications in which the aggregation of private data is unavoidable. Not surprisingly, there has been considerable interest in developing protocols for secure multi-party computation (MPC), i.e., N parties providing private inputs to jointly compute some function f. Recent developments in MPC have led to leaps in efficiency and MPC is quickly becoming a practical approach for privacy-centric distributed applications. As MPC applications become deployed, guaranteeing the security of these protocols, even when interacting with other applications, is essential. The standard approach to showing security of MPC protocols under arbitrary composition is through the universal composability (UC) framework. There has been much prior work on this topic; however, most previous work either makes synchronicity assumptions or does not guarantee output delivery in the presence of even one fault. For practical MPC applications, though, dealing with asynchronicity and robustness is essential. In this thesis, we describe two new keywords, eventually and leak, that aid in defining protocols in the asynchronous world and define wrappers that implement these within the UC framework. We then use this novel wrapper to give a UC-realization of a reliable broadcast primitive, by means of Bracha’s classic protocol. Finally, we define and prove a realization of what we call the smart contract model of MPC, which serves as a UC-idealization of asynchronous, robust MPC.
Issue Date:2020-05
Genre:Other
Type:Text
Language:English
URI:http://hdl.handle.net/2142/107277
Date Available in IDEALS:2020-06-12


This item appears in the following Collection(s)

Item Statistics