9 citations · 14 across the 5 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CR2017★ 2 cited
Order-Preserving Encryption Using Approximate Integer Common Divisors
James Dyer, Martin Dyer, Jie Xu
We present a new, but simple, randomised order-preserving encryption (OPE) scheme based on the general approximate common divisor problem (GACDP). This appears to be the first OPE…
cs.CR2017★ 2 cited
Practical Homomorphic Encryption Over the Integers
James Dyer, Martin Dyer, Jie Xu
We present novel homomorphic encryption schemes for integer arithmetic, intended for use in secure single-party computation in the cloud. These schemes are capable of securely comp…