Highly Efficient Commodity-based Two-Party Computation for Smartphones
| atmire.migration.oldid | 3229 | |
| dc.contributor.advisor | Mohassel, Payman | |
| dc.contributor.author | Orobets, Ostap | |
| dc.date.accessioned | 2015-05-06T15:32:36Z | |
| dc.date.available | 2015-06-22T07:00:50Z | |
| dc.date.issued | 2015-05-06 | |
| dc.date.submitted | 2015 | en |
| dc.description.abstract | Secure Two-Party Computation (2PC) enables a set of parties to compute a function of their inputs while keeping these inputs private. While theoretical solutions for solving 2PC problems were known for decades, efficient implementations have been developed only recently. The delay in implementation was caused by a number of factors, including a substantial performance overhead and limitations of the standard implementation techniques. These difficulties are compounded in mobile devices, which have even additional restrictions on memory, computational power, and bandwidth. There exist low-cost general-purpose protocols for semi-honest parties that can be executed efficiently even on smartphones. However, for the malicious case current protocols are much less efficient. This thesis introduces the first protocol for mobile phones that is secure in the presence of malicious players and a semi-honest, non-colluding server. The protocol takes advantage of a commodity-based setting, where one or multiple servers provide participants with computational material that makes 2PC efficient. Our protocol has two phases: In an offline phase - where no party knows which function is to be computed nor who else is participating - each party interacts with the server and downloads a file. Later, in the online phase, when two parties decide to execute a 2PC together, they can use the files they have downloaded earlier to execute the computation at low cost. We implement our protocol on Android smartphones and desktops and experimentally show that our mobile solution is more efficient than most of the semi-honest mobile applications in this field. The online phase for evaluating a single AES circuit requires only 2.5 seconds and can be further reduced to 1.2 seconds (amortized time) with multiple executions. | en_US |
| dc.identifier.citation | Orobets, O. (2015). Highly Efficient Commodity-based Two-Party Computation for Smartphones (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/26358 | en_US |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/26358 | |
| dc.identifier.uri | http://hdl.handle.net/11023/2248 | |
| dc.language.iso | eng | |
| dc.publisher.faculty | Graduate Studies | |
| dc.publisher.institution | University of Calgary | en |
| dc.publisher.place | Calgary | en |
| 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.subject.classification | Applied Cryptography | en_US |
| dc.subject.classification | Secure Computation | en_US |
| dc.title | Highly Efficient Commodity-based Two-Party Computation for Smartphones | |
| dc.type | master thesis | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | University of Calgary | |
| thesis.degree.name | Master of Science (MSc) | |
| ucalgary.item.requestcopy | true |