Original title: Comparison of Protocols for Private Set Intersection and 2-Party Secure Computation
Translated title: Comparison of Protocols for Private Set Intersection and 2-Party Secure Computation
Authors: Khan, Ahmed ; Aragona, Riccardo (referee) ; Civino, Roberto (advisor)
Document type: Master’s theses
Year: 2025
Language: eng
Publisher: Vysoké učení technické v Brně. Fakulta strojního inženýrství
Abstract: This thesis presents a comparative study of various cryptographic protocols designed for 2-Party Secure Computation (2PSC) and, more precisely, for Private Set Intersection (PSI), with a particular focus on their implementation and performance under malicious adversary models. Among the protocols explored, the OPA-based and PSZ protocols were selected for detailed analysis due to their strong security guarantees and efficiency. Both protocols were implemented using Python and subjected to empirical testing. The OPA-based protocol employs algebraic constructions such as Oblivious Linear Function Evaluation (OLE), its enhanced version OLE+, and Oblivious Polynomial Addition (OPA), whereas the PSZ protocol leverages modern Oblivious Transfer (OT) extensions and Pseudo-Random Functions (PRFs). The thesis evaluates these protocols in terms of computational cost and communication overhead. The results offer a practical perspective on using such cryptographic primitives in real-world applications.
Keywords: 2PSI; OEP; OLE; OLE+.; OPA; OT; PRF; protocol; PSI; PSZ; Secure computation; 2PSI; OEP; OLE; OLE+.; OPA; OT; PRF; protocol; PSI; PSZ; Secure computation

Institution: Brno University of Technology (web)
Document availability information: Fulltext is available in the Brno University of Technology Digital Library.
Original record: http://hdl.handle.net/11012/253562

Permalink: http://www.nusl.cz/ntk/nusl-680666


The record appears in these collections:
Universities and colleges > Public universities > Brno University of Technology
Academic theses (ETDs) > Master’s theses