{"id":{"repo_id":"calgary","oai_identifier":"oai:ucalgary.scholaris.ca:11023/2266"},"canonical_url":"https://search.dev.ndltd.org/etd/calgary/oai:ucalgary.scholaris.ca:11023/2266","repository":{"repo_id":"calgary","name":"University of Calgary","base_url":"https://ucalgary.scholaris.ca/server/oai/request"},"display":{"title":"Efficient Non-Interactive Secure Two-Party Computation for Equality and Comparison","abstract":"Multi-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.","abstract_html":"Multi-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.","abstract_has_math":false,"creators":["Karimian Ardestani, Negin"],"institution":"Graduate Studies","degree_name":"Master of Science (MSc)","degree_level":null,"degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Mohassel, Payman"],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-05-22","date_published":"2015-05-22","updated_at":"2026-07-24T01:30:29Z","subjects":["Computer Science"],"languages":["eng"],"rights":["University 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."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["http://dx.doi.org/10.11575/PRISM/25847"],"render_values":[{"text":"http://dx.doi.org/10.11575/PRISM/25847","href":"http://dx.doi.org/10.11575/PRISM/25847","code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/11023/2266","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Mohassel, Payman"]},{"key":"dc:creator","label":"Author","values":["Karimian Ardestani, Negin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-05-22T17:36:11Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-11-20T08:00:25Z"]},{"key":"dc:date.issued","label":"Date","values":["2015-05-22"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Calgary"]},{"key":"dc:type","label":"Dc Type","values":["master thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MSc)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Calgary"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["University 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."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.doi","label":"DOI","values":["http://dx.doi.org/10.11575/PRISM/25847"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11023/2266"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Multi-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."]},{"key":"dc:title","label":"Title","values":["Efficient Non-Interactive Secure Two-Party Computation for Equality and Comparison"]}]}],"canonical_facts":{"dc:contributor.advisor":["Mohassel, Payman"],"dc:creator":["Karimian Ardestani, Negin"],"dc:date.accessioned":["2015-05-22T17:36:11Z"],"dc:date.available":["2015-11-20T08:00:25Z"],"dc:date.issued":["2015-05-22"],"dc:description.abstract":["Multi-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."],"dc:identifier.doi":["http://dx.doi.org/10.11575/PRISM/25847"],"dc:identifier.uri":["http://hdl.handle.net/11023/2266"],"dc:language.iso":["eng"],"dc:publisher.institution":["University of Calgary"],"dc:rights":["University 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:subject":["Computer Science"],"dc:title":["Efficient Non-Interactive Secure Two-Party Computation for Equality and Comparison"],"dc:type":["master thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_name":["Master of Science (MSc)"],"thesis:institution_name":["University of Calgary"]},"updated_at":"2026-07-24T01:30:29Z"}