S-Space College of Natural Sciences (자연과학대학) Dept. of Mathematical Sciences (수리과학부) Theses (Ph.D. / Sc.D._수리과학부)
Efficient Instantiation of LWE-based Public-Key Encryption and Commitment Schemes
LWE 문제 기반 공개키 암호 및 commitment 스킴의 효율적인 인스턴스화
- 자연과학대학 수리과학부
- Issue Date
- 서울대학교 대학원
- lattice; learning with errors; LWE; sparse; public-key encryption; commitment; threshold cryptosystems
- 학위논문 (박사)-- 서울대학교 대학원 : 자연과학대학 수리과학부, 2018. 2. 천정희.
- The Learning with Errors (LWE) problem has been used as a underlying problem of a variety of cryptographic schemes. It makes possible constructing advanced solutions like fully homomorphic encryption, multi linear map as well as basic primitives like key-exchange, public-key encryption, signature. Recently, developments in quantum computing have triggered interest in constructing practical cryptographic schemes. In this thesis, we propose efficient post-quantum public-key encryption and commitment schemes based on a variant LWE, named as spLWE. We also suggest related zero-knowledge proofs and LWE-based threshold cryptosystems as an application of the proposed schemes. In order to achieve these results, it is essential investigating the hardness about the variant LWE problem, spLWE. We describe its theoretical, and concrete hardness from a careful analysis.