IP Library Granted Patent US 12,200,117
Granted Patent B2
US 12,200,117 · App. 16/620,461 · Granted Jan 14, 2025

Credential generation and distribution method and system for a blockchain network

Inventors: Giuseppe Destefanis (London, GB); Simone Madeo (London, GB); Patrick Motylinski (London, GB); Stephane Vincent (Luxembourg, LU)
Assignee: NCHAIN LICENSING AG
H04L9/0861H04L9/0637H04L9/0643H04L9/0816H04L9/0825H04L9/3066H04L9/3073H04L9/3239H04L9/50H04L2209/56
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,200,117
App. No.
16/620,461
Granted
Jan 14, 2025
Kind
B2
Abstract

Methods and devices that manage the secure distribution of credentials from a group of autonomous specialized nodes to a requesting node. The secure distribution of credentials may uses secret share and a group private key that none of the nodes reconstructs or possesses. The credentials include an identifier for the requesting node and a secret point that the node assembles from portions of the secret point provided by each of a plurality of the specialized nodes, where the secret point is based on the group private key and a map-to-point hash of the requesting node's identifier.

Claims (25)

1. A computer-implemented method for a node to obtain a credential indicative of a role of a blockchain node in a blockchain network from a group of specialized nodes, each of the specialized nodes having a private key share of a group private key, wherein the method comprises:

sending a request, from the node to a plurality of the specialized nodes, for the credential, wherein the request includes an identifier of the node, the identifier including an identifier string identifying the node and a role string identifying the role of the group of specialized nodes in the blockchain network, the role of the group defined as one of validation, storage, or mining;

receiving a portion of a secret point from a corresponding specialized node in the plurality of the specialized nodes, wherein the portion of the secret point is generated by the corresponding node in the plurality of the specialized nodes based at least in part on the identifier and the private key share of the corresponding specialized node; and

generating the secret point by combining received portions of the secret point, wherein the secret point comprises the group private key multiplied by a map-to-point hash of the identifier, and the credential comprises the identifier and the secret point,

and wherein none of the specialized nodes nor the node is required to obtain a complete copy of the group private key.

2. The method claimed in claim 1 , wherein sending the request includes sending a separate request to each of the plurality of the specialized nodes.

3. The method claimed in claim 1 , wherein the identifier string further includes an expiration time for the credential.

4. The method claimed in claim 1 , wherein sending a request includes sending the identifier string, and wherein receiving includes receiving the identifier from a node of the plurality of specialized nodes.

5. The method claimed in claim 1 , wherein generating the secret point uses a secret share to generate the secret point that is based on the group private key.

6. The method claimed in claim 5 , wherein the secret share uses Lagrange interpolation and private key shares of the plurality of the specialized nodes without reconstructing the group private key.

7. A node comprising:

a processor,

memory;

a network interface; and

an application containing processor-executable instructions to obtain a credential from a plurality of specialized nodes, the credential indicative of a role of a blockchain node in a blockchain network, each of the specialized nodes having a private key share of a group private key, wherein, when executed, the processor-executable instructions cause the node to:

send a request for the credential to a plurality of the specialized nodes, wherein the request includes an identifier of the node, the identifier including an identifier string identifying the specialized node and a role string identifying a role of the group of specialized nodes in the blockchain network;

receive, from a respective specialized node in the plurality of the specialized nodes, a respective portion of a secret point generated by the respective node in the plurality of specialized nodes based at least in part on the identifier and the private key share of each specialized node; and

generate the secret point by combining the received portions of the secret point, wherein the secret point comprises the group private key times a map-to-point hash of the identifier, and the credential comprises the identifier and the secret point,

and wherein none of the specialized nodes nor the node is required to obtain a complete copy of the group private key.

8. The node claimed in claim 7 , wherein the processor-executable instructions, when executed, cause the node to send the request by sending a separate request to each of the plurality of the specialized nodes.

9. The node claimed in claim 7 , wherein the identifier string further includes an expiration time for the credential.

10. The node claimed in claim 7 , wherein the processor-executable instructions, when executed, cause the node to send the request by sending the identifier string, and to receive by receiving the identifier from a node of the plurality of the specialized nodes.

11. The node claimed in claim 7 , wherein the processor-executable instructions, when executed, cause the node to generate the secret point using a secret share to generate the secret point that is based on the group private key.

12. The node claimed in claim 11 , wherein the secret share uses Lagrange interpolation and private key shares of the plurality of the specialized nodes without reconstructing the group private key.

13. A non-transitory processor-readable medium storing processor-executable instructions that, when executed by one or more processors, cause the one or more processors to carry out operations in the method claimed in claim 1 .

Assignments (4)
CHANGE OF NAME Recorded Sep 12, 2022
From: NCHAIN HOLDINGS LTD
To: NCHAIN LICENSING AG
Reel/Frame 061418/0955 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 11, 2020
From: MOTYLINSKI, PATRICK; VINCENT, STEPHANE; DESTEFANIS, GIUSEPPE; MADEO, SIMONE
To: NCHAIN HOLDINGS LTD
Reel/Frame 051789/0837 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 11, 2020
From: MOTYLINSKI, PATRICK; VINCENT, STEPHANE; DESTEFANIS, GIUSEPPE; MADEO, SIMONE
To: NCHAIN HOLDINGS LTD
Reel/Frame 051789/0854 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 6, 2020
From: DANGER, RICHARD; BROUARD, SOPHIE; ROYER, PIERRE-JOSEPH; MAGNAN, ANTOINE
To: INSERM (INSTITUTE NATIONAL DE LA SANTE ET DE LA RECHERCHE MEDICALE); UNIVERSITE DE NANTES; CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE; CENTRE HOSPITALIER UNIVERSITAIRE DE NANTES
Reel/Frame 051838/0968 →
Priority Claims (2)
GB 1709096 · Jun 7, 2017 · national
GB 1709097 · Jun 7, 2017 · national
Continuity (1)
Related Publication 20200186335A1 · Jun 11, 2020
References Cited (94)
US 7397917B2 · Chen · 2008 [cited by examiner]
US 7590236B1 · Boneh · 2009 [cited by examiner]
US 8108678B1 · Boyen · 2012 [cited by applicant]
US 9154296B1 · O'Connell · 2015 [cited by examiner]
US 9344438B2 · Xiao · 2016 [cited by examiner]
US 9641333B2 · Scott et al. · 2017 [cited by applicant]
US 9705856B2 · Gehrmann · 2017 [cited by examiner]
US 10069914B1 · Smith · 2018 [cited by examiner]
US 10102265B1 · Madisetti et al. · 2018 [cited by applicant]
US 10856122B2 · Smith et al. · 2020 [cited by applicant]
US 11296873B2 · Destefanis · 2022 [cited by examiner]
US 20030081785A1 · Boneh · 2003 [cited by examiner]
US 20040123098A1 · Chen et al. · 2004 [cited by applicant]
US 20040131191A1 · Chen · 2004 [cited by examiner]
US 20040174829A1 · Ayyagari · 2004 [cited by examiner]
US 20040179684A1 · Appenzeller · 2004 [cited by examiner]
US 20060023887A1 · Agrawal · 2006 [cited by examiner]
US 20060036856A1 · Kok · 2006 [cited by examiner]
US 20060098824A1 · Mao · 2006 [cited by examiner]
US 20070019807A1 · Jung · 2007 [cited by examiner]
US 20070028114A1 · McCullagh et al. · 2007 [cited by applicant]
US 20090307492A1 · Cao et al. · 2009 [cited by applicant]
US 20100161817A1 · Xiao · 2010 [cited by examiner]
US 20100195830A1 · Kubotera · 2010 [cited by applicant]
US 20100235625A1 · Pandey · 2010 [cited by examiner]
US 20110302412A1 · Deng et al. · 2011 [cited by applicant]
US 20130007442A1 · Mao · 2013 [cited by examiner]
US 20130191632A1 · Spector · 2013 [cited by examiner]
US 20140074987A1 · Martz · 2014 [cited by examiner]
US 20140359290A1 · McCusker · 2014 [cited by examiner]
US 20150106869A1 · Cabrera · 2015 [cited by examiner]
US 20150124963A1 · McCusker et al. · 2015 [cited by applicant]
US 20150195261A1 · Gehrmann · 2015 [cited by examiner]
US 20150244525A1 · McCusker et al. · 2015 [cited by applicant]
US 20160035963A1 · Kurokawa · 2016 [cited by applicant]
US 20160269186A1 · Wallrabenstein · 2016 [cited by examiner]
US 20160344707A1 · Philipp · 2016 [cited by applicant]
US 20170134161A1 · Goeringer et al. · 2017 [cited by applicant]
US 20170236120A1 · Herlihy et al. · 2017 [cited by applicant]
US 20170323392A1 · Kasper et al. · 2017 [cited by applicant]
US 20170338963A1 · Berg · 2017 [cited by applicant]
US 20170344987A1 · Davis · 2017 [cited by applicant]
US 20180039667A1 · Pierce et al. · 2018 [cited by applicant]
US 20180054427A1 · Revell · 2018 [cited by examiner]
US 20180109541A1 · Gleichauf · 2018 [cited by applicant]
US 20180145836A1 · Saur et al. · 2018 [cited by applicant]
US 20180330343A1 · Gray · 2018 [cited by applicant]
US 20180351752A1 · Wallrabenstein · 2018 [cited by examiner]
US 20190394047A1 · Karame et al. · 2019 [cited by applicant]
US 20200186336A1 · Destefanis · 2020 [cited by examiner]
US 20200192873A1 · Chang · 2020 [cited by applicant]
US 20210135854A1 · Karame et al. · 2021 [cited by applicant]
US 20210203485A1 · Afanasyeva · 2021 [cited by examiner]
US 20220294622A1 · Destefanis · 2022 [cited by examiner]
US 20230208630A1 · Destefanis · 2023 [cited by examiner]
US 20230216920A1 · Destefanis et al. · 2023 [cited by applicant]
CN 101841479A · 2010 [cited by applicant]
CN 102208962A · 2011 [cited by applicant]
CN 103297174A · 2013 [cited by applicant]
CN 106209369A · 2016 [cited by applicant]
CN 106603198A · 2017 [cited by applicant]
EP 3113392A1 · 2017 [cited by applicant]
JP 2005500740A · 2005 [cited by applicant]
JP 2016170530A · 2016 [cited by applicant]
WO 03017559A2 · 2003 [cited by applicant]
U.S. Appl. No. 16/620,474, filed Dec. 6, 2019. [cited by applicant]
Alphageek et al., “Bitcoin Computer Science research topics,” Bitcoin Forum, Feb. 4, 2014, https://bitcointalk.org/index.php?topic=448562.0, 2 pages. [cited by applicant]
Barua et al., “Pairing-based Crytography,” 2006, http://math.iisc.ernet.in/˜imi/downloads/RBC.pdf, 44pages. [cited by applicant]
Boneh et al., “A Method for Fast Revocation of Public Key Certificates and Security Capabilities,” Proceedings of the 10th USENIX Security Symposium, Aug. 13, 2001, https://pdfs.semanticscholar.org/4455/d48d5fbc13a562f3… [cited by applicant]
Boneh et al., “Identity-Based Encryption from the Weil Pairing,” SIAM Journal on Computing 32(3):586-615, 2003. [cited by applicant]
Boneh, “A conversation with Dan Boneh,” DIYPlus Wiki, Aug. 1, 2016, http://diyhpl.us/wiki/transcripts/2016-july-bitcoin-developers-miners-meeting/dan-boneh/, 13 pages. [cited by applicant]
Dikshit et al., “Efficient weighted threshold ECDSA for securing bitcoin wallet,” 2017 ISEA Asia Security and Privacy (ISEASP), http://ieeexplore.ieee.org/document/7976994/, Jan. 29, 2017, 10 pages. [cited by applicant]
Garman et al., “Decentralized Anonymous Credentials,” Oct. 15, 2013, https://eprint.iacr.org/2013/622.pdf, 21 pages. [cited by applicant]
Horwitz et al., “Toward Hierarchical Identity-Based Encryption,” International Conference on the Theory and Applications of Cryptographic Techniques, Apr. 28, 2002, https://link.springer.com/content/pdf/10.1007%2F3-540-… [cited by applicant]
International Search Report and Written Opinion mailed Aug. 21, 2018, Patent Application No. PCT/IB2018/053981, 12 pages. [cited by applicant]
International Search Report and Written Opinion mailed Sep. 3, 2018, Patent Application No. PCT/IB2018/053977, 13 pages. [cited by applicant]
UK Commercial Search Report mailed Aug. 23, 2017, Patent Application No. GB1709096.0, 9 pages. [cited by applicant]
UK Commercial Search Report mailed Aug. 23, 2017, Patent Application No. GB1709097.8, 9 pages. [cited by applicant]
UK IPO Search Report mailed Nov. 27, 2017, Patent Application No. GB1709096.0, 4 pages. [cited by applicant]
UK IPO Search Report mailed Nov. 27, 2017, Patent Application No. GB1709097.8, 5 pages. [cited by applicant]
Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System,” Bitcoin, Oct. 31, 2008, https://bitcoin.org/bitcoin.pdf, 9 pages. [cited by applicant]
Antonopoulos, “Mastering Bitcoin—Unlocking Digital Cryptocurrencies,” O'Reilly Media, Inc., Dec. 20, 2014, 282 pages. [cited by applicant]
Barker Brettell, “Reply to UDL's Observations on a Request for an Opinion under Section 74(A) for Patent No. EP(UK) 3465578,” mailed Oct. 19, 2021, 4 pages. [cited by applicant]
Barker Brettell, “We request an opinion under Section 74A . . . ,” letter dated Sep. 1, 2021, 6 pages. [cited by applicant]
Galindo et al., “A Killer Application for Pairings: Authenticated Key Establishment in Underwater Wireless Sensor Networks,” Proceedings of the 7th International Conference on Cryptology and Network Security (CANS08), D… [cited by applicant]
Jafarisiavoshani et al., “Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems,” Aug. 2007, 6 pages. [cited by applicant]
Lee et al., “Power Saving Mechanism with Network Coding in the Bottleneck Zone of Multimedia Sensor Networks,” Elsevier Journal, Aug. 21, 2015, 11 pages. [cited by applicant]
Magli et al., “Network Coding Meets Multimedia: A Review,” IEEE Transactions on Multimedia, Aug. 2013, 18 pages. [cited by applicant]
Rout et al., “Enhancement of Lifetime Using Duty Cycle and Network Coding in Wireless Sensor Networks,” IEEE Transactions on Wireless Communications, Feb. 2013, 12 pages. [cited by applicant]
Satoshi et al., “Connection Limits,” Bitcoin Forum, Aug. 9, 2010, https://bitcointalk.org/index.php?topic=741.0;prev_next=prev, 2 pages. [cited by applicant]
UDL, “Observations on a Request for an Opinion under Section 74(A) for Patent No. EP(UK) 3465578,” mailed Oct. 5, 2021, 3 pages. [cited by applicant]
UK Request for an opinion under Section 74(A) and Patents Form 17 mailed Sep. 7, 2021, Patent Application No. GB1709096.0, 4 pages. [cited by applicant]
Wuille, “[Bitcoin-development] Removing Transaction Data From Blocks,” May 8, 2015 [retrieved Sep. 9, 2017], https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2015-May/008000.html, 2 pages. [cited by applicant]
Japan Patent Office, “Office Action” in Application No. 2023-028439, May 7, 2024, 8 pages. [cited by applicant]