Efficient Multiparty Computation from Lossy Threshold Encryption
dc.contributor.advisor | Eberly, Wayne | |
dc.contributor.advisor | Jacobson, Michael S. | |
dc.contributor.author | Nargis, Isheeta | |
dc.contributor.committeemember | Safavi-Naini, Reihaneh S. | |
dc.contributor.committeemember | Fong, Philip W. L. | |
dc.contributor.committeemember | Reardon, Joel | |
dc.contributor.committeemember | Yadid-Pecht, Orly | |
dc.contributor.committeemember | Wei, Ruizhong | |
dc.date | 2019-11 | |
dc.date.accessioned | 2019-09-27T17:39:28Z | |
dc.date.available | 2019-09-27T17:39:28Z | |
dc.date.issued | 2019-09-26 | |
dc.description.abstract | This dissertation includes four contributions concerning secure multiparty computation. The first contribution is a new lossy threshold encryption scheme. This is the first encryption scheme that is both a lossy and a threshold encryption scheme. The second contribution is a new oblivious transfer protocol secure against erasure-free one-sided active adaptive adversaries. The third contribution is a new two-party computation protocol for the evaluation of boolean circuits that is secure against erasure-free one-sided active adaptive adversaries. As a building block of this protocol, a new cut-and-choose oblivious transfer protocol is designed. The fourth contribution is a new multiparty computation protocol for the evaluation of arithmetic circuits that is secure against covert adversaries. Protocols that are part of the second, third and fourth contributions improve the communication complexity, the number of public key encryption operations and the number of exponentiation operations over existing protocols for the same problems that provide the same or higher levels of security. | en_US |
dc.identifier.citation | Nargis, I. (2019). Efficient Multiparty Computation from Lossy Threshold Encryption (Doctoral thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. | en_US |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/37159 | |
dc.identifier.uri | http://hdl.handle.net/1880/111098 | |
dc.language.iso | eng | en_US |
dc.publisher.faculty | Science | en_US |
dc.publisher.institution | University of 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. | en_US |
dc.subject | Security | en_US |
dc.subject | Cryptography | en_US |
dc.subject | Multiparty Computation | en_US |
dc.subject | Encryption | en_US |
dc.subject.classification | Computer Science | en_US |
dc.title | Efficient Multiparty Computation from Lossy Threshold Encryption | en_US |
dc.type | doctoral thesis | en_US |
thesis.degree.discipline | Computer Science | en_US |
thesis.degree.grantor | University of Calgary | en_US |
thesis.degree.name | Doctor of Philosophy (PhD) | en_US |
ucalgary.item.requestcopy | true | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- ucalgary_2019_nargis_isheeta.pdf
- Size:
- 1.65 MB
- Format:
- Adobe Portable Document Format
- Description:
- The dissertation file
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 2.62 KB
- Format:
- Item-specific license agreed upon to submission
- Description: