Byzantine fault tolerance with verifiable secret sharing at constant overhead

    公开(公告)号:US11354199B2

    公开(公告)日:2022-06-07

    申请号:US16740315

    申请日:2020-01-10

    Applicant: VMware, Inc.

    Abstract: Techniques for implementing Byzantine fault tolerance with verifiable secret sharing at constant overhead are provided. In one set of embodiments, a client can determine a secret value s to be shared with N replicas in a distributed system, s being input data for a service operation provided by the N replicas. The client can further encode s into an f-degree polynomial P(x) where f corresponds to a maximum number of faulty replicas in the distributed system, evaluate P(x) at i for i=1 to N resulting in N evaluations P(i), generate at least one f-degree recovery polynomial R(x) based on a distributed pseudo-random function (DPRF) fα(x), and evaluate R(x) at i for i=1 to N resulting in at least N evaluations R(i). The client can then invoke the service operation, the invoking comprising transmitting a message including P(i) and R(i) to each respective replica i.

    BYZANTINE AGREEMENT USING COMMUNICATIONS HAVING LINEAR COMPLEXITY

    公开(公告)号:US20200081805A1

    公开(公告)日:2020-03-12

    申请号:US16680380

    申请日:2019-11-11

    Applicant: VMware, Inc.

    Abstract: The disclosure describes a failure-free execution agreement that includes n=3F+1 parties acting as replicas, and a number of parties acting as clients. One replica is designated as a primary. At most F replicas are presumed Byzantine faulty. The basic agreement protocol proceeds in three rounds: (1) client sends a request to the primary, who sends to all replicas; (2) each replica sends a threshold-part signature on hash to a first collector; (3) the collector combines the threshold-parts into a single signature and sends to all 3F+1 replicas which then commit and send to a second collector. The client proceeds when a signed block of requests arrives from the second collector.

    Linear view-change BFT
    8.
    发明授权

    公开(公告)号:US11620195B2

    公开(公告)日:2023-04-04

    申请号:US16898055

    申请日:2020-06-10

    Applicant: VMware, Inc.

    Abstract: Techniques for implementing linear view-change in a Byzantine Fault Tolerant (BFT) protocol running on a distributed system comprising n replicas are provided. According to one set of embodiments, at a time of performing a view-change from a current view number v to a new view number v+1, a replica in the n replicas corresponding to a new proposer for new view number v+1 can generate a PREPARE message comprising a single COMMIT certificate, where the single COMMIT certificate is the highest COMMIT certificate the new proposer is aware of. The new proposer can then transmit the PREPARE message with the single COMMIT certificate to all other replicas in the n replicas.

Patent Agency Ranking