Proving that a user profile satisfies selection criteria for targeted data delivery
First Claim
1. A computer-implemented method for targeted data delivery, said method comprising:
- accessing, by said computer, a user profile comprising information about a user collected from at least one electronic device associated with said user; and
computing, by said computer, a root hash of a hash-based directed acyclic graph (HDAG), said HDAG including hashed values of items of information in said user profile, wherein said root hash is computed before an offer of data is presented to said user, and is used in proving that said user profile satisfies selection criteria associated with said offer to deliver said data, wherein said user is eligible to be presented with said offer of data provided said user profile satisfies said selection criteria and produces one or more proofs that said root hash satisfied said selection criteria at the time said root hash was computed, wherein each of said proofs are calculated after said user commits to said user profile, and said proofs calculated after said user commits to said user profile and said root hash computed before said offer of data is presented to said user are used to determine whether said user profile satisfies said selection criteria, wherein said data is targeted to said user based on said user profile without requiring a release of any of said information in said user profile.
1 Assignment
0 Petitions
Accused Products
Abstract
Methods and systems for targeted data delivery are described. A user profile that includes information about a user is accessed. A root hash of a hash-based directed acyclic graph (HDAG) is computed. The HDAG includes hashed values of items of information in the user profile. The root hash is used in proving that the user profile satisfies selection criteria associated with an offer to deliver data. The user is eligible to be presented with the offer of data provided the user profile satisfies the selection criteria. The data is targeted to the user based on the user profile without requiring a release of any of the information in the user profile.
133 Citations
20 Claims
-
1. A computer-implemented method for targeted data delivery, said method comprising:
-
accessing, by said computer, a user profile comprising information about a user collected from at least one electronic device associated with said user; and computing, by said computer, a root hash of a hash-based directed acyclic graph (HDAG), said HDAG including hashed values of items of information in said user profile, wherein said root hash is computed before an offer of data is presented to said user, and is used in proving that said user profile satisfies selection criteria associated with said offer to deliver said data, wherein said user is eligible to be presented with said offer of data provided said user profile satisfies said selection criteria and produces one or more proofs that said root hash satisfied said selection criteria at the time said root hash was computed, wherein each of said proofs are calculated after said user commits to said user profile, and said proofs calculated after said user commits to said user profile and said root hash computed before said offer of data is presented to said user are used to determine whether said user profile satisfies said selection criteria, wherein said data is targeted to said user based on said user profile without requiring a release of any of said information in said user profile. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A computer-implemented method for targeted data delivery, said method comprising:
-
receiving, by said computer, a root hash of a hash-based directed acyclic graph (HDAG), said HDAG including hashed values of items of information in a user profile, wherein said root hash is computed before an offer of data is issued to said user, wherein said user profile comprises information about a user collected from at least one electronic device associated with said user, wherein said HDAG comprises a plurality of nodes wherein at least one of said nodes has multiple parents and wherein said nodes comprise a root node and a plurality of leaf nodes; receiving, by said computer, one or more proofs about said user profile, wherein a combination of all of said proofs does not reveal information about which of said nodes has multiple parents, each of said proofs calculated after said user commits to said user profile and comprising a trace comprising nodes and node pointers traversed between said root node and one of said leaf nodes; and using, by said computer, said proofs calculated after said user commits to said user profile and said root hash computed before said offer of data is issued to said user to determine whether said user profile satisfies selection criteria associated with said offer to deliver said data. - View Dependent Claims (12, 13, 14)
-
-
15. Application instructions on a non-transitory computer-usable medium where said instructions when executed effect a method for targeted data delivery, said method comprising:
-
accessing a user profile comprising information about a user collected from at least one electronic device associated with said user; computing a root hash of a hash-based directed acyclic graph (HDAG), said HDAG including hashed values of items of information in said user profile, wherein said root hash is computed before an offer of data is presented to said user; and using said root hash in proving that said user profile satisfies selection criteria associated with said offer to deliver said data, wherein said user is eligible to be presented with said offer of data provided said user profile satisfies said selection criteria and produces one or more proofs that said root hash satisfied said selection criteria at the time said root hash was computed, wherein each of said proofs are calculated after said user commits to said user profile, and said proofs calculated after said user commits to said user profile and said root hash computed before said offer of data is presented to said user are used to determine whether said user profile satisfies said selection criteria, wherein said data is targeted to said user based on said user profile without requiring a release of any of said information in said user profile. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification