-
Patent Agency Ranking
公开(公告)号：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.
-
公开(公告)号：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.
-
公开(公告)号：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.
-
公开(公告)号：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.
-
公开(公告)号：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.
-
-
-
-
Search Results
5
records
(took 0.025 seconds)
