Back to results

University of New Mexico

Resource-Efficient and Robust Distributed Computing

Abstract

dc:description.abstract

There has been a tremendous growth in the size of distributed systems in the past three decades. Today, distributed systems, such as the Internet, have become so large that they require highly scalable algorithms; algorithms that have asymptotically-small communication, computation, and latency costs with respect to the network size. Moreover, systems with thousands or even millions of parties distributed throughout the world is likely in danger of faults from untrusted parties. In this dissertation, we study scalable and secure distributed algorithms that can tolerate faults from untrusted parties. Throughout this work, we balance two important and often conflicting characteristics of distributed protocols: security and efficiency. Our first result is a protocol that solves the MPC problem in polylogarithmic communication and computation cost and is secure against an adversary than can corrupt a third of the parties. We adapted our synchronous MPC protocol to the asynchronous setting when the fraction of the corrupted parties are less than 1/8. Next, we presented a scalable protocol that solves the secret sharing problem between rational parties in polylogarithmic communication and computation cost. Furthermore, we presented a protocol that can solve the interactive communication problem over a noisy channel when the noise rate in unknown. In this problem, we have focused on the cost of the protocol in the resource-competitive analysis model. Unlike classic models, resource-competitive models consider the cost that the adversary must pay to succeed in corrupting the protocol.

Degree

thesis:*
Name thesis:degree_name
Computer Science
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Department of Computer Science
Year
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Movahedi Meimandi, Mahnush
Contributors dc:contributor
  • Saia, Jared
  • Evans, David
  • Luan, Shuang
  • Young, Maxwell

Subjects

dc:subject × 3

Rights

Language dc:language
English

Identifiers

dc:identifier.*
OAI identifier oai:identifier
oai:digitalrepository.unm.edu:cs_etds-1029

Chain of custody

source
Harvested from
University of New Mexico
Base URL
digitalrepository.unm.edu/do/oai/
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
citation

Movahedi Meimandi, Mahnush. Resource-Efficient and Robust Distributed Computing. Dissertation thesis, 2016. http://hdl.handle.net/1928/32321