| 研究実績の概要 |
We present a more practical and non-interactive comparison protocol for ciphertexts of small domain integers, e.g., range in [0, 2^13). Our comparison protocol uses only one homomorphic multiplication to compare two ciphertext, which is about 45xー75x times faster than the existing homomorphic encryption-based solutions.
The second paper focuses on the matrix multiplication on encrypted matrices. We present a band new packing, double packing, for batching the inner products of K encrypted vectors, where K is about 100. On top of the double packing, we present a communication efficient and computation fast matrix multiplication protocol, which is about 10x faster than the existing HE-based methods and consumes only 1/40 commutation bandwidth of its OT-based counterparts.
|
