COMMUTATIVE ORDER-PRESERVING ENCRYPTION
In one general aspect, a method, including executing instructions recorded on a non-transitory computer-readable storage media using at least one processor, includes encrypting data using a commutative order-preserving encryption scheme. The commutative order-preserving encryption scheme includes a unique fixed key and a regular keyed cryptographic hash function, where the cryptographic hash function includes a domain greater than the unique fixed key.
1 . A method including executing instructions recorded on a non-transitory computer-readable storage media using at least one processor, the method comprising:
encrypting data using a commutative order-preserving encryption scheme.
2 . The method as in claim 1 wherein the commutative order-preserving encryption scheme comprises a unique fixed key and a regular keyed cryptographic hash function, wherein the cryptographic hash function comprises a domain greater than the unique fixed key.
3 . The method as in claim 2 wherein a bit length of the cryptographic hash function is at least three times as long as a bit length of the data.
4 . The method as in claim 2 wherein the unique fixed key is distributed in multiple portions among multiple parties.
5 . The method as in claim 2 wherein the unique fixed key is distributed in multiple portions among multiple parties in a tree format from an event source to an event processing engine.
6 . The method as in claim 1 wherein the commutative order-preserving encryption scheme is represented by an encryption function
E ( x )= ax+H ( x )= ax+b
wherein
E(x) is the encryption function,
a is a unique fixed key,
H(x) is a regular keyed cryptographic hash function
x is plaintext, and
b is a random summand.
7 . The method as in claim 1 further comprising using the commutative order-preserving encryption scheme as part of a blind encryption protocol.
8 . A recordable storage medium having recorded and stored thereon instructions that, when executed, cause at least one processor to perform the action of:
encrypting data using a commutative order-preserving encryption scheme.
9 . The recordable storage medium of claim 8 wherein the commutative order-preserving encryption scheme comprises a unique fixed key and a regular keyed cryptographic hash function, wherein the cryptographic hash function comprises a domain greater than the unique fixed key.
10 . The recordable storage medium of claim 9 wherein a bit length of the cryptographic hash function is at least three times as long as a bit length of the data.
11 . The recordable storage medium of claim 9 wherein the unique fixed key is distributed in multiple portions among multiple parties.
12 . The recordable storage medium of claim 9 wherein the unique fixed key is distributed in multiple portions among multiple parties in a tree format from an event source to an event processing engine.
13 . The recordable storage medium of claim 8 wherein the commutative order-preserving encryption scheme is represented by an encryption function
E ( x )= ax+H ( x )= ax+b
wherein
E(x) is the encryption function,
a is a unique fixed key,
H(x) is a regular keyed cryptographic hash function
x is plaintext, and
b is a random summand.
14 . The recordable storage medium of claim 8 further comprising instructions that, when executed, cause at least one processor to perform the action of using the commutative order-preserving encryption scheme as part of a blind encryption protocol.
15 . A system for encrypting date, the system comprising:
a processor that is arranged and configured to encrypt data using a commutative order-preserving encryption scheme.
16 . The system of claim 15 wherein the commutative order-preserving encryption scheme comprises a unique fixed key and a regular keyed cryptographic hash function, wherein the cryptographic hash function comprises a domain greater than the unique fixed key.
17 . The system of claim 16 wherein a bit length of the cryptographic hash function is at least three times as long as a bit length of the data.
18 . The system of claim 16 wherein the unique fixed key is distributed in multiple portions among multiple parties.
19 . The system of claim 16 wherein the unique fixed key is distributed in multiple portions among multiple parties in a tree format from an event source to an event processing engine.
20 . The system of claim 16 wherein the commutative order-preserving encryption scheme is represented by an encryption function
E ( x )= ax+H ( x )= ax+b
wherein
E(x) is the encryption function,
a is a unique fixed key,
H(x) is a regular keyed cryptographic hash function
x is plaintext, and
b is a random summand.