Show simple item record

dc.contributor.authorYakoubov, Sophiaen_US
dc.date.accessioned2016-02-18T16:10:26Z
dc.date.available2016-02-18T16:10:26Z
dc.date.issued2016
dc.identifier.urihttps://hdl.handle.net/2144/14494
dc.description.abstractCryptographic accumulators are a tool for compact set representation and secure set membership proofs. When an element is added to a set by means of an accumulator, a membership witness is generated. This witness can later be used to prove the membership of the element. Typically, the membership witness has to be synchronized with the accumulator value, and to be updated every time another element is added to the accumulator. In this work we propose an accumulator that, unlike any prior scheme, does not require strict synchronization. In our construction a membership witness needs to be updated only a logarithmic number of times in the number of subsequent element additions. Thus, an out-of-date witness can be easily made current. Vice versa, a verifier with an out-of-date accumulator value can still verify a current membership witness. These properties make our accumulator construction uniquely suited for use in distributed applications, such as blockchain-based public key infrastructures.en_US
dc.language.isoen_US
dc.subjectComputer scienceen_US
dc.subjectCryptographic accumulatorsen_US
dc.subjectCryptographyen_US
dc.subjectPublic key infrastructureen_US
dc.titleEfficient asynchronous accumulators for distributed PKIen_US
dc.typeThesis/Dissertationen_US
dc.date.updated2016-02-12T23:18:32Z
etd.degree.nameMaster of Scienceen_US
etd.degree.levelmastersen_US
etd.degree.disciplineComputer Scienceen_US
etd.degree.grantorBoston Universityen_US


This item appears in the following Collection(s)

Show simple item record