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

IEEE International Symposium on Information Theory (ISIT)

Private Set Intersection Using a Binary Erasure Channel

Amirhossein Shekofteh, Rémi A. Chou

Published Jun 1, 2026• 0 citations
Publisher

Abstract

We consider a Private Set Intersection (PSI) problem, where a server holds an arbitrary number of private subsets and a client holds a private subset of size K over a universe of size N. The client wants to compute the intersection of its set with each private subset of the server, learning only these intersections, while the server learns nothing about the client’s private set. The server controls the input of a binary erasure channel (BEC) with parameter ϵ, whose output is observed by the client, and both client and server can communicate over a noiseless channel. We define the PSI rate as the ratio of the number of server subsets to the number of BEC uses and characterize the information-theoretic PSI capacity as ${C_{{\text{PSI}}}} = \min \left( {\frac{\varepsilon }{{N - K}},\frac{{1 - \varepsilon }}{K}} \right)$. Our result is obtained by reducing the PSI problem to a K-out-of-N oblivious transfer problem and proving that this reduction is optimal.

DOI
10.1109/isit62367.2026.11654065

Related papers

Private Set Intersection with Delegated Blind Quantum Computing

Michele Amoretti

Private set intersection is an important problem with implications in many areas, ranging from remote diagnostics to private contact discovery. In this work, we consider the case of two-party PSI in the honest-but-curious setting. We propose a protocol that solves the server-aided PSI problem using delegated blind quantum computing. More specifically, the proposed protocol allows Alice and Bob (who do not have any quantum computational resources or quantum memory) to interact with Steve (who has a quantum computer) in order for Alice and Bob to obtain set intersection such that privacy is preserved. In particular, Steve learns nothing about the clients' input, output, or desired computation. The proposed protocol is correct, secure and blind against a malicious server, and characterized by a quantum communication complexity that is linear in the input size.

arXiv:2201.03496•Globecom•Dec 1, 2021•3 citations

Capacity of K-out-of-N Oblivious Transfer over the Binary Erasure Channel

Amirhossein Shekofteh, Rémi A. Chou

We study K-out-of-N oblivious transfer (OT) over a binary erasure channel (BEC) and a public noiseless channel, under an honest-but-curious model. In this setting, a client retrieves K out of N messages stored by a server; the protocol must guarantee that the unselected messages remain private to the server and that the client’s choices remain hidden from the server. We show that the K-out-of-N OT capacity over a BEC with erasure probability ϵ is $C = \min \left({\frac{{K\varepsilon }}{{N - K}},1 - \varepsilon }\right).$ This characterization recovers the known capacity for 1-out-of-2 OT and, for 1-out-of-N OT, recovers the established capacity when $\frac{{N - 1}}{N} \leq \varepsilon $ while further establishing the capacity for all ϵ ∈ [0,1]. We also show that the naive K-out-of-N OT construction obtained by repeating an optimal 1-out-of-N OT protocol K times is suboptimal.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•1 citation

Private set intersection: New generic constructions and feasibility results

Paolo D’Arco, María Isabel González Vasco, Ángel Luis Pérez del Pozo +2 more

In this paper we focus on protocols for private set intersection (PSI), through which two parties, each holding a set of inputs drawn from a ground set, jointly compute the intersection of their sets. Ideally, no further information than which elements are actually shared is compromised to the other party, yet the input set sizes are often considered as admissible leakage.In the unconditional setting we evidence that PSI is impossible to realize and that unconditionally secure size-hiding PSI is possible assuming a set-up authority is present in an set up phase. In the computational setting we give a generic construction using smooth projective hash functions for languages derived from perfectly-binding commitments. Further, we give two size-hiding constructions: the first one is theoretical and evidences the equivalence between PSI, oblivious transfer and the secure computation of the AND function. The second one is a twist on the oblivious polynomial evaluation construction of Freedman et al. from EUROCRYPT 2004. We further sketch a generalization of the latter using algebraic-geometric techniques. Finally, assuming again there is a set-up authority (yet not necessarily trusted) we present very simple and efficient constructions that only hide the size of the client's set.

Advances in Mathematics of Communications•Jan 1, 2017•3 citations

Efficient Quantum Protocol for Private Set Intersection Cardinality

Runhua Shi

Recently, we proposed a quantum solution to the problem of private set intersection cardinality (PSI-CA) (Information Sciences 370–371 (2016) 147–158). Compared to classical solutions, the proposed quantum PSI-CA protocol achieves an exponential reduction in communication complexity, since it only needs$O(1)$communication cost. However, this protocol requires two additional assumptions about the cardinalities of the sets, which may limit its wider applications. In this paper, we successfully discard these assumptions and present a stronger quantum PSI-CA protocol without any limitation. The new protocol ensures the parties’ private security, i.e., unconditionally secure server privacy and statistically secure client privacy, and it achieves the constant computation and communication complexities, which are independent of the size of the sets. Therefore, it is more suitable for practical applications with big data sets.

IEEE Access•Jan 1, 2018•25 citations

Private Set Intersection: A Multi-Message Symmetric Private Information Retrieval Perspective

Zhusheng Wang, Karim Banawan, Şennur Ulukuş

We study the problem of private set intersection (PSI). In this problem, there are two entities$E_{i}$, for$i=1, 2$, each storing a set$\mathcal {P}_{i}$, whose elements are picked from a finite set$\mathbb {S}_{K}$, on$N_{i}$replicated and non-colluding databases. It is required to determine the set intersection${\mathcal {P}}_{1} \cap {\mathcal {P}} _{2}$without leaking any information about the remaining elements to the other entity, and to do this with the least amount of downloaded bits. We first show that the PSI problem can be recast as a multi-message symmetric private information retrieval (MM-SPIR) problem with certain added restrictions. Next, as a stand-alone result, we derive the information-theoretic sum capacity of MM-SPIR,$C_{MM-SPIR}$. We show that with$K$messages,$N$databases, and a given size of the desired message set$P$, the exact capacity of MM-SPIR is$C_{MM-SPIR} = 1 - \frac {1}{N}$when$P \leq K-1$, provided that the entropy of the common randomness$S$satisfies$H(S) \geq \frac {P}{N-1}$per desired symbol. When$P = K$, the MM-SPIR capacity is trivially 1 without the need for any common randomness$S$. This result implies that there is no gain for MM-SPIR over successive single-message SPIR (SM-SPIR). For the MM-SPIR problem, we present a novel capacity-achieving scheme which builds seamlessly over the near-optimal scheme of Banawan-Ulukus originally proposed for the multi-message PIR (MM-PIR) problem without any database privacy constraints. Surprisingly, our scheme here is exactly optimal for the MM-SPIR problem for any$P$, in contrast to the scheme for the MM-PIR problem, which was proved only to be near-optimal. Our scheme is an alternative to the successive usage of the SM-SPIR scheme of Sun-Jafar. Based on this capacity result for the MM-SPIR problem, and after addressing the added requirements in its conversion to the PSI problem, we show that the optimal download cost for the PSI problem is given by$\min \left \{{\left \lceil{ \frac {P_{1} N_{2}}{N_{2}-1}}\right \rceil, \left \lceil{ \frac {P_{2} N_{1}}{N_{1}-1}}\right \rceil }\right \}$, where$P_{i}$is the cardinality of set${\mathcal {P}}_{i}$.

arXiv:1912.13501•IEEE Transactions on Information Theory•Nov 2, 2021•59 citations

Private data transfer over a broadcast channel

Manoj Mishra, Tanmay Sharma, Bikash Kumar Dey +1 more

We study the following private data transfer problem: Alice has a database of files. Bob and Cathy want to access a file each from this database (which may or may not be the same file), but each of them wants to ensure that their choices of file do not get revealed even if Alice colludes with the other user. Alice, on the other hand, wants to make sure that each of Bob and Cathy does not learn any more information from the database than the files they demand (the identities of which will be unknown to her). Moreover, they should not learn any information about the other files even if they collude. It turns out that it is impossible to accomplish this if Alice, Bob, and Cathy have access only to private randomness and noiseless communication links. We consider this problem when a binary erasure broadcast channel with independent erasures is available from Alice to Bob and Cathy in addition to a noiseless public discussion channel. We study the file-length-per-broadcast-channel-use rate in the honest-but-curious model. We focus on the case when the database consists of two files, and obtain the optimal rate. We then extend to the case of larger databases, and give upper and lower bounds on the optimal rate.

arXiv:1504.01101•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•1 citation
We consider a Private Set Intersection (PSI) problem, where a server holds an arbitrary number of private subsets and a client holds a private subset of size K over a universe of size N. The client wants to compute the intersection of its set with each private subset of the server, learning only these intersections, while the server learns nothing about the client’s private set. The server controls the input of a binary erasure channel (BEC) with parameter ϵ, whose output is observed by the client, and both client and server can communicate over a noiseless channel. We define the PSI rate as the ratio of the number of server subsets to the number of BEC uses and characterize the information-theoretic PSI capacity as CPSI=min⁡(εN−K,1−εK){C_{{\text{PSI}}}} = \min \left( {\frac{\varepsilon }{{N - K}},\frac{{1 - \varepsilon }}{K}} \right)CPSI​=min(N−Kε​,K1−ε​). Our result is obtained by reducing the PSI problem to a K-out-of-N oblivious transfer problem and proving that this reduction is optimal.
Private set intersection is an important problem with implications in many areas, ranging from remote diagnostics to private contact discovery. In this work, we consider the case of two-party PSI in the honest-but-curious setting. We propose a protocol that solves the server-aided PSI problem using delegated blind quantum computing. More specifically, the proposed protocol allows Alice and Bob (who do not have any quantum computational resources or quantum memory) to interact with Steve (who has a quantum computer) in order for Alice and Bob to obtain set intersection such that privacy is preserved. In particular, Steve learns nothing about the clients' input, output, or desired computation. The proposed protocol is correct, secure and blind against a malicious server, and characterized by a quantum communication complexity that is linear in the input size.
We study K-out-of-N oblivious transfer (OT) over a binary erasure channel (BEC) and a public noiseless channel, under an honest-but-curious model. In this setting, a client retrieves K out of N messages stored by a server; the protocol must guarantee that the unselected messages remain private to the server and that the client’s choices remain hidden from the server. We show that the K-out-of-N OT capacity over a BEC with erasure probability ϵ is C=min⁡(KεN−K,1−ε).C = \min \left({\frac{{K\varepsilon }}{{N - K}},1 - \varepsilon }\right).C=min(N−KKε​,1−ε). This characterization recovers the known capacity for 1-out-of-2 OT and, for 1-out-of-N OT, recovers the established capacity when $\frac{{N - 1}}{N} \leq \varepsilon $ while further establishing the capacity for all ϵ ∈ [0,1]. We also show that the naive K-out-of-N OT construction obtained by repeating an optimal 1-out-of-N OT protocol K times is suboptimal.
In this paper we focus on protocols for private set intersection (PSI), through which two parties, each holding a set of inputs drawn from a ground set, jointly compute the intersection of their sets. Ideally, no further information than which elements are actually shared is compromised to the other party, yet the input set sizes are often considered as admissible leakage.In the unconditional setting we evidence that PSI is impossible to realize and that unconditionally secure size-hiding PSI is possible assuming a set-up authority is present in an set up phase. In the computational setting we give a generic construction using smooth projective hash functions for languages derived from perfectly-binding commitments. Further, we give two size-hiding constructions: the first one is theoretical and evidences the equivalence between PSI, oblivious transfer and the secure computation of the AND function. The second one is a twist on the oblivious polynomial evaluation construction of Freedman et al. from EUROCRYPT 2004. We further sketch a generalization of the latter using algebraic-geometric techniques. Finally, assuming again there is a set-up authority (yet not necessarily trusted) we present very simple and efficient constructions that only hide the size of the client's set.
Recently, we proposed a quantum solution to the problem of private set intersection cardinality (PSI-CA) (Information Sciences 370–371 (2016) 147–158). Compared to classical solutions, the proposed quantum PSI-CA protocol achieves an exponential reduction in communication complexity, since it only needsO(1)O(1)O(1)communication cost. However, this protocol requires two additional assumptions about the cardinalities of the sets, which may limit its wider applications. In this paper, we successfully discard these assumptions and present a stronger quantum PSI-CA protocol without any limitation. The new protocol ensures the parties’ private security, i.e., unconditionally secure server privacy and statistically secure client privacy, and it achieves the constant computation and communication complexities, which are independent of the size of the sets. Therefore, it is more suitable for practical applications with big data sets.
We study the problem of private set intersection (PSI). In this problem, there are two entitiesEiE_{i}Ei​, fori=1,2i=1, 2i=1,2, each storing a setPi\mathcal {P}_{i}Pi​, whose elements are picked from a finite setSK\mathbb {S}_{K}SK​, onNiN_{i}Ni​replicated and non-colluding databases. It is required to determine the set intersectionP1∩P2{\mathcal {P}}_{1} \cap {\mathcal {P}} _{2}P1​∩P2​without leaking any information about the remaining elements to the other entity, and to do this with the least amount of downloaded bits. We first show that the PSI problem can be recast as a multi-message symmetric private information retrieval (MM-SPIR) problem with certain added restrictions. Next, as a stand-alone result, we derive the information-theoretic sum capacity of MM-SPIR,CMM−SPIRC_{MM-SPIR}CMM−SPIR​. We show that withKKKmessages,NNNdatabases, and a given size of the desired message setPPP, the exact capacity of MM-SPIR isCMM−SPIR=1−1NC_{MM-SPIR} = 1 - \frac {1}{N}CMM−SPIR​=1−N1​whenP≤K−1P \leq K-1P≤K−1, provided that the entropy of the common randomnessSSSsatisfiesH(S)≥PN−1H(S) \geq \frac {P}{N-1}H(S)≥N−1P​per desired symbol. WhenP=KP = KP=K, the MM-SPIR capacity is trivially 1 without the need for any common randomnessSSS. This result implies that there is no gain for MM-SPIR over successive single-message SPIR (SM-SPIR). For the MM-SPIR problem, we present a novel capacity-achieving scheme which builds seamlessly over the near-optimal scheme of Banawan-Ulukus originally proposed for the multi-message PIR (MM-PIR) problem without any database privacy constraints. Surprisingly, our scheme here is exactly optimal for the MM-SPIR problem for anyPPP, in contrast to the scheme for the MM-PIR problem, which was proved only to be near-optimal. Our scheme is an alternative to the successive usage of the SM-SPIR scheme of Sun-Jafar. Based on this capacity result for the MM-SPIR problem, and after addressing the added requirements in its conversion to the PSI problem, we show that the optimal download cost for the PSI problem is given bymin⁡{⌈P1N2N2−1⌉,⌈P2N1N1−1⌉}\min \left \{{\left \lceil{ \frac {P_{1} N_{2}}{N_{2}-1}}\right \rceil, \left \lceil{ \frac {P_{2} N_{1}}{N_{1}-1}}\right \rceil }\right \}min{⌈N2​−1P1​N2​​⌉,⌈N1​−1P2​N1​​⌉}, wherePiP_{i}Pi​is the cardinality of setPi{\mathcal {P}}_{i}Pi​.
We study the following private data transfer problem: Alice has a database of files. Bob and Cathy want to access a file each from this database (which may or may not be the same file), but each of them wants to ensure that their choices of file do not get revealed even if Alice colludes with the other user. Alice, on the other hand, wants to make sure that each of Bob and Cathy does not learn any more information from the database than the files they demand (the identities of which will be unknown to her). Moreover, they should not learn any information about the other files even if they collude. It turns out that it is impossible to accomplish this if Alice, Bob, and Cathy have access only to private randomness and noiseless communication links. We consider this problem when a binary erasure broadcast channel with independent erasures is available from Alice to Bob and Cathy in addition to a noiseless public discussion channel. We study the file-length-per-broadcast-channel-use rate in the honest-but-curious model. We focus on the case when the database consists of two files, and obtain the optimal rate. We then extend to the case of larger databases, and give upper and lower bounds on the optimal rate.