Thresholdizing lattice based encryption schemes

This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.

Bibliographic Details
Main Author: Xia, Andrew.
Other Authors: Yael Tauman Kalai.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2019
Subjects:
Online Access:https://hdl.handle.net/1721.1/121688
_version_ 1811079601762336768
author Xia, Andrew.
author2 Yael Tauman Kalai.
author_facet Yael Tauman Kalai.
Xia, Andrew.
author_sort Xia, Andrew.
collection MIT
description This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
first_indexed 2024-09-23T11:17:17Z
format Thesis
id mit-1721.1/121688
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T11:17:17Z
publishDate 2019
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/1216882019-11-22T04:20:13Z Thresholdizing lattice based encryption schemes Xia, Andrew. Yael Tauman Kalai. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Electrical Engineering and Computer Science. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019 Cataloged from student-submitted PDF version of thesis. Includes bibliographical references (pages 77-80). In this thesis, we examine a variety of constructions based on secret sharing techniques applied on lattice-based cryptographic primitives constructed from the learning with erros (LWE) assumption. Using secret sharing techniques from [BGG⁺17], we show how to construct paradigms of threshold multi-key fully homomorphic encryption and predicate encryption. Through multi-key fully homomorphic encryption [MW16] and threshold fully homomorphic encryption, we can construct a low-round multi party computation (MPC) scheme with guaranteed output delivery, assuming honest majority in the semi-honest and malicious settings. Applying the secret sharing scheme on predicate encryption constructions from LWE [GVW15], we can obtain a distributed predicate encryption scheme. by Andrew Xia. M. Eng. M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science 2019-07-15T20:34:21Z 2019-07-15T20:34:21Z 2018 2019 Thesis https://hdl.handle.net/1721.1/121688 1102057800 eng MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582 80 pages application/pdf Massachusetts Institute of Technology
spellingShingle Electrical Engineering and Computer Science.
Xia, Andrew.
Thresholdizing lattice based encryption schemes
title Thresholdizing lattice based encryption schemes
title_full Thresholdizing lattice based encryption schemes
title_fullStr Thresholdizing lattice based encryption schemes
title_full_unstemmed Thresholdizing lattice based encryption schemes
title_short Thresholdizing lattice based encryption schemes
title_sort thresholdizing lattice based encryption schemes
topic Electrical Engineering and Computer Science.
url https://hdl.handle.net/1721.1/121688
work_keys_str_mv AT xiaandrew thresholdizinglatticebasedencryptionschemes