2026-09-19T00:40:38Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/459932022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Barbara Liskov. Dryjanski, David Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2009-06-30T16:56:50Z 2009-06-30T16:56:50Z 2008 2008 http://hdl.handle.net/1721.1/45993 351632178 Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008. Includes bibliographical references (p. 59-60). Secret sharing schemes are needed to store and protect secrets in large scale distributed systems. These schemes protect a secret by dividing the it into shares and distributing the shares to multiple shareholders. This way the compromise of a single shareholder does not reveal the secret. Many new secret sharing schemes, such as Proactive Secret Sharing, have been developed to combat the increasing threat from malicious nodes and keep systems secure. However, most of these schemes can be compromised over time, since share transfer and redistribution are static: the set of shareholders is fixed. Mobile Proactive Secret Sharing (MPSS) is a new protocol with dynamic redistribution that can adapt to Byzantine faults and remain secure for the duration of long-lived systems. This thesis describes the simulation, testing, and evaluation of the MPSS protocol to better understand the performance trade-offs and practicality of secret sharing protocols operating in Byzantine faulty environments. The thesis evaluates the original MPSS scheme and the MPSS scheme with verifiable accusations in a distributed setting, finds that both schemes are practical, and explores the performance trade-offs between the two schemes. by David Dryjanski. M.Eng. 60 p. eng Massachusetts Institute of Technology M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. Practical Mobile Proactive Secret Sharing MPSS Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="fbd225e5-837a-4fec-86e5-50bdf2ab30b6"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Practical Mobile Proactive Secret Sharing</Title> <Subtitle>MPSS</Subtitle> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2008</PublicationDate> <Authors> <Author> <DisplayName>Dryjanski, David</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <Abstract>Secret sharing schemes are needed to store and protect secrets in large scale distributed systems. These schemes protect a secret by dividing the it into shares and distributing the shares to multiple shareholders. This way the compromise of a single shareholder does not reveal the secret. Many new secret sharing schemes, such as Proactive Secret Sharing, have been developed to combat the increasing threat from malicious nodes and keep systems secure. However, most of these schemes can be compromised over time, since share transfer and redistribution are static: the set of shareholders is fixed. Mobile Proactive Secret Sharing (MPSS) is a new protocol with dynamic redistribution that can adapt to Byzantine faults and remain secure for the duration of long-lived systems. This thesis describes the simulation, testing, and evaluation of the MPSS protocol to better understand the performance trade-offs and practicality of secret sharing protocols operating in Byzantine faulty environments. The thesis evaluates the original MPSS scheme and the MPSS scheme with verifiable accusations in a distributed setting, finds that both schemes are practical, and explores the performance trade-offs between the two schemes.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>