IP Library Granted Patent US 12,277,247
Granted Patent B2
US 12,277,247 · App. 17/806,728 · Granted Apr 15, 2025

Systems and methods for encrypting and controlling access to encrypted data based upon immutable ledgers

Inventors: Bjorn Markus Jakobsson (Portola Valley, CA); Stephen C. Gerber (Austin, TX); Ajay Kapur (Valencia, CA)
Assignee: Artema Labs, Inc
G06F21/6245G06F21/602H04L9/30G06F21/64H04L9/50H04L2209/42
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,277,247
App. No.
17/806,728
Granted
Apr 15, 2025
Kind
B2
Abstract

Systems and methods for automated blockchain-based recommendation generation, advertising and promotion in accordance with various embodiments of the invention are described. A user device in accordance with an embodiment of the invention includes: a network interface; memory; and a processor. In addition, the processor is configured to implement an execution environment that enables: initiation of transactions via an immutable ledger; recordation of events; updating a user profile, where the user profile comprises at least one characterization associated with the user profile; encrypting the updated user profile and securely storing the encrypted user profile; receiving a request to access the encrypted user profile from a process; determining access permissions of the process; and when the process has sufficient access permissions, decrypting the user profile and providing user profile data to the process.

Claims (60)

1. A user device configured to initiate transactions via an immutable ledger, comprising:

a network interface;

memory; and

a processor, the processor configured to implement an execution environment that enables:

initiation of transactions via the immutable ledger;

recordation of events;

updating a user profile, wherein the user profile comprises at least one characterization associated with the user profile;

encrypting the updated user profile;

securely storing the encrypted user profile;

receiving a request to access the encrypted user profile from a process;

determining access permissions of the process; and

when the process has sufficient access permissions:

decrypting the user profile,

providing user profile data to the process, and

creating an append-only area of the user profile data using:

a public key associated with the execution environment, and

a corresponding private key.

2. The user device of claim 1 , wherein the events comprise user requests and user actions.

3. The user device of claim 1 , wherein the processor is further configured to transmit the user profile data for remote storage.

4. The user device of claim 1 , wherein:

the processor is further configured to receive the user profile data from a remote source, and

the execution environment further enables updating of the user profile data of the encrypted user profile based upon the received user profile data.

5. The user device of claim 1 , wherein:

the request includes a pseudonym, and

the process is determined to have the sufficient access permissions when the pseudonym matches a pseudonym associated with the user profile.

6. A computer-implemented method, executed by one or more computer processors, of restricting access to encrypted user profiles, comprising:

updating a user profile based upon events recorded in an immutable ledger, wherein the user profile comprises at least one characterization associated with the user profile;

encrypting the updated user profile;

securely storing the encrypted user profile;

receiving a request to access the encrypted user profile from a process; and

determining that the process has sufficient access permissions to perform:

decrypting the user profile,

providing user profile data to the process, and

creating an append-only area of the user profile data using:

a public key associated with an execution environment, and

a corresponding private key.

7. The computer-implemented method of claim 6 , wherein the events comprise user requests and user actions.

8. The computer-implemented method of claim 6 , further comprising transmitting the user profile data for remote storage.

9. The computer-implemented method of claim 6 , further comprising receiving the user profile data from a remote source, wherein the execution environment enables updating the user profile data of the encrypted user profile based upon the received user profile data.

10. The computer-implemented method of claim 6 , wherein:

the request includes a pseudonym, and

the process is determined to have the sufficient access permissions when the pseudonym matches a pseudonym associated with the user profile.

11. A non-transitory computer-readable medium containing computer-readable instructions, wherein execution of the computer-readable instructions causes one or more processors to:

update a user profile based upon events recorded in an immutable ledger, wherein the user profile comprises at least one characterization associated with the user profile;

encrypt the updated user profile;

securely storing the encrypted user profile;

receive a request to access the encrypted user profile from a process;

determine access permissions of the process; and

when the process has sufficient access permissions:

decrypt the user profile,

provide user profile data to the process, and

create an append-only area of the user profile data using:

a public key associated with an execution environment, and

a corresponding private key.

12. The non-transitory computer-readable medium of claim 11 , wherein the events comprise user requests and user actions.

13. The non-transitory computer-readable medium of claim 11 , wherein the execution of the computer-readable instructions further causes the one or more processors to transmit the user profile data for remote storage.

14. The non-transitory computer-readable medium of claim 11 , wherein the execution of the computer-readable instructions further causes the one or more processors to receive the user profile data from a remote source, wherein the execution environment enables updating the user profile data of the encrypted user profile based upon the received user profile data.

15. The non-transitory computer-readable medium of claim 11 , wherein:

the request includes a pseudonym, and

the process is determined to have the sufficient access permissions when the pseudonym matches a pseudonym associated with the user profile.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 15, 2022
From: JAKOBSSON, BJORN MARKUS; GERBER, STEPHEN C.; KAPUR, AJAY
To: ARTEMA LABS, INC
Reel/Frame 061111/0336 →
Continuity (5)
Provisional Application 63282211 · Nov 23, 2021
Provisional Application 63279146 · Nov 14, 2021
Provisional Application 63233304 · Aug 15, 2021
Provisional Application 63210040 · Jun 13, 2021
Related Publication 20220398340A1 · Dec 15, 2022
References Cited (127)
US 5754939A · Herz · 1998 [cited by examiner]
US 8543649B2 · Gilmour et al. · 2013 [cited by applicant]
US 8620767B2 · Linden et al. · 2013 [cited by applicant]
US 9143542B1 · Tseytlin · 2015 [cited by applicant]
US 10735192B2 · Kim et al. · 2020 [cited by applicant]
US 10887447B2 · Jakobsson et al. · 2021 [cited by applicant]
US 10909529B2 · Ortiz · 2021 [cited by examiner]
US 10929512B1 · Jakobsson · 2021 [cited by applicant]
US 10936749B2 · Jakobsson · 2021 [cited by applicant]
US 10951435B2 · Jakobsson · 2021 [cited by applicant]
US 10993082B2 · Jakobsson · 2021 [cited by applicant]
US 11017036B2 · Jakobsson · 2021 [cited by applicant]
US 11343107B2 · Främling · 2022 [cited by examiner]
US 11610012B1 · Della Maggiora · 2023 [cited by examiner]
US 20070033414A1 · Dunko · 2007 [cited by applicant]
US 20080034369A1 · Polizzi et al. · 2008 [cited by applicant]
US 20100031335A1 · Handler · 2010 [cited by examiner]
US 20100191919A1 · Bernstein · 2010 [cited by examiner]
US 20110238478A1 · Gottfurcht · 2011 [cited by examiner]
US 20120130812A1 · Ramer et al. · 2012 [cited by applicant]
US 20130007041A1 · Comparelli et al. · 2013 [cited by applicant]
US 20140223573A1 · Reedy et al. · 2014 [cited by applicant]
US 20140359782A1 · Golic · 2014 [cited by examiner]
US 20150019944A1 · Kalgi · 2015 [cited by applicant]
US 20150100488A1 · Dua · 2015 [cited by applicant]
US 20150339020A1 · D'amore et al. · 2015 [cited by applicant]
US 20160050188A1 · Wilson · 2016 [cited by examiner]
US 20160260089A1 · Chen · 2016 [cited by applicant]
US 20160366245A1 · Gupta · 2016 [cited by applicant]
US 20170109839A1 · Berryman · 2017 [cited by applicant]
US 20170250816A1 · Popa · 2017 [cited by examiner]
US 20170277773A1 · Iasi · 2017 [cited by examiner]
US 20180077092A1 · Jalil · 2018 [cited by applicant]
US 20190026730A1 · Moy et al. · 2019 [cited by applicant]
US 20190079950A1 · Ramabaja · 2019 [cited by examiner]
US 20190122152A1 · Mccoy et al. · 2019 [cited by applicant]
US 20190147495A1 · Wilson · 2019 [cited by examiner]
US 20190164153A1 · Agrawal et al. · 2019 [cited by applicant]
US 20190333031A1 · Kravitz · 2019 [cited by applicant]
US 20190356473A1 · Rosenoer et al. · 2019 [cited by applicant]
US 20190362169A1 · Lin et al. · 2019 [cited by applicant]
US 20190394179A1 · Androulaki et al. · 2019 [cited by applicant]
US 20200027117A1 · Cotsakos · 2020 [cited by examiner]
US 20200099530A1 · Khatib et al. · 2020 [cited by applicant]
US 20200117690A1 · Tran et al. · 2020 [cited by applicant]
US 20200151715A1 · Sato et al. · 2020 [cited by applicant]
US 20200184473A1 · Fang et al. · 2020 [cited by applicant]
US 20200200824A1 · Narayanaswami · 2020 [cited by examiner]
US 20200250633A1 · Vinson · 2020 [cited by examiner]
US 20200250719A1 · Shah · 2020 [cited by applicant]
US 20200273048A1 · Andon et al. · 2020 [cited by applicant]
US 20200274712A1 · Gray et al. · 2020 [cited by applicant]
US 20200304289A1 · Androulaki · 2020 [cited by examiner]
US 20200334752A1 · Doney et al. · 2020 [cited by applicant]
US 20200364588A1 · Knox · 2020 [cited by examiner]
US 20200387433A1 · Wang · 2020 [cited by examiner]
US 20210073811A1 · Chan et al. · 2021 [cited by applicant]
US 20210209249A1 · Hoffer · 2021 [cited by applicant]
US 20210209684A1 · Foote · 2021 [cited by examiner]
US 20210377052A1 · Brown · 2021 [cited by applicant]
US 20210390161A1 · Nakadaira et al. · 2021 [cited by applicant]
US 20210406449A1 · Meling · 2021 [cited by applicant]
US 20210406904A1 · Ravinathan · 2021 [cited by applicant]
US 20220020018A1 · Jivanyan et al. · 2022 [cited by applicant]
US 20220129481A1 · Galindo · 2022 [cited by examiner]
US 20220147961A1 · Yoon et al. · 2022 [cited by applicant]
US 20220198524A1 · Wang · 2022 [cited by examiner]
US 20220391887A1 · Jakobsson et al. · 2022 [cited by applicant]
US 20220398538A1 · Jakobsson et al. · 2022 [cited by applicant]
US 20220407702A1 · Jakobsson et al. · 2022 [cited by applicant]
US 20230050944A1 · Martinez De La Cruz · 2023 [cited by examiner]
US 20230055618A1 · Jakobsson et al. · 2023 [cited by applicant]
US 20230385815A1 · Jakobsson et al. · 2023 [cited by applicant]
US 20240086915A1 · Finlow-bates · 2024 [cited by applicant]
EP 3244332B1 · 2019 [cited by applicant]
EP 3582439A1 · 2019 [cited by examiner]
EP 4356307A1 · 2024 [cited by applicant]
EP 4359984A1 · 2024 [cited by applicant]
EP 4388405A1 · 2024 [cited by applicant]
WO 2019193452A1 · 2019 [cited by applicant]
WO 2020090118A1 · 2020 [cited by applicant]
WO 2022178096A1 · 2022 [cited by applicant]
WO 2022261650A2 · 2022 [cited by applicant]
WO 2022266608A1 · 2022 [cited by applicant]
WO 2022266609A1 · 2022 [cited by applicant]
WO 2022272272A1 · 2022 [cited by applicant]
WO 2022261650A3 · 2023 [cited by applicant]
WO 2023028462A1 · 2023 [cited by applicant]
WO 2022272272A9 · 2023 [cited by applicant]
WO 2024059758A1 · 2024 [cited by applicant]
Yongge Wang and Yuliang Zheng; (Fast and Secure Append-Only Storage with Infinite Capacity); pp. 9; Aug. 27 (Year: 2003). [cited by examiner]
Yongge Wang and Yuliang Zheng; “Fast and Secure Append-Only Storage with Infinite Capacity” pp. 9; Published on Aug. 27, 2003. [cited by examiner]
Christian Tschudin; “End-to-end Encrypted Scalable Abstract Data Types over ICN” pp. 7; Published on Sep. 21-23, 2018. [cited by examiner]
Yongge Wang and Yuliang Zheng; (Fast and Secure Append-Only Storage with Infinite Capacity); p. 9; Published on Aug. 27. (Year: 2003). [cited by examiner]
Matteo Maffei, Giulio Malavolta, Manuel Reinert, Dominique Schroder; (Privacy and Access Control for Outsourced Personal Records); p. 18; Published on Jul. 20 (Year: 2015). [cited by examiner]
Randy Baden, Adam Bender, Neil Spring, Bobby Bhattacharjee, and Daniel Starin; (Persona: An Online Social Network with User-Defined Privacy); p. 12; Published on Aug. 16 (Year: 2009). [cited by examiner]
International Preliminary Report on Patentability for International Application PCT/US2022/072829, Report issued Nov. 21, 2023, Mailed on Dec. 21, 2023, 07 Pgs. [cited by applicant]
International Preliminary Report on Patentability for International Application PCT/US2022/072910, Report issued Dec. 14, 2023, Mailed on Dec. 28, 2023, 09 Pgs. [cited by applicant]
International Preliminary Report on Patentability for International Application PCT/US2022/072911, Report issued Dec. 14, 2023, Mailed on Dec. 28, 2023, 08 Pgs. [cited by applicant]
International Preliminary Report on Patentability for International Application PCT/US2022/073098, Report issued Dec. 14, 2023, Mailed on Jan. 4, 2024, 05 Pgs. [cited by applicant]
International Preliminary Report on Patentability for International Application PCT/US2022/075297, Report issued Feb. 27, 2024, Mailed on Mar. 7, 2024, 07 Pgs. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2022/073098, Search completed Aug. 20, 2022, Mailed Sep. 12, 2022, 12 pgs. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2023/074260, Search completed Dec. 8, 2023, Mailed Feb. 9, 2024, 18 Pgs. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2022/072829, Search completed Oct. 12, 2022, Mailed Oct. 26, 2022, 17 pgs. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2022/072910, Search completed Oct. 2, 2022, Mailed Oct. 17, 2022, 16 pgs. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2022/072911, Search completed Aug. 16, 2022, Mailed Oct. 17, 2022, 15 pgs. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2022/075297, Search completed Nov. 25, 2022, Mailed Jan. 3, 2023, 13 Pgs. [cited by applicant]
“Financial Instruments in Recommendation Mechanisms”, Published in FC 2002: Financial Cryptography, 2003, LNCS 2357, pp. 31-43. [cited by applicant]
Adida et al., “Towards Trustworthy Elections—New Directions in Electronic Voting”. [cited by applicant]
Brands et al., “Distance-Bounding Protocols”, Workshop on the Theory and Application of of Cryptographic Techniques Eurocrypt1993: Advances in Cryptology—Eurocrypt '93, First Online: Jul. 13, 2001, pp. 344-359. [cited by applicant]
Camenisch et al., “Signature Schemes and Anonymous Credentials from Bilinear Maps”, Annual International Cryptology Conference Crypto 2004: Advances in Cryptology—Crypto 2004 pp. 56-72. [cited by applicant]
Chaum, , “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms”, Communications of the ACM, Feb. 1981, vol. 24 Issue 2, pp. 84-88. [cited by applicant]
Colberg et al., “SPlaT: A System for Self-Plagiarism Detection”, Published in IADIS International Conference WWW/INTERNET 2003, Algarve, Portugal Nov. 5-8, 2003. [cited by applicant]
Coppersmith et al., “Almost Optimal Hash Sequence Traversal”, Proceedings of the 6th international conference on Financial cryptography, 16pgs. [cited by applicant]
Firsov et al., “BLT+L: Efficient Signatures from Timestamping and Endorsements”. [cited by applicant]
Goldschlag et al., “Onion Routing for Anonymous and Private Internet Connections”, Communications of the ACM, Feb. 1999, 42(2) DOI: 10.1145/293411.293443, 6pgs. [cited by applicant]
Golle et al., “Reusable Anonymous Return Channels”, WPES '03: Proceedings of the 2003 ACM workshop on Privacy in the electronic society Oct. 2003 pp. 94-100. https://doi.org/10.1145/1005140.1005155. [cited by applicant]
Grozea et al., “ENCOPLOT: Pairwise sequence matching in linear time applied to plagiarism detection”, Published in 3rd PAN Workshop. Uncovering Plagiarism, Authorship and Social Software Misuse 2009. [cited by applicant]
Hastad et al., “Funkspiel schemes: an alternative to conventional tamper resistance”, CCS 2000, Proceedings of the 7th ACM Conference on Computer and Communications Security, 2000, 10 pgs. [cited by applicant]
Herzberg et al., “Proactive public key and signature systems”, CCS '97: Proceedings of the 4th ACM conference on Computer and communications security Apr. 1997 pp. 100-110. https://doi.org/10.1145/266420.266442. [cited by applicant]
Jakobsson, , “On Quorum Controlled Asymmetric Proxy Re-encryption”, Lecture Notes in Computer Science, Oct. 1999, vol. 1560: 632-632. DOI:10.1007/3-540-49162-7_9. [cited by applicant]
Jakobsson et al., “Mix and Match: Secure Function Evaluation via Ciphertexts”, Advances in Cryptology—Asiacrypt 2000 pp. 162-177. [cited by applicant]
Micali et al., “A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems”, Annual International Cryptology Conference, Crypto 1995: Advances in Cryptology—Cryp… [cited by applicant]
Munster et al., “People's Expensive NFTs Keep Vanishing. This Is Why”, Obtained online from https://www.vice.com/en/article/pkdj79/peoples-expensive-nfts-keep-vanishing-this-is-why, Mar. 29, 2021, 7 pages. [cited by applicant]
Reiter et al., “Anonymous Web transactions with Crowd”, Communications of the ACM vol. 42 Issue Feb. 2, 1999 pp. 32-48 https://doi.org/10.1145/293411.293778. [cited by applicant]
Weyl et al., “Decentralized Society: Finding Web3's Soul”, Available at SSRN: https://ssrn.com/abstract=4105763, May 10, 2022, 37 pages. [cited by applicant]
Yin et al., “Convolutional neural network for paraphrase identification”, Published in Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Te… [cited by applicant]
Cited By (2)
US 12,401,510 US 12,417,279