We have shown that our protocol is secure in the presence of a malicious cloud and semi-honest clients. Its communication and computation complexity is linear ...

Mar 1, 2022 · The computation complexity of these multi-party protocols is quadratic in the size of the input sets and linear in the number of the parties ...

Dec 31, 2021 · coupled the prime representation (PR) technology with threshold additive HE and realized an mPSI protocol [25] with linear complexity for the ...

... linear sender-to-receiver communication overhead, linear computational complexity, along with receiver size-hiding and lightweight computation cost. In ...

Tsudik, Linear-complexity private set intersection protocols secure in malicious model, Adv. in Cryptology - ASIACRYPT, Springer, (2010), 213-231. [16], E ...

Secure Outsourced Private Set Intersection with Linear Complexity · Sumit Kumar DebnathK. SakuraiKunal DeyNibedita Kundu. Computer Science, Mathematics. 2021 ...

We measure the protocol's overhead and show that computational complexity is considerably reduced and also is fairer compared to the previous scheme. Keywords— ...

VD-PSI: Verifiable delegated private set intersection on outsourced private ... Linear-complexity private set intersection protocols secure in malicious model.

They also introduce a thresh- old PSI [21] but do not provide a security analysis. Their computational complexity is linear in the number of items in the ...

May 4, 2012 · In this paper we present a novel protocol that has linear complexity, is secure in the malicious model without random oracles, is client set ...