Tenant aware mutual tls authentication
US-2022182374-A1 · Jun 9, 2022 · US
US11804963B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11804963-B2 |
| Application number | US-202117244391-A |
| Country | US |
| Kind code | B2 |
| Filing date | Apr 29, 2021 |
| Priority date | Apr 29, 2021 |
| Publication date | Oct 31, 2023 |
| Grant date | Oct 31, 2023 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A computer-implemented system, method and computer program product for providing access to a network of computing nodes that includes: requesting, by a client, access into a host node in the network, preferably a private network; selecting a digital certificate issuer; verifying, by the digital certificate issuer, the identity of the client's token; adding, by the certificate issuer, a nonce to a distributed ledger; and granting the client access to the host node in the network. The computing nodes in an embodiment are ranked based upon CPU capacity, and computing nodes with highest CPU capacity ranking are selected to participate in a proof-of-capacity consensus to solve for the nonce.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method of providing access to a network of computing nodes, the method comprising: requesting, by a client, access into a host node in the network; ranking the computing nodes in the network; selecting according to their rank in the network one or more computing nodes to participate in a proof-of-capacity consensus to solve for a nonce; selecting a digital certificate issuer; verifying, by the digital certificate issuer, an identity of a client's token; adding, by the digital certificate issuer, the nonce to a distributed ledger; and granting the client access to the host node in the network. 2. The computer-implemented method according to claim 1 , wherein ranking the computing nodes in the network is based upon their unused CPU capacity. 3. The computer-implemented method according to claim 1 , further comprising selecting the computing node with the highest rank as the main miner, and retrieving, by the main miner, a deadline from a plugin installed on the main miner. 4. The computer-implemented method according to claim 3 , further comprising storing, in a nonce solution store on all the computing nodes selected to participate in the proof-of-capacity consensus, all possible solutions to the nonce. 5. The computer-implemented method according to claim 4 , further comprising computing, by all the computing nodes selected to participate in the proof-of-capacity consensus, the proof-of-capacity consensus to solve for the nonce. 6. The computer-implemented method according to claim 5 , further comprising selecting the node that contains the solution to the nonce to be the digital certificate issuer. 7. A computer-implemented method according to claim 4 , further comprising: computing, by all the computing nodes selected to participate in the proof-of-capacity consensus, the proof-of-capacity consensus to solve for the nonce, and selecting, in response to none of the computing nodes selected to participate in the proof-of-capacity consensus solving for the nonce within the deadline, the main miner as the digital certificate issuer. 8. The computer-implemented method according to claim 1 , further comprising adding a new host node to the network, wherein adding a new host node to the network comprises: determining, by all the computing nodes on the network, if the new host node has a set of network defined characteristics; retrieving, in response to determining that the new host node has a set of network defined characteristics, state information from the new host node; and sharing the state information with all the computing nodes on the network. 9. The computer-implemented method according to claim 8 , wherein adding a new host node to the network further comprises sharing the distributed ledger with the new host node. 10. The computer-implemented method according to claim 9 , wherein adding a new host node to the network further comprises: ensuring the new host node is to be added to the same network as the computing nodes; installing a plugin on the new host node; detecting the network by the plugin; and informing all the computing nodes on the network that a new host node has joined the network. 11. The computer-implemented method according to claim 9 , wherein sharing the distributed ledger with the new host node comprises utilizing a RAFT protocol wherein databases containing the distributed ledger in a RAFT leader node are shared with the new host node. 12. A non-transitory computer readable medium comprising instructions that, when executed by at least one hardware processor, configure the at least one hardware processor to: request, by a client, access into a host node in a network of computing nodes; rank the computing nodes in the network; select, according to their rank in the network, one or more computing nodes to participate in a proof-of-capacity consensus to solve for a nonce; select one of the computing nodes to issue a digital certificate; verify, by the computing node selected to issue the digital certificate, an identity of a client's token; add, by the computing node selected to issue the digital certificate, a nonce to a distributed ledger; and grant the client access to the host node in the network. 13. The non-transitory computer readable medium according to claim 1 , wherein ranking the computing nodes in the network is based upon their unused CPU capacity wherein at least three computing nodes with the largest unused CPU capacity are selected to participate in the proof-of-capacity consensus. 14. The non-transitory computer readable medium according to claim 1 , further comprising instructions, that when executed by at least one hardware processor, configure the at least one hardware processor to: store, in the nonce solution store on all the computing nodes selected to participate in the proof-of-capacity consensus, all possible solutions to the nonce; compute, by all the computing nodes selected to participate in the proof-of-capacity consensus, the proof-of-capacity consensus to solve for the nonce; and select the node that contains the solution to the nonce to be the computing node that issues the digital certificate. 15. The non-transitory computer readable medium according to claim 14 , further comprising instructions, that when executed by at least one hardware processor, configure the at least one hardware processor to: select the computing node with the highest rank as the main miner; retrieve, by the main miner, a deadline from a plugin installed on the main miner; compute, by all the computing nodes selected to participate in the proof-of-capacity consensus, the proof-of-capacity consensus to solve for the nonce; and select, in response to none of the computing nodes selected to participate in the proof-of-capacity consensus solving for the nonce within the deadline, the main miner as the computing node to issue the digital certificate. 16. The non-transitory computer readable medium according to claim 12 , further comprising instructions, that when executed by at least one hardware processor, configure the at least one hardware processor to add a new host node to the network, wherein adding a new host node to the network comprises instructions, that when executed by the at least on hardware processor, configure the at least one hardware processor to: determine, by all the computing nodes on the network, if the new host node has a set of network defined characteristics; retrieve, in response to determining that the new host node has a set of network defined characteristics, state information from the new host node; and share the state information with all the computing nodes on the network. 17. The non-transitory computer readable medium according to claim 16 , wherein adding a new host node to the network further comprises instructions, that when executed by the at least one hardware processor, configure the at least one hardware processor to share the distributed ledger with the new host node. 18. The non-transitory computer readable medium according to claim 17 , wherein adding a new host node to the network further comprises instructions, that when executed by the at least one hardware processor, configure the at least one hardware processor to: determine if the new host node is to be added to the same network as the other compute nodes; install, in response to determining that the new host node is to be added to the same network as the other compute nodes, a plugin on the new host node; detect the network by the plugin; a
using tickets or tokens, e.g. Kerberos (network architectures or network communication protocols for entities authentication using tickets in a packet data network H04L63/0807) · CPC title
e-cash managed locally · CPC title
based on the use of peer-to-peer networks · CPC title
involving certificates, e.g. public key certificate [PKC] or attribute certificate [AC]; Public key infrastructure [PKI] arrangements (network architectures or network communication protocols for supporting authentication of entities using certificates in a packet data network H04L63/0823) · CPC title
using node-based peer discovery mechanisms (static access to replicated servers H04L67/1006; service discovery H04L67/51) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.