Abstract:
A method and system for a multi-user searchable encryption system over ordered keywords is disclosed. The system includes a key generation server which issues a primary key to a user terminal device and a secondary key to a proxy server. A trapdoor is sent by the user terminal and received by the proxy server. The trapdoor is encrypted at the proxy server. The proxy server receives cypher text from the user terminal and sends the cypher text to the database server. A search keyword inputted by the user at the user terminal is used to perform a lookup in encrypted data.
Abstract:
A method and system for performing an approximate optimization for solving a global optimization task, comprising of receiving data representing one or more global task objectives performing an optimization technique to cause transition of the global optimization task from a first Hamiltonian state towards a second Hamiltonian state identifying, through a machine learning model, an equation/algorithm to obtain a solution to the global optimization task in the quantum domain, wherein the identification is based on clustering equation/algorithm trained with predefined types of decision variables.
Abstract:
The present invention relates to a computer-implemented method, system and computer readable medium for searching over encrypted keywords in a database. The method includes the steps of generating at least one keyword, generating a plurality of different encrypted keywords corresponding to the keyword, storing the at least one encrypted keyword in the database, generating a plurality of different trapdoors for the keyword, verifying the plurality of different trapdoors with the plurality of different encrypted keywords corresponding to the keyword, and determining the keyword is found if the plurality of different trapdoors match with one the encrypted keyword corresponding to the keyword, otherwise determining the keyword is not found.
Abstract:
A method of enhanced hybrid quantum-classical computing mechanism for solving optimization problems is disclosed comprising altering a value of a configuration chromosome by storing an angle memory on a shared classical memory. The angle memory corresponds to a predefined configuration chromosome. The method then generates a state vector based on the angle memory and reinitializes a quantum circuit from the state vector. Subsequently, generating at least two most probable configuration chromosome from the reinitialized quantum circuit corresponding to a superposition of qubits in a position chromosome. Subsequently selecting one of the at least two most probable configuration chromosomes for each position chromosome after evaluation by a fitness function.
Abstract:
An embodiment for securely accessing services of a service provider based on single sign on. The user device is authenticated by an authentication server if the computed hash of the first random number r is same as the received hash of the first random number r sent by a user device. Thereafter, the second random number y, the user id and an element Q are encrypted using a service provider password and send to the service provider. The user device computes a first discrete exponential function Z using the element Q and the second random number y and sends along with the user id to the service provider. The service provider computes a second discrete exponential function Z′ using the element Q and the second random number y received from the authentication server and provides the user device access to the services if Z is equal to Z′.
Abstract:
An embodiment for securely accessing services of a service provider based on single sign on. The user device is authenticated by an authentication server if the computed hash of the first random number r is same as the received hash of the first random number r sent by a user device. Thereafter, the second random number y, the user id and an element Q are encrypted using a service provider password and send to the service provider. The user device computes a first discrete exponential function Z using the element Q and the second random number y and sends along with the user id to the service provider. The service provider computes a second discrete exponential function Z′ using the element Q and the second random number y received from the authentication server and provides the user device access to the services if Z is equal to Z′.
Abstract:
A method and system for a multi-user searchable encryption system over ordered keywords is disclosed. The system includes a key generation server which issues a primary key to a user terminal device and a secondary key to a proxy server. A trapdoor is sent by the user terminal and received by the proxy server. The trapdoor is encrypted at the proxy server. The proxy server receives cypher text from the user terminal and sends the cypher text to the database server. A search keyword inputted by the user at the user terminal is used to perform a lookup in encrypted data.
Abstract:
The present invention relates to a computer-implemented method, system and computer readable medium for providing a searching over encrypted keywords in a database. The method comprises the steps of generating at least one keyword, generating a plurality of different encrypted keywords corresponding to said keyword, storing said at least one encrypted keyword in said database; generating a plurality of different trapdoors for said keyword, verifying said plurality of different trapdoors with said plurality of different encrypted keywords corresponding to said keyword and determining said keyword if said plurality of different trapdoors match with one said encrypted keyword corresponding to said keyword else determining said keyword is not found.