Jeongeun Park

Orcid: 0000-0002-0557-3540

Affiliations:
  • Norwegian University of Science and Technology, Trondheim, Norway
  • KU Leuven, COSIC, Belgium (former)
  • Ewha Womans University, Seoul, South Korea (PhD 2021)


According to our database1, Jeongeun Park authored at least 16 papers between 2019 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
NTRU-based FHE for Larger Key and Message Space.
IACR Cryptol. ePrint Arch., 2024

Faster Private Decision Tree Evaluation for Batched Input from Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2024

Towards Practical Transciphering for FHE with Setup Independent of the Plaintext Space.
IACR Commun. Cryptol., 2024

FINALLY: A Multi-Key FHE Scheme Based on NTRU and LWE.
IACR Commun. Cryptol., 2024

2023
Practical Randomized Lattice Gadget Decomposition With Application to FHE.
IACR Cryptol. ePrint Arch., 2023

Efficient and Secure k-NN Classification from Improved Data-Oblivious Programs and Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2023

Panacea: Non-interactive and Stateless Oblivious RAM.
IACR Cryptol. ePrint Arch., 2023

Efficient TFHE Bootstrapping in the Multiparty Setting.
IEEE Access, 2023

Poster: Panacea - Stateless and Non-Interactive Oblivious RAM.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
SortingHat: Efficient Private Decision Tree Evaluation via Homomorphic Encryption and Transciphering.
IACR Cryptol. ePrint Arch., 2022

FINAL: Faster FHE instantiated with NTRU and LWE.
IACR Cryptol. ePrint Arch., 2022

2021
Homomorphic Encryption for Multiple Users With Less Communications.
IEEE Access, 2021

Efficient Lattice Gadget Decomposition Algorithm With Bounded Uniform Distribution.
IEEE Access, 2021

2020
Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS.
Int. J. Found. Comput. Sci., 2020

SHECS-PIR: Somewhat Homomorphic Encryption-Based Compact and Scalable Private Information Retrieval.
Proceedings of the Computer Security - ESORICS 2020, 2020

2019
On the Security of Multikey Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2019


  Loading...