-
公开(公告)号：US20240028612A1
公开(公告)日：2024-01-25
申请号：US18480856
申请日：2023-10-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 , G06F16/24535 , H04L9/50 , G06F16/27 , G06F11/00
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.
-
公开(公告)号：US11809288B2
公开(公告)日：2023-11-07
申请号：US17746066
申请日：2022-05-17
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.
-
公开(公告)号：US20230315392A1
公开(公告)日：2023-10-05
申请号：US17710752
申请日：2022-03-31
Applicant: VMware, Inc.
Inventor： Alex Markuze , Avishay Yanai , Igor Golikov , John Manferdelli , Ittai Abraham
CPC classification number: G06F7/582 , G06F9/4806
Abstract: In one set of embodiments, a computer system can initialize a counter that is shared by a plurality of software processes, where each software process is programmed to increment the counter a predefined number of times. The computer system can further run the plurality of software processes concurrently. Upon completion of the plurality of software processes, the computer system can apply one or more functions to the shared counter and output the result as an entropy sample.
-
公开(公告)号：US20230195750A1
公开(公告)日：2023-06-22
申请号：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.
-
公开(公告)号：US11354199B2
公开(公告)日：2022-06-07
申请号：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.
-
Patent Agency Ranking
公开(公告)号：US20210281433A1
公开(公告)日：2021-09-09
申请号：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.
-
公开(公告)号：US20200151268A1
公开(公告)日：2020-05-14
申请号：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: 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.
-
公开(公告)号：US20240265373A1
公开(公告)日：2024-08-08
申请号：US18160110
申请日：2023-01-26
Applicant: VMware, Inc.
Inventor： Alin Tomescu , Adithya Bhat , Ittai Abraham , Guy Gueta , Binyamin Pinkas , Avishay Yanai
CPC classification number: G06Q20/3678 , G06Q20/389 , G06Q20/4014
Abstract: Disclosed are examples of accountable decentralized anonymous payment systems and methods. One such method comprises storing, in a digital wallet, a digital coin that has been signed by a bank computing device; rerandomizing the digital coin and a coin signature to produce a new version of the digital coin that is anonymous with respect to an owner of the digital coin; sending the new version of the digital coin to a recipient computing device; computing a nullifier for the new version of the digital coin using a pseuodorandom function over a serial number of the digital coin; sending the nullifier for the new version of the digital coin to the bank computing device; and providing the bank computing device a zero knowledge proof that a value of the nullifier for the new version of the digital coin is correct and is the same as a nullifier of the digital coin.
-
公开(公告)号：US20230315916A1
公开(公告)日：2023-10-05
申请号：US17710462
申请日：2022-03-31
Applicant: VMware, Inc.
Inventor： Alex Markuze , Avishay Yanai , Igor Golikov , John Manferdelli , Ittai Abraham
Abstract: In one set of embodiments, a computer system can allocate a memory buffer in a dynamic random access memory (DRAM), determine a plurality of DRAM rows covered by the memory buffer, and execute a Rowhammer attack against a target row in the plurality of DRAM rows, thereby yielding randomly flipped bits in one or more neighboring DRAM rows. The computer system can then compute a value based on the randomly flipped bits and output the value as an entropy sample.
-
公开(公告)号：US20230259430A1
公开(公告)日：2023-08-17
申请号：US18304259
申请日：2023-04-20
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.
-
-
-
-
-
-
-
-
-
Search Results
50
records
(took 0.016 seconds)
