Verifying the consistency of remote untrusted services with conflict-free operations

DOI10.1016/J.IC.2018.03.004zbMath1390.68088arXiv1302.4808OpenAlexW2795160692WikidataQ130046439 ScholiaQ130046439MaRDI QIDQ1753995

Christian Cachin, Olga Ohrimenko

Publication date: 30 May 2018

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.4808

zbMATH Keywords

cloud computingverifiable computationdata integrityByzantine emulationconflict-free operationsfork-linearizability

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Cites Work

• Unnamed Item
• Unnamed Item
• Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10--12, 2011. Proceedings
• Fork sequential consistency is blocking
• Fail-Aware Untrusted Storage
• Integrity and Consistency for Untrusted Services
• Building secure file systems out of byzantine storage
• Abortable and query-abortable objects and their efficient implementation
• Efficient fork-linearizable access to untrusted shared memory

This page was built for publication: Verifying the consistency of remote untrusted services with conflict-free operations