-
公开(公告)号：US11675677B2
公开(公告)日：2023-06-13
申请号：US17575507
申请日：2022-01-13
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Dahlia Malkhi , Alexander Spiegelman , Guy Golan Gueta
CPC classification number: G06F11/2028 , G06F11/1479 , G06F11/2048 , G06Q20/06 , G06Q20/382 , H04L9/0618 , H04L9/3239 , H04L9/3255 , G06F11/202 , G06F11/2041 , G06Q2220/00 , H04L2209/56
Abstract: In some embodiments, a method receives a share of a signature of a decision block from at least a portion of the plurality of replicas. The share of the signature being generated when a respective replica signs the decision block and the decision block includes a set of requests from a client for a service. A combined signature is created based on the share of the signature block from at least the portion of the plurality of replicas. The method broadcasts a message that includes the combined signature to the plurality of replicas. The plurality of replicas use the combined signature to determine whether to process the decision block for the service.
-
公开(公告)号：US11502858B2
公开(公告)日：2022-11-15
申请号：US17099567
申请日：2020-11-16
Applicant: VMware, Inc.
Inventor： Bryan Fink , Ittai Abraham , Guy Golan Gueta , Andrew Joseph Stone
Abstract: A blockchain network include nodes that are configured as time sources. These time-source nodes broadcast respective updates of their local times to all nodes in the blockchain network. Each node computes a summary time value based on the received local time values so that each node uses the same summary time to maintain their respective copies of the blockchain.
-
公开(公告)号：US11256581B2
公开(公告)日：2022-02-22
申请号：US16680380
申请日：2019-11-11
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Dahlia Malkhi , Alexander Spiegelman , Guy Golan Gueta
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.
-
公开(公告)号：US10572352B2
公开(公告)日：2020-02-25
申请号：US15729568
申请日：2017-11-01
Applicant: VMware, Inc.
Inventor： Soumya Basu , Alin Tomescu , Dahlia Malkhi , Michael Reiter , Adrian Seredinschi , Ittai Abraham , Guy Golan Gueta
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.
-
公开(公告)号：US20190377645A1
公开(公告)日：2019-12-12
申请号：US16234552
申请日：2018-12-27
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Dahlia Malkhi , Guy Golan Gueta , Maofan Yin , Michael Reiter
Abstract: Techniques for implementing linear view-change with optimistic responsiveness in a BFT protocol running on a distributed system comprising n replicas are provided. According to one set of embodiments, the replicas can execute, during a view v of the BFT protocol, a first voting round comprising communicating instances of a first type of COMMIT certificate among the replicas. Further, when 2f+1 instances of the first type of COMMIT certificate associated with view v have been received by the replicas, the replicas can execute a second voting round comprising communicating instances of a second type of COMMIT certificate among the replicas. If 2f+1 instances of the second type of COMMIT certificate associated with view v are not received by the replicas within a predetermined timeout period, a view change can be initiated from view v to a view v+1.
-
Patent Agency Ranking
公开(公告)号：US11809453B2
公开(公告)日：2023-11-07
申请号：US17339068
申请日：2021-06-04
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Ioan Alin Tomescu Nicolescu , Guy Golan Gueta , Neil Giridharan , Heidi Howard
IPC: G06F16/27 , G06F16/2453 , H04L9/00 , G06F11/00
CPC classification number: G06F16/275 , G06F11/00 , G06F16/24535 , G06F16/27 , H04L9/50
Abstract: The present disclosure is directed to a leader-based partially synchronous BFT SMR protocol that improves upon existing protocols by exhibiting two rounds of communication latency, linear authenticator complexity, and optimistic responsiveness. This is achieved through the novel use of an aggregate signature scheme as part of the protocol's view-change procedure.
-
公开(公告)号：US20200301794A1
公开(公告)日：2020-09-24
申请号：US16898055
申请日：2020-06-10
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Dahlia Malkhi , Guy Golan Gueta
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.
-
公开(公告)号：US10747629B2
公开(公告)日：2020-08-18
申请号：US16234552
申请日：2018-12-27
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Dahlia Malkhi , Guy Golan Gueta , Maofan Yin , Michael Reiter
Abstract: Techniques for implementing linear view-change with optimistic responsiveness in a BFT protocol running on a distributed system comprising n replicas are provided. According to one set of embodiments, the replicas can execute, during a view v of the BFT protocol, a first voting round comprising communicating instances of a first type of COMMIT certificate among the replicas. Further, when 2f+1 instances of the first type of COMMIT certificate associated with view v have been received by the replicas, the replicas can execute a second voting round comprising communicating instances of a second type of COMMIT certificate among the replicas. If 2f+1 instances of the second type of COMMIT certificate associated with view v are not received by the replicas within a predetermined timeout period, a view change can be initiated from view v to a view v+1.
-
公开(公告)号：US10713133B2
公开(公告)日：2020-07-14
申请号：US16005351
申请日：2018-06-11
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Dahlia Malkhi , Guy Golan Gueta
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.
-
公开(公告)号：US20200151066A1
公开(公告)日：2020-05-14
申请号：US16740315
申请日：2020-01-10
Applicant: VMware, Inc.
Inventor： Soumya Basu , Alin Tomescu , Dahlia Malkhi , Michael Reiter , Adrian Seredinschi , Ittai Abraham , Guy Golan Gueta
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.
-
-
-
-
-
-
-
-
-
Search Results
22
records
(took 0.015 seconds)
