Moon Sung Lee

According to our database1, Moon Sung Lee authored at least 16 papers between 2005 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Sparse subset sum problem from Gentry-Halevi's fully homomorphic encryption.
IET Inf. Secur., 2017

2016
The polynomial approximate common divisor problem and its application to the fully homomorphic encryption.
Inf. Sci., 2016

Attacks and parameter choices in HIMMO.
IACR Cryptol. ePrint Arch., 2016

Zeroizing Attacks on Indistinguishability Obfuscation over CLT13.
IACR Cryptol. ePrint Arch., 2016

Cryptanalysis of GGH15 Multilinear Maps.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
CRT-based fully homomorphic encryption over the integers.
Inf. Sci., 2015

Cryptanalysis of the Co-ACD Assumption.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Accelerating bootstrapping in FHEW using GPUs.
Proceedings of the 26th IEEE International Conference on Application-specific Systems, 2015

2014
Cryptanalysis of a New Additive Homomorphic Encryption based on the co-ACD Problem.
IACR Cryptol. ePrint Arch., 2014

2013
Improved cryptanalysis of a knapsack-based probabilistic encryption scheme.
Inf. Sci., 2013

Cryptanalysis of a Public Key Cryptosystem Based on the Matrix Combinatorial Problem.
Informatica, 2013

Batch Fully Homomorphic Encryption over the Integers.
Proceedings of the Advances in Cryptology, 2013

2011
On the sparse subset sum problem from Gentry-Halevi's implementation of fully homomorphic encryption.
IACR Cryptol. ePrint Arch., 2011

Cryptanalysis of a quadratic compact knapsack public-key cryptosystem.
Comput. Math. Appl., 2011

2010
Cryptanalysis of the GGH Cryptosystem.
Math. Comput. Sci., 2010

2005
Efficient Delegation of Pairing Computation.
IACR Cryptol. ePrint Arch., 2005


  Loading...