会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明公开
    • COMPUTER-IMPLEMENTED SYSTEM AND METHOD FOR EXCHANGE OF DATA
    • EP4398141A2
    • 2024-07-10
    • EP24177821.6
    • 2019-03-18
    • nChain Licensing AG
    • TREVETHAN, ThomasWRIGHT, Craig Steven
    • G06F21/64
    • H04L9/3218H04L9/50G06F21/64H04L2209/5620130101H04L9/008H04L9/3252
    • The invention relates to efficient zero knowledge verification of composite statements that involve both arithmetic circuit satisfiability and dependent statements about the validity of public keys (key-statement proofs) simultaneously. The method enables a prover to prove this particular statement in zero-knowledge.
      More specifically, the invention relates to a computer-implemented method for enabling zero-knowledge proof or verification of a statement (S) in which a prover proves to a verifier that a statement is true while keeping a witness (W) to the statement a secret. The invention also relates to the reciprocal method employed by a verifier who verifies the proof.
      The method includes the prover sending to the verifier a statement (S) having an arithmetic circuit with m gates and n wires configured to implement a function circuit and determine whether for a given function circuit output (h) and an elliptic curve point (P), the function circuit input (s) to a wire of the function circuit is equal to the corresponding elliptic curve point multiplier (s). The prover also sends individual wire commitments and/or a batched commitment for wires of the circuit, an input for a wire in the arithmetic circuit; and a function circuit output (h). The prover receives from the verifier a challenge value (x) and responding with an opening or additionally sends a proving key (PrK) to the verifier. The statement and the data enables the verifier to determine that the circuit is satisfied and calculate the elliptic curve point (P) and validate the statement, thus determining that the prover holds the witness (W) to the statement.
    • 7. 发明公开
    • COMPUTER IMPLEMENTED METHOD AND SYSTEM FOR TRANSFERRING ACCESS TO A DIGITAL ASSET
    • EP4340295A2
    • 2024-03-20
    • EP24154980.7
    • 2019-03-26
    • nChain Licensing AG
    • WRIGHT, Craig StevenFLETCHER, JohnTREVETHAN, Thomas
    • H04L9/32
    • A method of transferring access to a digital asset comprises providing each of a plurality of participants with a respective share of a second private key of a second private-public key pair of a cryptography system, and splitting the respective share of one of the participants is into a plurality of sub-shares before deleting it. A first blockchain transaction is received from a first participant of the participants by each of a plurality of second participants of the participants, wherein the first participant has a first private key of a first private-public key pair of the cryptography system, and wherein the first blockchain transaction is signed with the first private key. A plurality of the second participants verify that the first blockchain transaction has been signed with the first private key, and apply a respective the share of the second private key to the first blockchain transaction to generate a respective share of a first secret value, wherein the first secret value is a second blockchain transaction signed with the second private key, wherein the first secret value is accessible to a first threshold number of the shares of the first secret value and is inaccessible to less than the first threshold number of shares of the first secret value. At least the first threshold number of the shares of the first secret value are combined, from the first participant and a plurality of the second participants, to generate the first secret value.
    • 9. 发明公开
    • COMPUTER-IMPLEMENTED SYSTEM AND METHOD FOR EXCHANGE OF DATA
    • EP4221077A1
    • 2023-08-02
    • EP23164844.5
    • 2019-03-18
    • nChain Licensing AG
    • TREVETHAN, ThomasWRIGHT, Craig Steven
    • H04L9/32H04L9/00G06F21/64
    • The invention relates to efficient zero knowledge verification of composite statements that involve both arithmetic circuit satisfiability and dependent statements about the validity of public keys (key-statement proofs) simultaneously. The method enables a prover to prove this particular statement in zero-knowledge.
      More specifically, the invention relates to a computer-implemented method for enabling zero-knowledge proof or verification of a statement (S) in which a prover proves to a verifier that a statement is true while keeping a witness (W) to the statement a secret. The invention also relates to the reciprocal method employed by a verifier who verifies the proof.
      The method includes the prover sending to the verifier a statement (S) having an arithmetic circuit with m gates and n wires configured to implement a function circuit and determine whether for a given function circuit output (h) and an elliptic curve point (P), the function circuit input (s) to a wire of the function circuit is equal to the corresponding elliptic curve point multiplier (s). The prover also sends individual wire commitments and/or a batched commitment for wires of the circuit, an input for a wire in the arithmetic circuit; and a function circuit output (h). The prover receives from the verifier a challenge value ( x ) and responding with an opening or additionally sends a proving key ( PrK ) to the verifier. The statement and the data enables the verifier to determine that the circuit is satisfied and calculate the elliptic curve point (P) and validate the statement, thus determining that the prover holds the witness (W) to the statement.