Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function

Sumit Kumar Debnath, Ratna Dutta

Published Jan 1, 2015• 4 citations
Publisher
DOI
10.1007/978-3-319-15943-0_21

Related papers

Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection

Stanisław Jarecki, Xiaomin Liu

Lecture notes in computer science•Jan 1, 2009•305 citations

Fast post-quantum private set intersection from oblivious pseudorandom function for mobile social networks

Zhuang Shan, Leyou Zhang, Qing Wu +2 more

Journal of Systems Architecture•Jan 25, 2025•2 citations

Efficient post-quantum private set-intersection protocol

Nibedita Kundu, Tanmay Choudhury, Sumit Kumar Debnath

International Journal of Information and Computer Security•Jan 1, 2022•0 citations

Efficient semi-quantum private set intersection cardinality protocol without pre-shared key

Xue Zhang, Chun‐Yan Wei, Fei Gao +2 more

Quantum Information Processing•Jul 8, 2025•5 citations

Towards fair mutual private set intersection with linear complexity

Sumit Kumar Debnath, Ratna Dutta

Abstract In this paper, we propose a two‐way oblivious pseudorandom function (mOPRF) secure in standard model against malicious parties under the decisional composite residuosity and decisional Diffie–Hellman assumptions. Using this two‐way OPRF, we construct an optimistic mutual private set intersection (PSI) protocol conserving fairness. In our PSI protocol, fairness is obtained by a semi‐trusted arbiter in the sense that it cannot get access to the private information of the two parties, but we believe that it will follow the protocol. To the best of our knowledge, our PSI protocol is the first fair PSI with linear communication and computation complexities and is proven to be secure in standard model against malicious adversaries under decisional q‐Diffie–Hellman inversion, decisional composite residuosity, and decisional Diffie–Hellman assumptions. Apart from that, we present a modified version of the OPRF that requires less number of communication rounds. Copyright © 2016 John Wiley & Sons, Ltd.

Security and Communication Networks•Mar 6, 2016•12 citations

An Unconditionally Secure Protocol for Multi-Party Set Intersection

Ronghua Li, Chuan-Kun Wu

Lecture notes in computer science•Jan 1, 2007•42 citations
Abstract In this paper, we propose a two‐way oblivious pseudorandom function (mOPRF) secure in standard model against malicious parties under the decisional composite residuosity and decisional Diffie–Hellman assumptions. Using this two‐way OPRF, we construct an optimistic mutual private set intersection (PSI) protocol conserving fairness. In our PSI protocol, fairness is obtained by a semi‐trusted arbiter in the sense that it cannot get access to the private information of the two parties, but we believe that it will follow the protocol. To the best of our knowledge, our PSI protocol is the first fair PSI with linear communication and computation complexities and is proven to be secure in standard model against malicious adversaries under decisional q‐Diffie–Hellman inversion, decisional composite residuosity, and decisional Diffie–Hellman assumptions. Apart from that, we present a modified version of the OPRF that requires less number of communication rounds. Copyright © 2016 John Wiley & Sons, Ltd.