-
公开(公告)号：US11102179B2
公开(公告)日：2021-08-24
申请号：US16748571
申请日：2020-01-21
Applicant: VMware, Inc.
Inventor： Avishay Yanai , Ittai Abraham
Abstract: A system and method for anonymous message broadcasting uses secret shares of a first vector of size i and a second vector of size j from each client device with a message in an anonymity set of client devices. Each secret share of the first and second vectors is received at each of a plurality of message broadcasting servers to construct a matrix M of i and j dimensions, which is added to a matrix A of i and j dimensions maintained at that message broadcasting server. The matrix A at each message broadcasting server is shared with the other message broadcasting servers and a final matrix A is constructed using the shared matrices A at each message broadcasting server, wherein the final matrix A includes the messages from the client devices in the anonymity set. The messages in the final matrix A are broadcasted from the message broadcasting servers.
-
公开(公告)号：US10824610B2
公开(公告)日：2020-11-03
申请号：US16134564
申请日：2018-09-18
Applicant: VMware, Inc.
Inventor： Robert T Johnson , Ittai Abraham , Abhishek Gupta , Richard P Spillane , Srinath Premachandran , Jorge Guerra Delgado , Sandeep Rangaswamy , Kapil Chowksey
Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. When a compaction trigger condition exists, packet compaction is performed including a data element compaction operation. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.
-
公开(公告)号：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.
-
Patent Agency Ranking
公开(公告)号：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.
-
公开(公告)号：US20200089788A1
公开(公告)日：2020-03-19
申请号：US16134564
申请日：2018-09-18
Applicant: VMware, Inc.
Inventor： Robert T. Johnson , Ittai Abraham , Abhishek Gupta , Richard P. Spillane , Srinath Premachandran , Jorge Guerra Delgado , Sandeep Rangaswamy , Kapil Chowksey
IPC: G06F17/30
Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. When a compaction trigger condition exists, packet compaction is performed including a data element compaction operation. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.
-
公开(公告)号：US20190377648A1
公开(公告)日：2019-12-12
申请号：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.
-
公开(公告)号：US20190129809A1
公开(公告)日：2019-05-02
申请号：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.
-
公开(公告)号：US12130714B2
公开(公告)日：2024-10-29
申请号：US18472134
申请日：2023-09-21
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Dahlia Malkhi , Kartik Nayak , Ling Ren
CPC classification number: G06F11/187 , G06F11/1425 , G06F11/182 , G06F11/2041
Abstract: A method and system for performing a flexible Byzantine fault tolerant (BFT) protocol. The method includes sending, from a client device, a proposed value to a plurality of replica devices and receiving, from at least one of the plurality of replica devices, a safe vote on the proposed value. The replica device sends the safe vote, based on a first quorum being reached, to the client device and each of the other replica devices of the plurality of replica devices. The method further includes determining that a number of received safe votes for the proposed value meets or exceeds a second quorum threshold, selecting the proposed value based on the determination, and setting a period of time within which to receive additional votes. The method further includes, based on the period of time elapsing without receiving the additional votes, committing the selected value for the single view.
-
-
-
-
-
-
-
-
-
Search Results
50
records
(took 0.014 seconds)
