Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
How to write parallel programs: a guide to the perplexed
ACM Computing Surveys (CSUR)
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Supporting Fault-Tolerant Parallel Programming in Linda
IEEE Transactions on Parallel and Distributed Systems
On the expressiveness of Linda coordination primitives
Information and Computation - Special issue on EXPRESS 1997
Making tuple spaces safe for heterogeneous distributed systems
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Communications of the ACM
Hitting the distributed computing sweet spot with TSpaces
Computer Networks: The International Journal of Computer and Telecommunications Networking - pervasive computing
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Coordinating processes with secure spaces
Science of Computer Programming - Special issue on coordination languages and architectures
Resilient distributed objects: Basic results and application to shared tuple spaces
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Responsive Security for Stored Data
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
BASE: Using abstraction to improve fault tolerance
ACM Transactions on Computer Systems (TOCS)
Separating agreement from execution for byzantine fault tolerant services
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Efficient Byzantine-Tolerant Erasure-Coded Storage
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Basic Concepts and Taxonomy of Dependable and Secure Computing
IEEE Transactions on Dependable and Secure Computing
CODEX: A Robust and Secure Secret Distribution System
IEEE Transactions on Dependable and Secure Computing
An integrated experimental environment for distributed systems and networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Fault-scalable Byzantine fault-tolerant services
Proceedings of the twentieth ACM symposium on Operating systems principles
Asynchronous Veri.able Information Dispersal
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
Sharing Memory between Byzantine Processes using Policy-Enforced Tuple Spaces
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
IEEE Transactions on Dependable and Secure Computing
HQ replication: a hybrid quorum protocol for byzantine fault tolerance
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Loose synchronization for large-scale networked systems
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
Paxos made live: an engineering perspective
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Low-overhead byzantine fault-tolerant storage
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Sinfonia: a new paradigm for building scalable distributed systems
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Intrusion-tolerant architectures: concepts and design
Architecting dependable systems
Research note: On Byzantine generals with alternative plans
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
A formal definition of RESTful semantic web services
Proceedings of the First International Workshop on RESTful Design
ZooKeeper: wait-free coordination for internet-scale systems
USENIXATC'10 Proceedings of the 2010 USENIX conference on USENIX annual technical conference
HotDep'10 Proceedings of the Sixth international conference on Hot topics in system dependability
DepSky: dependable and secure storage in a cloud-of-clouds
Proceedings of the sixth conference on Computer systems
Enhancing coordination in cloud infrastructures with an extendable coordination service
Proceedings of the Workshop on Secure and Dependable Middleware for Cloud Monitoring and Management
On the efficiency of durable state machine replication
USENIX ATC'13 Proceedings of the 2013 USENIX conference on Annual Technical Conference
DepSky: Dependable and Secure Storage in a Cloud-of-Clouds
ACM Transactions on Storage (TOS)
Hi-index | 0.00 |
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization power. Several works have tried to improve the dependability of tuple spaces through the use of replication for fault tolerance and access control for security. However, many practical applications in the Internet require both fault tolerance and security. This paper describes the design and implementation of DepSpace, a Byzantine fault-tolerant coordination service that provides a tuple space abstraction. The service offered by DepSpace is secure, reliable and available as long as less than a third of service replicas are faulty. Moreover, the content-addressable confidentiality scheme developed for DepSpace bridges the gap between Byzantine fault-tolerant replication and confidentiality of replicated data and can be used in other systems that store critical data.