Skip to main navigation Skip to search Skip to main content

Byzantine fault tolerant collaborative editing

  • Cleveland State University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

In this paper, we describe a lightweight solution for protecting real-time collaborative editing systems against Byzantine faults. We observe that a centralized coordination algorithm not only reduces the complexity of the editing system, it makes easier to harden the system with Byzantine fault tolerance. We perform a comprehensive analysis of the potential threats towards collaborative editing systems and introduce a set of Byzantine fault tolerance mechanisms without requiring any additional redundant resources. If the system has sufficient redundancy, such mechanisms can be used to ensure strong protection against various malicious faults. Even without sufficient redundancy in the system, our mechanisms would still help limit the damages caused by a faulty user.
Original languageEnglish
Title of host publicationIET Conference Publications
Place of Publicationgbr
PublisherIET
Pages233-240
Number of pages8
Volume2013
ISBN (Print)9781849196536
StatePublished - Dec 1 2013
EventIET International Conference on Information and Communications Technologies, IETICT 2013 - Beijing, China
Duration: Apr 27 2013Apr 29 2013

Conference

ConferenceIET International Conference on Information and Communications Technologies, IETICT 2013
Country/TerritoryChina
CityBeijing
Period04/27/1304/29/13

Keywords

  • Byzantine fault tolerance
  • Collaborative editing
  • Distributed algorithms
  • Operational transformation
  • Optimistic replication
  • Replica consistency

Cite this