Granted Patent B2

US 12,386,976 · App. 17/937,926 · Granted Aug 12, 2025

Inventors: Igor Stolbikov (Apex, NC); Chunling Han (Beijing, CN); Christian De Hoyos (Morrisville, NC); Scott Wentao Li (Cary, NC)

Assignee: Lenovo (Singapore) Pte. Ltd.

G06F21/577G06F2221/034

Abstract

Claims (48)

1. A process to manage web page content comprising:

maintaining an auditable log of trust verification relating to the web page content;

receiving an attestation of a source of the web page content, the attestation relating to a security practice of the source, computer code provided by the source, a reputation of the source, and a history of the source; and

applying a modified version of a Verkle Tree to the auditable log and the attestation of the source;

wherein the modified version of the Verkle Tree comprises a Pedersen commitment, an indexing capability, and a search capability;

wherein the Pedersen commitment comprises a homomorphic addition and subtraction property;

wherein the homomorphic addition and subtraction property comprises:

a first value comprising a value1 and a value2; and

a second value comprising a value3 and a value4;

wherein the addition property comprises a commitment to value1+value3 or value2+value4; and

wherein the subtraction property comprises a commitment to value1−value3 or value2−value4.

2. The process of claim 1 , wherein the maintaining of the auditable log permits an append operation and prohibits a modify operation.

3. The process of claim 1 , wherein the attestation of the source comprises a content hash for each version of the computer code.

4. The process of claim 1 , wherein the attestation relates to one or more of a vulnerability of the computer code, a license condition of the computer code, a security policy associated with the computer code, and a reputation of the source.

5. The process of claim 1 , wherein the auditable log is publicly available, thereby permitting a third party to verify correctness of the auditable log and to monitor when new content is added to the auditable log.

6. The process of claim 1 , wherein the Pedersen commitment is a function of elliptic curve cryptography and an elliptic curve discrete logarithm.

7. The process of claim 1 , wherein the Pedersen commitment comprises searchable indexes related to one or more of a name of the web page content, a URL repository for the web page content, the source of the web page content, an organization associated with the web page content, and a version number of the web page content.

8. A non-transitory machine-readable medium comprising instructions that when executed by a processor execute a process to manage web page content, the process comprising:

maintaining an auditable log of trust verification relating to the web page content;

receiving an attestation of a source of the web page content, the attestation relating to a security practice of the source, computer code provided by the source, a reputation of the source, and a history of the source; and

applying a modified version of a Verkle Tree to the auditable log and the attestation of the source;

wherein the modified version of the Verkle Tree comprises a Pedersen commitment, an indexing capability, and a search capability;

wherein the Pedersen commitment comprises a homomorphic addition and subtraction property;

wherein the homomorphic addition and subtraction property comprises:

a first value comprising a value1 and a value2; and

a second value comprising a value3 and a value4;

wherein the addition property comprises a commitment to value1+value3 or value2+value4; and

wherein the subtraction property comprises a commitment to value1−value3 or value2−value4.

9. The non-transitory machine-readable medium of claim 8 , wherein the maintaining of the auditable log permits an append operation and prohibits a modify operation.

10. The non-transitory machine-readable medium of claim 8 , wherein the attestation of the source comprises a content hash for each version of the computer code.

11. The non-transitory machine-readable medium of claim 8 , wherein the attestation relates to one or more of a vulnerability of the computer code, a license condition of the computer code, a security policy associated with the computer code, and a reputation of the source.

12. The non-transitory machine-readable medium of claim 8 , wherein the auditable log is publicly available, thereby permitting a third party to verify correctness of the auditable log and to monitor when new content is added to the auditable log.

13. The non-transitory machine-readable medium of claim 8 , wherein the Pedersen commitment is a function of elliptic curve cryptography and an elliptic curve discrete logarithm.

14. The non-transitory machine-readable medium of claim 8 , wherein the Pedersen commitment comprises searchable indexes related to one or more of a name of the web page content, a URL repository for the web page content, the source of the web page content, an organization associated with the web page content, and a version number of the web page content.

15. A system comprising:

a computer processor; and

a memory coupled to the computer processor,

wherein the computer processor and the memory are operable for managing web page content by:

maintaining an auditable log of trust verification relating to the web page content;

receiving an attestation of a source of the web page content, the attestation relating to a security practice of the source, computer code provided by the source, a reputation of the source, and a history of the source; and

applying a modified version of a Verkle Tree to the auditable log and the attestation of the source;

wherein the modified version of the Verkle Tree comprises a Pedersen commitment, an indexing capability, and a search capability;

wherein the Pedersen commitment comprises a homomorphic addition and subtraction property;

wherein the homomorphic addition and subtraction property comprises:

a first value comprising a value1 and a value2; and

a second value comprising a value3 and a value4;

wherein the addition property comprises a commitment to value1+value3 or value2+value4; and

wherein the subtraction property comprises a commitment to value1−value3 or value2−value4.

Assignments (2)

Continuity (1)

References Cited (12)