International Business Machines Corporation

Prashant V Mestri

Rinkesh I Bansal

Mahesh Shivram Paradkar

Mohit Niranjan Agrawal

Radha Shridhar Marathe

Neha Tirumalasetti

Amrin Maria Khan Adawadkar

Aaliyah Ahmed

Vedangi Rajesh Kirtane

Varsharani Hawanna

An approach is disclosed that receives a request from a requestor over a computer network, the request including a set of encrypted user data that includes interest vectors pertaining to a set of users. A homomorphic encryption processing of the encrypted user data is performed using a distance function that utilizes an encrypted lookup table. This results in a set of distance results. An encrypted distance array is then generated from the distance results. The encrypted distance array describes similarities between the users in the set of encrypted data. A set of encrypted recommendations are returned to the requestor. The recommendations returned are derived from the encrypted distance array.

Recommendation engine using fully homomorphic encryption

A key management protocol (such as KMIP) is extended to provide an extended credential type that enables an initiating (first) client device to create a credential dynamically and that can then be selectively shared with and used by other (second) client devices. Using a dynamically-created credential of this type, the other (second) devices are able to fetch the same key configured by the initiating (first) device. In this manner, multiple devices are able to create and share one or more keys among themselves dynamically, and on as-needed basis without requiring a human administrator to create a credential for a device group in advance of its usage.

Creating a credential dynamically for a key management protocol

Growing community of inventors

Maharashtra, India

Prashant V Mestri