IP Library Granted Patent US 11,455,403
Granted Patent B2
US 11,455,403 · App. 16/747,514 · Granted Sep 27, 2022

Privacy-preserving document sharing

Inventors: Yedendra Shrinivasan (Yorktown Heights, NY); Krishna Chaitanya Ratakonda (Yorktown Heights, NY); Teja Chiranjeevi Tummalapalli (Morrisville, NC); Mari M. Wade (Cary, NC); Atallah Hezbor (Durham, NC)
Assignee: International Business Machines Corporation
G06F21/602H04L9/0822H04L9/0836H04L9/14H04L9/3242H04L63/0435H04L9/50H04L2209/24
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 11,455,403
App. No.
16/747,514
Granted
Sep 27, 2022
Kind
B2
Abstract

An example operation may include one or more of receiving, by a document processor node, a document comprising a document identifier (ID) and a document type, generating, by the document processor node, at least one hashed attribute for sharing of the document based on the document ID and the document type, acquiring, by the document processor node, a list of documents and corresponding document owners to be linked to the document based on the at least one hashed attribute, and creating a plurality of linked documents based on the list of the documents.

Claims (50)

1. A node in a blockchain network, the node comprising:

a hardware processor that when executing one or more instructions stored in a memory is configured to:

receive a document comprising a document identifier (ID) and a document type;

generate at least one hashed attribute for sharing of the document based on the document ID and the document type;

acquire, based on the at least one hashed attribute, a list of documents and corresponding document owners to be linked to the document; and

create a plurality of linked documents based on the list of the documents.

2. The node of claim 1 , wherein the processor is further configured to:

generate a hashed owner organization ID for the document.

3. The node of claim 2 , wherein the processor is further configured to:

form a composite key based on the at least one hashed attribute and the hashed owner organization ID.

4. The node of claim 3 , wherein the processor is further configured to:

retrieve the at least one hashed attribute associated with the document based on the composite key.

5. The node of claim 3 , wherein the processor is further configured to:

retrieve IDs of documents in the list of documents and a corresponding hashed owner organization ID based on the composite key.

6. The node of claim 1 , wherein, in response to a document owner organization ID and a plurality of owner organization IDs belonging to a partnership Merkle tree, the processor is further configured to:

acquire a plurality of templates for logic matching for a subset of documents belonging to the document owner organization ID based on an organization relationship.

7. The node of claim 6 , wherein, when the processor is configured to acquire the list of the documents and the corresponding document owners, the processor is further configured to:

acquire the list of the documents and the corresponding document owners based on the logic matching.

8. A method, comprising:

receiving, by a document processor node, a document comprising a document identifier (ID) and a document type;

generating, by the document processor node, at least one hashed attribute for sharing of the document based on the document ID and the document type;

acquiring, by the document processor node and based on the at least one hashed attribute, a list of documents and corresponding document owners to be linked to the document; and

creating a plurality of linked documents based on the list of the documents.

9. The method of claim 8 , further comprising:

generating a hashed owner organization ID for the document.

10. The method of claim 9 , further comprising:

forming a composite key based on the at least one hashed attribute and the hashed owner organization ID.

11. The method of claim 10 , further comprising:

retrieving the at least one hashed attribute associated with the document based on the composite key.

12. The method of claim 10 , further comprising:

retrieving IDs of documents in the list of documents and a corresponding hashed owner organization ID based on the composite key.

13. The method of claim 8 , wherein, in response to a document owner organization ID and a plurality of owner organization IDs belonging to a partnership Merkle tree, the method further comprises:

acquiring a plurality of templates for logic matching for a subset of documents belonging to the document owner organization ID based on an organization relationship.

14. The method of claim 13 , wherein the acquiring the list of the documents and the corresponding document owners further comprises:

acquiring the list of the documents and the corresponding document owners based on the logic matching.

15. A non-transitory computer readable medium comprising one or more instructions that when executed by a processor cause the processor to perform:

receiving a document comprising a document identifier (ID) and a document type;

generating at least one hashed attribute for sharing of the document based on the document ID and the document type;

acquiring, based on the at least one hashed attribute, a list of documents and corresponding document owners to be linked to the document; and

creating a plurality of linked documents based on the list of the documents.

16. The non-transitory computer readable medium of claim 15 , wherein the one or more instructions further cause the processor to perform:

generating a hashed owner organization ID for the document.

17. The non-transitory computer readable medium of claim 16 , wherein the one or more instructions further cause the processor to perform:

forming a composite key based on the at least one hashed attribute and the hashed owner organization ID.

18. The non-transitory computer readable medium of claim 17 , wherein the one or more instructions further cause the processor to perform:

retrieving the at least one hashed attribute associated with the document based on the composite key.

19. The non-transitory computer readable medium of claim 15 , wherein, in response to a document owner organization ID and a plurality of owner organization IDs belonging to a partnership Merkle tree, the one or more instructions further cause the processor to perform:

acquiring a plurality of templates for logic matching for a subset of documents belonging to the document owner organization ID based on an organization relationship.

20. The non-transitory computer readable medium of claim 19 , wherein the acquiring the list of the documents and the corresponding document owners further comprises:

acquiring the list of the documents and the corresponding document owners to be linked to the document based on the logic matching.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 20, 2020
From: SHRINIVASAN, YEDENDRA; RATAKONDA, KRISHNA CHAITANYA; TUMMALAPALLI, TEJA CHIRANJEEVI; WADE, MARI M.; HEZBOR, ATALLAH
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 051559/0662 →
Continuity (1)
Related Publication 20210224404A1 · Jul 22, 2021
Cited By (2)
US 12,452,066 US 12,609,917