Systems and methods for the generation and use of session keys supporting secure communications between a client and server device are disclosed. The client device has or receives a password, which it hashes a predetermined first number of times. The hashed password is sent as a message digest to a server. The server applies the hashed password to a an array of PUF devices, and receives a response bitstream which is stored. The client later hashes the password a second predetermined number of times, which is less than the first predetermined number, and this second message digest is sent to the server. The server continues to hash the second message digest, generate PUF responses, and compare the result to the initially stored responses. The number of hashes necessary to achieve a match is the session key.

A system is provided for end-to-end electronic data encryption using an intelligent homomorphic encrypted privacy screen. In particular, the system may be configured to use homomorphic encryption on sensitive data displayed on a screen of a computing device. An augmented reality (“AR”) device may be used (e.g., a user) with the privacy screen such that the sensitive data that appears on the screen may be selectively decrypted. In this way, an authorized user may be able to view and interact with the encrypted data whereas an unauthorized user may not.

Computation efficiency of distributed secure implementation of the computation of a (sum of) products of values Vi, Wi from different servers on a distributed computing system is improved by generation of coefficients of a first and second polynomials P, Q by a first server. The first polynomial P has all numbers Xi from a first data set on the first server as roots. The second polynomial Q has values Q(Xi)=Vi for the numbers Xi from the first data set. The first server transmits coefficients of the polynomials to a second server in encrypted form. The second sever computes encrypted values <P(Xi′)> and <Q(Xi′)> of the polynomials for a number Xi′ in a second set from the encrypted coefficients. The second server computes an encrypted binary value <di> from the encrypted value <p(Xi′) of the first polynomial p and computes an encrypted value of a product <di Q(Xi′) Wi>.

Computer-implemented systems and methods are disclosed herein for use within secure multi-party computation. A system and method are used for storing an operation preference and a cryptographic preference. A data set is stored based on the operation preference and the cryptographic preference. A determination is made that processing the query involves performing an allowable operation on the data set based on the operation preference.

A method for maintaining user privacy in advertisement networks may include receiving first persona data associated with a first user from at least one publisher system. The first persona data may be generalized to form first generalized persona data. A session key may be generated. The first generalized persona data and the session key may be encrypted with a first public key of an advertisement network system to form a first ciphertext. The first ciphertext and first user identity data may be communicated to a mediator system. The first user identity data may be associated with first user's identity. A first encrypted targeted advertisement may be received based on the first generalized persona data from the advertisement network system via the mediator system. The first encrypted targeted advertisement may be decrypted with the session key to form a first targeted advertisement. A system and computer program product are also disclosed.

The disclosed exemplary embodiments include computer-implemented systems, apparatuses, and processes that perform homomorphic computations on encrypted third-party data within a distributed computing environment. For example, an apparatus receives a homomorphic public key and encrypted transaction data characterizing an exchange of data from a computing system, and encrypts modelling data associated with a first predictive model using the homomorphic public key. The apparatus may perform homomorphic computations that apply the first predictive model to the encrypted transaction data in accordance with the encrypted first modelling data, and transmit an encrypted first output of the homomorphic computations to the computing system, which may decrypt the encrypted first output using a homomorphic private key and generate decrypted output data indicative of a predicted likelihood that the data exchange represents fraudulent activity.

In order to provide an information matching system achieving an information matching scheme that takes a lower cost and uses secure biometric information, the information matching system includes a concealment apparatus, a decryption apparatus, and a similarity calculating apparatus. The concealment apparatus transmits, to the similarity calculating apparatus, concealed information including information concealing obtained matching information by linear conversion using random numbers. The similarity calculating apparatus calculates, from obtained one or more pieces of registration information and the concealed information received from the concealment apparatus, a concealed similarity which is a value concealing a similarity between the matching information and the registration information, and to transmit the calculated concealed similarity to the decryption apparatus. The decryption apparatus calculates the similarity between the matching information and the registration information from the concealed similarity received from the similarity calculating apparatus, using the random numbers used by the concealment apparatus.

A system and a method for digital proof generation are provided. The system includes a data management module to manage dataset having plurality of data rows and a query execution and verification module including a commitment storage sub-module, a query execution sub-module and a result verification sub-module. The data management module receives query from the query execution sub-module, related to operation on data rows of plurality of data rows, which is processed to generate execution result associated with data rows. The execution result is transferred along with data rows to the query execution sub-module. A set of commitments associated with execution result is transferred to the commitment storage sub-module. The query execution sub-module transfers set of commitments, from the commitment storage sub-module, and data rows to the result verification sub-module for verification, and receives a verification result from the result verification sub-module.

In a method of generating a secret key according to an embodiment, a share of each of a user and a plurality of other users for a secret key of the user are generated, the share of each of the plurality of other users is provided to a user terminal of each of the plurality of other users, a share of the user for a secret key of each of the plurality of other users is received from the user terminal of each of the plurality of other users, and a new secret key of the user is generated using the share of the user for the secret key of the user and the shares of the user for the secret key of each of the plurality of other users.

A confidentiality preserving system and method for performing a rank-ordered search and retrieval of contents of a data collection. The system includes at least one computer system including a search and retrieval algorithm using term frequency and/or similar features for rank-ordering selective contents of the data collection, and enabling secure retrieval of the selective contents based on the rank-order. The search and retrieval algorithm includes a baseline algorithm, a partially server oriented algorithm, and/or a fully server oriented algorithm. The partially and/or fully server oriented algorithms use homomorphic and/or order preserving encryption for enabling search capability from a user other than an owner of the contents of the data collection. The confidentiality preserving method includes using term frequency for rank-ordering selective contents of the data collection, and retrieving the selective contents based on the rank-order.