Efficient Non-Interactive Secure Two-Party Computation for Equality and Comparison

Simple item page
atmire.migration.oldid3270
dc.contributor.advisorMohassel, Payman
dc.contributor.authorKarimian Ardestani, Negin
dc.date.accessioned2015-05-22T17:36:11Z
dc.date.available2015-11-20T08:00:25Z
dc.date.issued2015-05-22
dc.date.submitted2015en
dc.description.abstractMulti-party computation is receiving more and more attention as its application in more areas prove promising. In this research, our focus is on secure two-party computation. In particular, we propose non-interactive constructions for securely computing private equality testing and greater-than testing protocols. Our first construction is a private equality testing (PET) protocol. What distinguishes our construction from the state of the art is that it is single-round and secure against malicious adversaries. Our second construction is a private greater-than testing (PGT) protocol (i.e. the Yao's Millionaires problem) which is also single-round but only secure in the semi-honest model. Our protocols are based on the Peikert-Vaikuntanathan-Waters maliciously secure oblivious transfer and a collision resistant hash function. We formally prove that the PET protocol and the PGT protocol provide computational security. In this research, we developed our protocol for PET and run experiments to test it. The results provide evidence of efficiency of our protocol.en_US
dc.identifier.citationKarimian Ardestani, N. (2015). Efficient Non-Interactive Secure Two-Party Computation for Equality and Comparison (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/25847en_US
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/25847
dc.identifier.urihttp://hdl.handle.net/11023/2266
dc.language.isoeng
dc.publisher.facultyGraduate Studies
dc.publisher.institutionUniversity of Calgaryen
dc.publisher.placeCalgaryen
dc.rightsUniversity of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.
dc.subjectComputer Science
dc.subject.classificationSecure Two-Party Computationen_US
dc.titleEfficient Non-Interactive Secure Two-Party Computation for Equality and Comparison
dc.typemaster thesis
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Calgary
thesis.degree.nameMaster of Science (MSc)
ucalgary.item.requestcopytrue
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ucalgary_2015_KarimianArdestani_Negin.pdf
Size:
630.05 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.65 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Open Theses and Dissertations