New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness

Debnath, Sumit Kumar; Dutta, Ratna

doi:10.1007/978-3-319-53177-9_14

Cited by 3 publications

(9 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The scheme is secure under the Decisional Diffie-Hellman (DDH) assumption in the ROM against semi-honest adversaries and achieves linear communication and Θ(v log v) as computational complexity. Recently, Debnath and Dutta [21] designed a fair optimistic two-way PSI over prime order group. The scheme is optimistic in the sense that it uses an off-line semi-trusted third party.…”

Section: Related Workmentioning

confidence: 99%

Secure and efficient multiparty private set intersection cardinality

Debnath¹,

Stănică²,

Kundu³

et al. 2021

Advances in Mathematics of Communications

View full text Add to dashboard Cite

In the field of privacy preserving protocols, Private Set Intersection (PSI) plays an important role. In most of the cases, PSI allows two parties to securely determine the intersection of their private input sets, and no other information. In this paper, employing a Bloom filter, we propose a Multiparty Private Set Intersection Cardinality (MPSI-CA), where the number of participants in PSI is not limited to two. The security of our scheme is achieved in the standard model under the Decisional Diffie-Hellman (DDH) assumption against semi-honest adversaries. Our scheme is flexible in the sense that set size of one participant is independent from that of the others. We consider the number of modular exponentiations in order to determine computational complexity. In our construction, communication and computation overheads of each participant is O(vmaxk) except that the complexity of the designated party is O(v 1), where vmax is the maximum set size, v 1 denotes the set size of the designated party and k is a security parameter. Particularly, our MSPI-CA is the first that incurs linear complexity in terms of set size, namely O(nvmaxk), where n is the number of participants. Further, we extend our MPSI-CA to MPSI retaining all the security attributes and other properties. As far as we are aware of, there is no other MPSI so far where individual computational cost of each participant is independent of the number of participants. Unlike MPSI-CA, our MPSI does not require any kind of broadcast channel as it uses star network topology in the sense that a designated party communicates with everyone else.

show abstract

Section: Related Workmentioning

confidence: 99%

Secure and efficient multiparty private set intersection cardinality

Debnath¹,

Stănică²,

Kundu³

et al. 2021

Advances in Mathematics of Communications

View full text Add to dashboard Cite

show abstract

“…And in the standard model, it has been proven to resist the attack of malicious adversaries. In [12], an mPSI protocol with linear communication and computational overhead is constructed by using prime order group. e protocol uses a distributed ElGamal encryption algorithm and an offline semitrusted third party to achieve the fairness of the protocol and the security under the malicious adversary model.…”

Section: Mutual Psimentioning

confidence: 99%

“…Performance Evaluation 6.1. eoretical Evaluation. In this section, regarding the complexity of calculation and communication, we compare the O-mPSI protocol with the protocols in [11,12,20]. We choose these three protocols because both parties of the protocols in [11,12] can know the intersection, and the protocol in [20] supports outsourcing.…”

Section: Security Analysismentioning

confidence: 99%

“…e protocol in [11] is based on the two-way oblivious pseudorandom function mOPRF, without the participation of a third-party server, and its computation complexity is 48n. e protocol in [12] also does not involve the thirdparty server; its computation complexity is 23n + 7. In the verifiable delegated PSI protocol of [20], the user performs 10n + 15 exponential operations and the server performs 10n + 15 exponential operations, so the overall computation complexity of [20] is 20n + 30.…”

Section: Security Analysismentioning

confidence: 99%

“…However, since the protocol is constructed based on composite order, the efficiency is lower than that based on prime order. Based on [11], Debnath et al [12] proposed another mPSI protocol using prime order groups. e protocol also uses homomorphic encryption algorithm to ensure the security of data and uses semihonest offline arbiter to achieve fairness between two participants.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Outsourced Mutual Private Set Intersection Protocol for Edge-Assisted IoT

Zhang

Qin

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

The development of edge computing and Internet of Things technology has brought convenience to our lives, but the sensitive and private data collected are also more vulnerable to attack. Aiming at the data privacy security problem of edge-assisted Internet of Things, an outsourced mutual Private Set Intersection protocol is proposed. The protocol uses the ElGamal threshold encryption algorithm to rerandomize the encrypted elements to ensure all the set elements are calculated in the form of ciphertext. After that, the protocol maps the set elements to the corresponding hash bin under the execution of two hash functions and calculates the intersection in a bin-to-bin manner, reducing the number of comparisons of the set elements. In addition, the introduction of edge servers reduces the computational burden of participating users and achieves the fairness of the protocol. Finally, the IND-CPA security of the protocol is proved, and the performance of the protocol is compared with other relevant schemes. The evaluation results show that this protocol is superior to other related protocols in terms of lower computational overhead.

show abstract

Fair Private Set Intersection Using Smart Contracts

Avizheh,

Safavi-Naini

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness

Cited by 3 publications

References 32 publications

Secure and efficient multiparty private set intersection cardinality

Secure and efficient multiparty private set intersection cardinality

Outsourced Mutual Private Set Intersection Protocol for Edge-Assisted IoT

Fair Private Set Intersection Using Smart Contracts

Contact Info

Product

Resources

About