-
公开(公告)号：US11620195B2
公开(公告)日：2023-04-04
申请号：US16898055
申请日：2020-06-10
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Dahlia Malkhi , Guy Golan Gueta
IPC: G06F11/00 , G06F11/20 , H04L9/32 , H04L9/40 , H04L67/1097
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.
-
公开(公告)号：US11341004B2
公开(公告)日：2022-05-24
申请号：US17107630
申请日：2020-11-30
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Dahlia Malkhi , Kartik Nayak , Ling Ren
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.
-
公开(公告)号：US11070374B2
公开(公告)日：2021-07-20
申请号：US15908349
申请日：2018-02-28
Applicant: VMware, Inc.
Inventor： Asaf Kariv , Ittai Abraham , Yotam Harchol
Abstract: The current document is directed to distributed-secure-storage systems, and processes carried out within the distributed-secure-storage systems, that provide for secure storage and retrieval of secrets within distributed computer systems, including private encryption keys used for client authentication during establishment of secure communications channels. The secret-storage systems partition an input secret into multiple secret shares and distribute the secret shares among multiple secret-share-storing node subsystems, without persistently storing the secret itself. An agent within a client device subsequently requests a secret share corresponding to a secret, or a share of data derived from the secret share, from each of the multiple secret-share-storing nodes. Each secret-share-storing node transmits the requested secret share or derived-data share to the agent, which reconstructs the secret from all or a portion of the secret shares or a data value from all or a portion of the derived-data shares transmitted to the agent.
-
公开(公告)号：US11061881B2
公开(公告)日：2021-07-13
申请号：US16184861
申请日：2018-11-08
Applicant: VMware, Inc.
Inventor： Robert T Johnson , Abhishek Gupta , Jorge Guerra Delgado , Ittai Abraham , Richard P Spillane , Srinath Premachandran , Sandeep Rangaswamy , Kapil Chowksey
IPC: G06F16/22
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.
-
公开(公告)号：US20180308091A1
公开(公告)日：2018-10-25
申请号：US15653118
申请日：2017-07-18
Applicant: VMware, Inc.
Inventor： Dahlia Malkhi , Ittai Abraham , Alexander Spiegelman , Guy Golan Gueta
CPC classification number: G06Q20/382 , G06F11/1479 , G06F11/202 , G06F11/2028 , G06F11/2041 , G06F11/2048 , H04L9/0618
Abstract: A technique is disclosed for building agreement among a plurality of servers who receive a transaction from clients. The technique includes each server broadcasting its received transaction to all other servers. Each server uses the set of transactions that it received from all servers (including its own transaction) to produce an echo that represents the set of transactions, and broadcasts the echo. Each will commit its transaction to a log if its echo matches each echo received from the other servers. The present disclosure can detect byzantine failures and punishes deviating participating servers by reconfiguring the plurality of servers that participate in the protocol.
-
Patent Agency Ranking
公开(公告)号：US20180307573A1
公开(公告)日：2018-10-25
申请号：US15653178
申请日：2017-07-18
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Dahlia Malkhi , Alexander Spiegelman , Guy Golan Gueta
CPC classification number: G06Q20/382 , G06F11/1479 , G06F11/202 , G06F11/2028 , G06F11/2041 , G06F11/2048 , H04L9/0618
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.
-
公开(公告)号：US11960502B2
公开(公告)日：2024-04-16
申请号：US17555053
申请日：2021-12-17
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Guy Gueta , Igor Golikov , Toly Kournik , Tsvetomir Dimitrov
CPC classification number: G06F16/273 , G06F11/1451 , G06F2201/80
Abstract: In some embodiments, a method sends first messages that request first information for a set of blocks of the blockchain to the N replicas. Each replica maintains a respective instance of the blockchain. Second messages is received from at least a portion of the N replicas. The second messages include the first information for the set of blocks from each respective instance of the blockchain that is maintained by the N replicas. The method analyzes the first information to determine whether a consensus on the first information is reached by a number of replicas. When consensus is reached, a request is sent to a replica for one or more blocks to back up to a backup blockchain and second information is received for the one or more blocks from the replica. The method uses the second information to back up the one or more blocks in the backup blockchain.
-
公开(公告)号：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.
-
-
-
-
-
-
-
-
-
Search Results
50
records
(took 0.018 seconds)
