Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Bruno Vavala"'
Publikováno v:
SRDS
Consensus mechanisms used by popular distributed ledgers are highly scalable but notoriously inefficient. Byzantine fault tolerance (BFT) protocols are efficient but far less scalable. Speculative BFT protocols such as Zyzzyva and Zyzzyva5 are effici
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4754dda4a0c7a053b960067388ff466e
http://arxiv.org/abs/1905.10255
http://arxiv.org/abs/1905.10255
Publikováno v:
FedCSIS
This work explores the connection between language, personality, and influence in a social media network. It clusters users based on two types of features: account activity features and stream content (word) features and compares the usefulness of th
Publikováno v:
DSN
International Conference on Dependable Systems and Networks (DSN)
International Conference on Dependable Systems and Networks (DSN)
Outsourcing services to third-party providers comes with a high security cost—to fully trust the providers. Using trusted hardware can help, but current trusted execution environments do not adequately support services that process very large scale
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44320600c8c001b9d2f577ef5ae1433b
https://zenodo.org/record/835721
https://zenodo.org/record/835721
Publikováno v:
DSN
Code identity is a fundamental concept for authenticated operations in Trusted Computing. In today's approach, the overhead of assigning an identity to a protected service increases linearly with the service code size. In addition, service code size
Publikováno v:
Journal of Parallel and Distributed Computing. 72:475-488
In this paper we address the problem of local balancing in multi-hop wireless networks. We introduce the notion of proactive routing: after a short pre-processing phase in which nodes build their routing tables by exchanging messages with neighbors,
Publikováno v:
SRDS
We show how to leverage trusted computing technology to design an efficient fully-passive replicated system tolerant to arbitrary failures. The system dramatically reduces the complexity of a fault-tolerant service, in terms of protocols, messages, d
Autor:
Bruno Vavala, Nuno Neves
Publikováno v:
SRDS
Randomized Byzantine Consensus can be an interesting building block in the implementation of asynchronous distributed systems. Despite its exponential worst-case complexity, which would make it less appealing in practice, a few experimental works hav
Publikováno v:
2010 Third International Conference on Dependability.
In many emerging wireless scenarios, consensus among nodes represents an important task that must be accomplished in a timely and dependable manner. However, the sharing of the radio medium and the typical communication failures of such environments