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 19 papers between 2018 and 2025.

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

2025
Private Information Retrieval based on Homomorphic Encryption, Revisited.
IACR Cryptol. ePrint Arch., 2025

sPAR: (Somewhat) Practical Anonymous Router.
IACR Cryptol. ePrint Arch., 2025

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

Faster Private Decision Tree Evaluation for Batched Input from Homomorphic Encryption.
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

Revisiting Oblivious Top-k Selection with Applications to Secure k-NN Classification.
Proceedings of the Selected Areas in Cryptography - SAC 2024, 2024

Panacea: Non-Interactive and Stateless Oblivious RAM.
Proceedings of the 9th IEEE European Symposium on Security and Privacy, 2024

NTRU-Based FHE for Larger Key and Message Space.
Proceedings of the Information Security and Privacy - 29th Australasian Conference, 2024

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

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

Practical Randomized Lattice Gadget Decomposition with Application to FHE.
Proceedings of the Computer Security - ESORICS 2023, 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.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

FINAL: Faster FHE Instantiated with NTRU and LWE.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 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
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.
Proceedings of the Cryptography and Coding - 17th IMA International Conference, 2019

2018
Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS.
Proceedings of the Information Security and Privacy - 23rd Australasian Conference, 2018


  Loading...