Known algorithms for dense k-SUM and k-XOR are essentially optimal, supported by self-reduction and obfuscation techniques.
Known algorithms for dense k-SUM and k-XOR are essentially optimal for specific cases, supported by a self-reduction method.
The encryption scheme proposed by Sanyashi et al. for privacy-preserving k-NN computation on the cloud is vulnerable to a ciphertext-only attack (COA).