skip to main content
Idioma:
Primo Search
Clear Search Box
Search in: Busca Geral
Busca Avançada
Busca por Índices

RapidChain: Scaling Blockchain via Full Sharding

Zamani, Mahdi ; Movahedi, Mahnush ; Raykova, Mariana

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018, p.931-948

New York, NY, USA: ACM

Texto completo disponível

Citações Citado por
  • Título:
    RapidChain: Scaling Blockchain via Full Sharding
  • Autor: Zamani, Mahdi ; Movahedi, Mahnush ; Raykova, Mariana
  • Assuntos: Security and privacy -- Systems security -- Distributed systems security
  • É parte de: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018, p.931-948
  • Descrição: A major approach to overcoming the performance and scalability limitations of current blockchain protocols is to use sharding which is to split the overheads of processing transactions among multiple, smaller groups of nodes. These groups work in parallel to maximize performance while requiring significantly smaller communication, computation, and storage per node, allowing the system to scale to large networks. However, existing sharding-based blockchain protocols still require a linear amount of communication (in the number of participants) per transaction, and hence, attain only partially the potential benefits of sharding. We show that this introduces a major bottleneck to the throughput and latency of these protocols. Aside from the limited scalability, these protocols achieve weak security guarantees due to either a small fault resiliency (e.g., 1/8 and 1/4) or high failure probability, or they rely on strong assumptions (e.g., trusted setup) that limit their applicability to mainstream payment systems. We propose RapidChain, the first sharding-based public blockchain protocol that is resilient to Byzantine faults from up to a 1/3 fraction of its participants, and achieves complete sharding of the communication, computation, and storage overhead of processing transactions without assuming any trusted setup. RapidChain employs an optimal intra-committee consensus algorithm that can achieve very high throughputs via block pipelining, a novel gossiping protocol for large blocks, and a provably-secure reconfiguration mechanism to ensure robustness. Using an efficient cross-shard transaction verification technique, our protocol avoids gossiping transactions to the entire network. Our empirical evaluations suggest that RapidChain can process (and confirm) more than 7,300 tx/sec with an expected confirmation latency of roughly 8.7 seconds in a network of 4,000 nodes with an overwhelming time-to-failure of more than 4,500 years.
  • Editor: New York, NY, USA: ACM
  • Idioma: Inglês
Voltar para lista de resultados
Ir para página anteriorAnterior Resultado  7 AvançarIr para próxima página

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.