Integrity and Consistency for Untrusted Services

DOI10.1007/978-3-642-18381-2_1zbMath1298.68079OpenAlexW200023006MaRDI QIDQ3075506

Christian Cachin

Publication date: 15 February 2011

Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_1

zbMATH Keywords

cloud computingdata integrityByzantine emulationfork-linearizabilityauthenticated data structurecomputation integrity

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

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

Cites Work

• Authenticated hash tables based on cryptographic accumulators
• Checking the correctness of memories
• A general model for authenticated data structures
• Fail-Aware Untrusted Storage
• Building secure file systems out of byzantine storage
• Efficient fork-linearizable access to untrusted shared memory
• Automata, Languages and Programming

This page was built for publication: Integrity and Consistency for Untrusted Services