-
公开(公告)号：US20240250837A1
公开(公告)日：2024-07-25
申请号：US18157468
申请日：2023-01-20
Applicant: VMware, Inc.
Inventor： Teodor Parvanov , Hristo Staykov , Ittai Abraham
CPC classification number: H04L9/50 , H04L9/3297
Abstract: Disclosed are examples of systems and methods for determining a blockchain time. One such method comprises receiving, by a non-primary replica node, a pre-prepare message having a timestamp representing a local time of a primary replica node in a blockchain network, verifying, by the non-primary replica node, that a difference between the local time of the primary replica node and a local time of the non-primary replica node does not exceed a hard time limit established for the blockchain network; responding, to the primary replica node, that a time value of the timestamp is within acceptable bounds of the local time of the non-primary replica node; and after consensus is reached amongst the non-replica nodes regarding acceptance of the time value, saving a current blockchain time for the blockchain network based on the timestamp.
-
公开(公告)号：US20240031248A1
公开(公告)日：2024-01-25
申请号：US18191743
申请日：2023-03-28
Applicant: VMware, Inc.
Inventor： Alexander Spiegelman , Ittai Abraham , Dahlia Malkhi
IPC: H04L41/00 , H04L41/0816 , H04L67/1001
CPC classification number: H04L41/30 , H04L41/0816 , H04L67/1001
Abstract: An asynchronous state machine replication solution in a system of replicas includes executing multiple instances of a consensus protocol, referred to as leader-based views (LBVs) in each replica, where each replica is a leader participant in one of the LBV instances. Each replica drives a decision based on the consensus being reached among the LBV instances, rather than relying the expiration of timers and view changes to drive progress.
-
公开(公告)号：US20230315327A1
公开(公告)日：2023-10-05
申请号：US17710717
申请日：2022-03-31
Applicant: VMware, Inc.
Inventor： Alex Markuze , Avishay Yanai , Igor Golikov , John Manferdelli , Ittai Abraham
IPC: G06F3/06
CPC classification number: G06F3/0653 , G06F3/0673 , G06F3/0604
Abstract: In one set of embodiments, a computer system can initiate a memory stress test on a memory subsystem of the computer system, where the memory subsystem including a dynamic random access memory (DRAM). Then, while the memory stress test is running, the computer system can execute a plurality of access operations for accessing the DRAM, measure the time taken to complete each access operation, combine the measured times to compute a value, and output the value as an entropy sample.
-
公开(公告)号：US11641313B2
公开(公告)日：2023-05-02
申请号：US16912536
申请日：2020-06-25
Applicant: VMware, Inc.
Inventor： Alexander Spiegelman , Ittai Abraham , Dahlia Malkhi
IPC: H04L41/00 , H04L41/0816 , H04L67/1001
Abstract: An asynchronous state machine replication solution in a system of replicas includes executing multiple instances of a consensus protocol, referred to as leader-based views (LBVs) in each replica, where each replica is a leader participant in one of the LBV instances. Each replica drives a decision based on the consensus being reached among the LBV instances, rather than relying the expiration of timers and view changes to drive progress.
-
公开(公告)号：US11609824B2
公开(公告)日：2023-03-21
申请号：US17382756
申请日：2021-07-22
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Hristo Staykov
Abstract: In some embodiments, a method implements a Byzantine fault tolerant protocol. A first replica detects a condition to cause a view change procedure to move from a current view to a next view. The first replica sends a message indicating the first replica wants to leave the current view. Also, the first replica receives a set of messages from second replicas indicating a respective second replica wants to leave the current view. The first replica determines when a property is received to the leave the current view based on the set of messages from the set of second replicas. When it is determined the property is received, the first replica performs a process to leave the current view. When it is determined the property is not received, the first replica stays in the current view and participating in processing a request from a client in the current view.
-
Patent Agency Ranking
公开(公告)号：US20220391410A1
公开(公告)日：2022-12-08
申请号：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
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.
-
公开(公告)号：US11502829B2
公开(公告)日：2022-11-15
申请号：US17010526
申请日：2020-09-02
Applicant: VMware, Inc.
Inventor： Avishay Yanai , Ittai Abraham
Abstract: In one set of embodiments, each server executing a secure multi-party computation (MPC) protocol can receive shares of inputs to the MPC protocol from a plurality of clients, where each input is private to each client and where each share is generated from its corresponding input using a threshold secret sharing scheme. Each server can then verify whether the shares of the plurality of inputs are valid/invalid and, for each invalid share, determine whether a client that submitted the invalid share or a server that holds the invalid share is corrupted. If the client that submitted the invalid share is corrupted, each server can ignore the input of that corrupted client during a computation phase of the MPC protocol. Alternatively, if the server that holds the invalid share is corrupted, each server can prevent that corrupted server from participating in the computation phase.
-
公开(公告)号：US20220138062A1
公开(公告)日：2022-05-05
申请号：US17575507
申请日：2022-01-13
Applicant: VMware, Inc.
Inventor： Ittai Abraham , Dahlia Malkhi , Alexander Spiegelman , Guy Golan Gueta
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.
-
公开(公告)号：US10795871B2
公开(公告)日：2020-10-06
申请号：US15276236
申请日：2016-09-26
Applicant: VMware, Inc.
Inventor： Vijaychidambaram Velayudhan Pillai , Ittai Abraham
Abstract: An example computer system includes a memory storing program code and a storage system storing at least a portion of a fragmented log-structured merge (FLSM) tree implementing a key-value store. The FLSM tree includes H levels, where H is an integer greater than one. The computer system further includes a central processing unit (CPU) configured to execute the program code stored in the memory to store a plurality of key-value pairs in the FLSM tree, the key value pairs having keys defined within a key space, the key space divided by a plurality of guards for each of the H levels of the FLSM tree, each of the key-value pairs being stored a maximum of H times in the FLSM tree.
-
公开(公告)号：US20200081805A1
公开(公告)日：2020-03-12
申请号：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.024 seconds)
