ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI

Chandran, N and Dasgupta, N and Gupta, D and Obbattu, SLB and Sekar, S and Shah, A (2021) Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI. In: 27th ACM Annual Conference on Computer and Communication Security, CCS 2021, 15-19 Nov 2021, Virtual, Online, pp. 1182-1204.

CCS_2021.pdf - Published Version

Download (2MB) | Preview
Official URL: https://doi.org/10.1145/3460120.3484591


Multiparty Private Set Intersection (mPSI), enables n parties, each holding private sets (each of size m) to securely compute the intersection of these private sets. While several protocols are known for this task, the only concretely efficient protocol is due to the work of Kolesnikov et al. (KMPRT, CCS 2017), who gave a semi-honest secure protocol with communication complexity O(nmt), where t < n is the number of corrupt parties and is the security parameter. In this work, we make the following contributions: -First, for the natural adversarial setting of semi-honest honest majority (i.e. t<n/2), we asymptotically improve upon the above result and provide a concretely efficient protocol with total communication of O(nm). -Second, concretely, our protocol has 6(t+2)/5 times lesser communication than KMPRT and is up to 5� and 6.2� faster than KMPRT in the LAN and WAN setting even for 15 parties. -Finally, we introduce and consider two important variants of mPSI - circuit PSI (that allows the parties to compute a function over the intersection set without revealing the intersection itself) and quorum PSI (that allows P1 to learn all the elements in his/her set that are present in at least k other sets) and provide concretely efficient protocols for these variants. © 2021 ACM.

Item Type: Conference Paper
Publication: Proceedings of the ACM Conference on Computer and Communications Security
Publisher: Association for Computing Machinery
Additional Information: The copyright for this article belongs to Authors
Keywords: Concretes; Cryptography, Communication complexity; Efficient protocols; Intersection sets; Learn+; Private set intersection; Secure multi-party computation; Secure protocols; Security parameters; Set intersection; Several protocols, Timing circuits
Department/Centre: Division of Physical & Mathematical Sciences > Mathematics
Date Deposited: 21 Dec 2021 05:53
Last Modified: 21 Dec 2021 05:53
URI: http://eprints.iisc.ac.in/id/eprint/70700

Actions (login required)

View Item View Item