Order-Preserving Encryption Using Approximate Integer Common Divisors

We present an order-preserving encryption (OPE) scheme based on the general approximate common divisor problem (GACDP). This scheme only requires O (1) arithmetic operations for encryption and decryption. We have performed extensive evaluation of our algorithms by comparing execution times against those of other OPE schemes.