US 11,843,587 B2
Systems and methods for tree-based model inference using multi-party computation
Babak Poorebrahim Gilkalaye, Kansas City, MO (US); Gharib Gharibi, Overland Park, KS (US); Greg Storm, Kansas City, MO (US); and Riddhiman Das, Parkville, MO (US)
Assigned to TripleBlind, Inc., Kansas City, MO (US)
Filed by TripleBlind, Inc., Kansas City, MO (US)
Filed on Sep. 7, 2022, as Appl. No. 17/939,285.
Application 17/939,285 is a continuation of application No. 17/180,475, filed on Feb. 19, 2021.
Application 17/180,475 is a continuation in part of application No. 16/828,085, filed on Mar. 24, 2020, granted, now 11,582,203.
Application 16/828,085 is a continuation in part of application No. 16/828,216, filed on Mar. 24, 2020.
Application 16/828,216 is a continuation in part of application No. 17/176,530, filed on Feb. 16, 2021.
Application 17/176,530 is a continuation of application No. 16/828,354, filed on Mar. 24, 2020, granted, now 10,924,460, issued on Feb. 16, 2021.
Application 16/828,354 is a continuation in part of application No. 16/828,420, filed on Mar. 24, 2020, granted, now 11,363,002, issued on Jun. 14, 2022.
Application 16/828,420 is a continuation of application No. 17/743,887, filed on May 13, 2022, granted, now 11,531,782.
Application 17/743,887 is a continuation of application No. 17/742,808, filed on May 12, 2022.
Claims priority of provisional application 63/241,255, filed on Sep. 7, 2021.
Claims priority of provisional application 63/020,930, filed on May 6, 2020.
Claims priority of provisional application 62/948,105, filed on Dec. 13, 2019.
Prior Publication US 2023/0006978 A1, Jan. 5, 2023
Int. Cl. H04L 9/40 (2022.01); G06N 3/082 (2023.01); H04L 9/00 (2022.01); G06F 17/16 (2006.01); G06N 3/04 (2023.01); H04L 9/06 (2006.01); G06F 18/24 (2023.01); G06F 18/2113 (2023.01); G06N 3/098 (2023.01); G06N 3/048 (2023.01); G06F 16/13 (2019.01); G06F 21/62 (2013.01)
CPC H04L 63/0428 (2013.01) [G06F 16/13 (2019.01); G06F 17/16 (2013.01); G06F 18/2113 (2023.01); G06F 18/24 (2023.01); G06F 21/6245 (2013.01); G06N 3/04 (2013.01); G06N 3/048 (2023.01); G06N 3/082 (2013.01); G06N 3/098 (2023.01); H04L 9/008 (2013.01); H04L 9/0625 (2013.01); H04L 2209/46 (2013.01)] 14 Claims
OG exemplary drawing
 
1. A method comprising:
computing a respective comparison result of each respective node of a plurality of nodes in a tree classifier, wherein each node of the plurality of nodes has a respective threshold value and is associated with a model owner device, wherein the respective comparison result is based on respective data associated with a data owner device being applied to a respective node having the respective threshold value, wherein the respective comparison result does not reveal the respective data to the model owner device and does not reveal the respective threshold value to the data owner device and wherein the model owner device differs from the data owner device;
computing, based on the respective comparison result, a leaf value associated with the tree classifier, wherein computing the leaf value comprises multiplying the respective comparison result with a respective leaf value associated with a respective node of the plurality of nodes and adding together each respective multiplication of the respective comparison result with the respective leaf value associated with a respective node of the plurality of nodes to generate the leaf value and wherein the data owner device computes, using a secure multi-party computation and beaver triplet between the model owner device and the data owner device, the leaf value for the respective data of the data owner device;
generating a share of the leaf value; and
transmitting, from the model owner device to the data owner device, the share of the leaf value.