中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

9 records (took 0.011 seconds)

    TREE STRUCTURE FOR BYZANTINE FAULT TOLERANCE
    1.
    发明公开
    TREE STRUCTURE FOR BYZANTINE FAULT TOLERANCE 审中-公开

    公开(公告)号：US20240097910A1

    公开(公告)日：2024-03-21

    申请号：US18186551

    申请日：2023-03-20

    Applicant: CELO FOUNDATION

    Inventor： Jason Ansel ,  Marek Olszewski

    IPC: H04L9/32 ,  G06F11/07 ,  G06F11/20 ,  H04L67/1097

    CPC classification number: H04L9/3236 ,  G06F11/0751 ,  G06F11/2097 ,  H04L9/3247 ,  H04L67/1097 ,  G06F2201/82 ,  H04L9/50

    Abstract: Systems and techniques are provided for a tree structure for byzantine fault tolerance. A validator computing device may receive a candidate block from a block producer. The block producer may be a second validator computing device of the distributed network. The validator computing device may determine whether or not the candidate block is valid. The validator computing device may sign an indication of whether or not the candidate block is valid to generate a signature. The validator computing device may send the signature to a third validator computing device that is a sibling node to the validator computing device. The validator computing device may receive a second signature from the third validator computing device. The validator computing device may combine the signature and the second signature to generate a combine signature if the signature and the second signature agree.

    Decentralized database associating public keys and communications addresses
    4.
    发明授权
    Decentralized database associating public keys and communications addresses 有权

    公开(公告)号：US11080246B2

    公开(公告)日：2021-08-03

    申请号：US16216007

    申请日：2018-12-11

    Applicant: Celo Foundation

    Inventor： Rene Reinsberg ,  Sepandar Kamvar ,  Marek Olszewski

    IPC: G06F17/30 ,  G06F16/182 ,  G06F16/18 ,  H04L9/06 ,  H04L9/32 ,  H04L9/08

    Abstract: Systems and techniques are provided for a decentralized database associating public keys and communications addresses. A signed secret message may be sent by a validator computing device of a peer-to-peer network for a decentralized database to a communications address from a request for verification entry in a verification queue of the decentralized database. A second request for verification including the communications address and a user-signed secret message may be received. The user-signed secret message may be verified using a public key from the request for verification entry in the verification queue. The communications address and public key may be written to a verified database of the decentralized database when verifying the user-signed secret message causes a number of user-signed secret messages received in requests for verification with the communications address and successfully verified to meet a threshold number.

    Tree structure for byzantine fault tolerance
    5.
    发明授权
    Tree structure for byzantine fault tolerance 有权

    公开(公告)号：US11611439B2

    公开(公告)日：2023-03-21

    申请号：US16899065

    申请日：2020-06-11

    Applicant: CELO FOUNDATION

    Inventor： Jason Ansel ,  Marek Olszewski

    IPC: H04L9/32 ,  G06F11/20 ,  H04L67/1097 ,  G06F11/07 ,  H04L9/00

    Abstract: Systems and techniques are provided for a tree structure for byzantine fault tolerance. A validator computing device may receive a candidate block from a block producer. The block producer may be a second validator computing device of the distributed network. The validator computing device may determine whether or not the candidate block is valid. The validator computing device may sign an indication of whether or not the candidate block is valid to generate a signature. The validator computing device may send the signature to a third validator computing device that is a sibling node to the validator computing device. The validator computing device may receive a second signature from the third validator computing device. The validator computing device may combine the signature and the second signature to generate a combine signature if the signature and the second signature agree.

    Decentralized name verification using recursive attestation
    9.
    发明授权
    Decentralized name verification using recursive attestation 有权

    公开(公告)号：US11106767B2

    公开(公告)日：2021-08-31

    申请号：US16216022

    申请日：2018-12-11

    Applicant: Celo Foundation

    Inventor： Rene Reinsberg ,  Sepandar Kamvar ,  Marek Olszewski

    IPC: G06F21/31 ,  G06F16/335 ,  H04L29/06 ,  G06F21/45

    Abstract: Systems and techniques are provided for decentralized name verification using recursive attestation. A name and identifying information may be received at a computing device. The computing device may determine that there is a contact item that includes both the name and the identifying information in a contacts database stored on the computing device or accessible to the computing device. A positive attestation and an attestation score for an entity associated with the computing device may be sent to be used to generate an attestation score for the name and identifying information. The attestation score for the name and identifying information is used to determine whether to allow the creation of an account with the name. The attestation score for the entity associated with the computing device may be generated based a positive attestation from another computing device.

Patent Agency Ranking