US 2020/0026867 A1 · SECURE COMPARISON OF INFORMATION

Abstract

The technology encompasses new uses of already-known cryptographic techniques. The technology entails computer-based methods of sharing information securely, in particular an asymmetric method of secure computation that relies on the private-key/public key paradigm with homomorphic encryption. The methods and programmed computing apparatuses herein harness mathematical concepts and apply them to services or tasks that are commercially useful and that have not hitherto been possible. Applications of the methods and apparatus herein are far-ranging and include, but are not limited to: purchase-sale transactions such as real estate or automobiles, where some aspect of price negotiation is expected; stock markets; legal settlements; salary negotiation; auctions, and other types of complex financial transactions.

Claims21

Dependent claims

(canceled)

A method of comparing a first bid from a first party and a second bid from a second party without revealing the first and second bids themselves, the method comprising:

The first party creates a first fingerprint from the first bid;
The second party creates a second fingerprint from the second bid, wherein the second bid represents an acceptable bid for the second party;
The first party generates a first GM key with associated first public GM key and private GM key;
The second party generates a second GM key with associated second public GM key and private GM key;
The first party encrypts the first fingerprint with the first public GM key to create a first encrypted first fingerprint;
The second party encrypts the second fingerprint with the second public GM key to create a second encrypted second fingerprint;
The first party sends the first public GM key to the second party;
The second party sends the second public GM key to the first party;
The first party encrypts the first fingerprint with the second public GM key to create a second encrypted first fingerprint;
The second party encrypts the second fingerprint with the first public GM key to create a first encrypted second fingerprint;
The first party sends the first encrypted first fingerprint to the second party;
The second party sends the second encrypted second fingerprint to the first party;
The first party performs an XOR operation on the second encrypted first fingerprint and the first encrypted second fingerprint, thereby creating a second encrypted fingerprint XOR;
The second party performs an XOR operation on the first encrypted first fingerprint and the first encrypted second fingerprint, thereby creating a second encrypted fingerprint XOR;
The first party scrambles the first encrypted fingerprint XOR, thereby creating a scrambled first encrypted fingerprint XOR;
The second party scrambles the second encrypted fingerprint XOR, thereby creating a scrambled second encrypted fingerprint XOR;
The first party generates a first RSA Keys and associated first public RSA key and private RSA key;
The second party generates a second set of RSA key and associated second public RSA key and private RSA key;
The first party then encrypts the scrambled first encrypted fingerprint XOR with the first public RSA key, thereby creating a doubly scrambled first encrypted fingerprint XOR;
The second party then encrypts the scrambled second encrypted fingerprint XOR with the second public RSA key, thereby creating a doubly scrambled second encrypted fingerprint XOR;
The first party sends the doubly encrypted first scrambled fingerprint XOR to the second party;
The second party sends the doubly encrypted second scrambled fingerprint XOR to the first party;
The first party sends the first private RSA key to the second party;
The second party sends the second private RSA key to the first party;
and
The second party decrypts the doubly encrypted first scrambled fingerprint XOR with the first private RSA key, and counts the number of bits in the scrambled first encrypted fingerprint XOR by further decrypting with the second private GM key;
and
The second party compares the first and the second bids based on the bit count.

25 more elements

A non-transitory computer-readable medium having executable instructions to cause one or more processing units to perform a method of comparing a first bid from a first party and an second bid from a second party without revealing the first and second bids themselves, the method comprising:

The first party creates a first fingerprint from the first bid;
The second party creates a second fingerprint from the second bid, wherein the second bid represents an acceptable bid for the second party;
The first party generates a first GM key with associated first public GM key and private GM key;
The second party generates a second GM key with associated second public GM key and private GM key;
The first party encrypts the first fingerprint with the first public GM key to create a first encrypted first fingerprint;
The second party encrypts the second fingerprint with the second public GM key to create a second encrypted second fingerprint;
The first party sends the first public GM key to the second party;
The second party sends the second public GM key to the first party;
The first party encrypts the first fingerprint with the second public GM key to create a second encrypted first fingerprint;
The second party encrypts the second fingerprint with the first public GM key to create a first encrypted second fingerprint;
The first party sends the first encrypted first fingerprint to the second party;
The second party sends the second encrypted second fingerprint to the first party;
The first party performs an XOR operation on the second encrypted first fingerprint and the first encrypted second fingerprint, thereby creating a second encrypted fingerprint XOR;
The second party performs an XOR operation on the first encrypted first fingerprint and the first encrypted second fingerprint, thereby creating a second encrypted fingerprint XOR;
The first party scrambles the first encrypted fingerprint XOR, thereby creating a scrambled first encrypted fingerprint XOR;
The second party scrambles the second encrypted fingerprint XOR, thereby creating a scrambled second encrypted fingerprint XOR;
The first party generates a first RSA Keys and associated first public RSA key and private RSA key;
The second party generates a second set of RSA key and associated second public RSA key and private RSA key;
The first party then encrypts the scrambled first encrypted fingerprint XOR with the first public RSA key, thereby creating a doubly scrambled first encrypted fingerprint XOR;
The second party then encrypts the scrambled second encrypted fingerprint XOR with the second public RSA key, thereby creating a doubly scrambled second encrypted fingerprint XOR;
The first party sends the doubly encrypted first scrambled fingerprint XOR to the second party;
The second party sends the doubly encrypted second scrambled fingerprint XOR to the first party;
The first party sends the first private RSA key to the second party;
The second party sends the second private RSA key to the first party;
and
The second party decrypts the doubly encrypted first scrambled fingerprint XOR with the first private RSA key, and counts the number of bits in the scrambled first encrypted fingerprint XOR by further decrypting with the second private GM key;
and
The second party compares the first and the second bids based on the bit count.

25 more elements

A computer apparatus to generate for a first party and a second party to securely exchange bids, the computer apparatus comprising:

at least one processor;
a memory coupled to the processor though a bus;
and
a process executed from the memory by the processor that causes the processor to creates a second fingerprint from the second bid, wherein the second bid represents an acceptable bid for the second party, generates a second GM key with associated second public GM key and private GM key, encrypts the second fingerprint with the second public GM key to create a second encrypted second fingerprint, receive a first public GM key from the first party, sends the second public GM key to a first party, encrypts the second fingerprint with the first public GM key to create a first encrypted second fingerprint, receive first encrypted first fingerprint from the first party, sends the second encrypted second fingerprint to the first party, performs an XOR operation on the first encrypted first fingerprint and the first encrypted second fingerprint, thereby creating a second encrypted fingerprint XOR, scrambles the second encrypted fingerprint XOR, thereby creating a scrambled second encrypted fingerprint XOR, generates a second set of RSA key and associated second public RSA key and private RSA key, encrypts the scrambled second encrypted fingerprint XOR with the second public RSA key, thereby creating a doubly scrambled second encrypted fingerprint XOR, receive a doubly encrypted first scrambled fingerprint XOR from the first party, sends the doubly encrypted second scrambled fingerprint XOR to the first party, receive a first private RSA key from the first party, sends the second private RSA key to the first party, decrypts the doubly encrypted first scrambled fingerprint XOR with the first private RSA key, and counts the number of bits in the scrambled first encrypted fingerprint XOR by further decrypting with the second private GM key, and compares the first and the second bids based on the bit count.

1 more element

Dependencies are inferred from the claim text.

Secure comparison of information

Life of this patent

Secure comparison of information

Life of this patent

Abstract

Claims21