Private Certifier Intersection
Bishakh Chandra Ghosh, Sikhar Patranabis, Dhinakaran Vinayagamurthy, Venkatraman Ramakrishna, Krishnasuri Narayanam, Sandip Chakraborty
Abstract
—We initiate the study of Private Certifier Intersection ( PCI ), which allows mutually distrusting parties to establish a trust basis for cross-validation of claims if they have one or more trust authorities (certifiers) in common. This is one of the essential requirements for verifiable presentations in Web 3.0, since it provides additional privacy without compromising on decentralization. A PCI protocol allows two or more parties holding certificates to identify a common set of certifiers while additionally validating the certificates issued by such certifiers, without leaking any information about the certifiers not in the output intersection. In this paper, we formally define the notion of multi-party PCI in the Simplified-UC framework for two different settings depending on whether certificates are required for any of the claims (called PCI - Any ) or all of the claims (called PCI - All ). We then design and implement two provably secure and practically efficient PCI protocols supporting validation of digital signature-based certificates: a PCI - Any protocol for ECDSA-based certificates and a PCI - All protocol for BLS-based certificates. The technical centerpiece of our proposals is the first secret-sharing-based MPC framework supporting efficient computation of elliptic curve-based arithmetic operations, including elliptic curve pairings, in a black-box way. We implement this framework by building on top of the well-known MP-SPDZ library using OpenSSL and RELIC for elliptic curve operations, and use this implementation to benchmark our proposed PCI protocols in the LAN and WAN settings
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7d9ea4b2-f660-43b2-84b8-ce1ec6f88674Cited by top-tier papers2
- EVOKE: Efficient Revocation of Verifiable Credentials in IoT NetworksCarlo Mazzocca, Abbas Acar, A. Selcuk Uluagac, Rebecca MontanariUSENIX Security 2024 · 22 citations
- Rushing at SPDZ: On the Practical Security of Malicious MPC ImplementationsAlexander Kyster, Frederik Huss Nielsen, Sabine Oechsner, Peter SchollS&P 2025
Builds on6
- MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious TransferMarcel Keller, Emmanuela Orsini, Peter SchollCCS 2016 · 487 citations
- Fast Private Set Intersection from Homomorphic EncryptionHao Chen, Kim Laine, Peter RindalCCS 2017 · 446 citations
- Private Set Intersection in the Internet Setting from Lightweight Oblivious PRFMelissa Chase, Peihan MiaoCRYPTO 2020 · 158 citations
- Malicious-Secure Private Set Intersection via Dual ExecutionPeter Rindal, Mike RosulekCCS 2017 · 135 citations
- MPC-Friendly Symmetric Key PrimitivesLorenzo Grassi, Christian Rechberger, Dragos Rotaru, Peter Scholl et al.CCS 2016 · 119 citations
Related papers
- Efficient Scalable Multi-Party Private Set Intersection(-Variants) from Bicentric Zero-SharingYing Gao, Yuanchao Luo, Longxin Wang, Xiang Liu et al.CCS 2024 · 4 citations
- Multi-Party Private Set Operations from Predicative Zero-SharingMinglang Dong, Yu Chen, Cong Zhang, Yujie Bai et al.CCS 2025
- MinBucket MPSI: Breaking the Max-Size Bottleneck in Multi-Party Private Set IntersectionBinbin Tu, Boyudong Zhu, Yang Cao, Yu ChenNDSS 2026
- PUFF: Maximally Proactive Security for Free in Perfectly Secure MPC with Guaranteed Output DeliveryJiarui Li, Mengzhen Zou, Guidong Li, Guoyan Zhang et al.EUROCRYPT 2026
- Practical Traceable Over-Threshold Multi-Party Private Set IntersectionLe Yang, Weijing You, Huiyang He, Kailiang Ji et al.NDSS 2026 · 2 citations
