default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeongeun Park 0001
Person information
- affiliation: Norwegian University of Science and Technology, Trondheim, Norway
- affiliation (former): KU Leuven, COSIC, Belgium
- affiliation (PhD 2021): Ewha Womans University, Seoul, South Korea
Other persons with the same name
- Jeongeun Park 0002
![[0009-0003-6887-3158]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0009-0003-6887-3158")
— Korea University, Seoul, Korea - Jeongeun Park 0003 — Yonsei University, Wonju, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Pierrick Méaux, Jeongeun Park, Hilder V. L. Pereira:
Towards Practical Transciphering for FHE with Setup Independent of the Plaintext Space. IACR Commun. Cryptol. 1(1): 20 (2024)- [j5]Jeongeun Park, Barry Van Leeuwen, Oliver Zajonc:
FINALLY: A Multi-Key FHE Scheme Based on NTRU and LWE. IACR Commun. Cryptol. 1(3): 15 (2024) - [c10]Robin Jadoul, Axel Mertens, Jeongeun Park, Hilder V. L. Pereira:
NTRU-Based FHE for Larger Key and Message Space. ACISP (1) 2024: 141-160 - [c9]Kelong Cong, Debajyoti Das, Georgio Nicolas, Jeongeun Park:
Panacea: Non-Interactive and Stateless Oblivious RAM. EuroS&P 2024: 790-809 - [c8]Kelong Cong, Jiayi Kang, Georgio Nicolas, Jeongeun Park:
Faster Private Decision Tree Evaluation for Batched Input from Homomorphic Encryption. SCN (2) 2024: 3-23 - [i14]Robin Jadoul, Axel Mertens, Jeongeun Park, Hilder V. L. Pereira:
NTRU-based FHE for Larger Key and Message Space. IACR Cryptol. ePrint Arch. 2024: 634 (2024) - [i13]Kelong Cong, Jiayi Kang, Georgio Nicolas, Jeongeun Park:
Faster Private Decision Tree Evaluation for Batched Input from Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2024: 662 (2024) - [i12]Jeongeun Park, Barry Van Leeuwen, Oliver Zajonc:
FINALLY: A Multi-Key FHE Scheme Based on NTRU and LWE. IACR Cryptol. ePrint Arch. 2024: 1505 (2024) - 2023
- [j4]Jeongeun Park, Sergi Rovira:
Efficient TFHE Bootstrapping in the Multiparty Setting. IEEE Access 11: 118625-118638 (2023) - [c7]Kelong Cong, Debajyoti Das, Georgio Nicolas, Jeongeun Park:
Poster: Panacea - Stateless and Non-Interactive Oblivious RAM. CCS 2023: 3585-3587 - [c6]Sohyun Jeon, Hyang-Sook Lee, Jeongeun Park:
Practical Randomized Lattice Gadget Decomposition with Application to FHE. ESORICS (1) 2023: 353-371 - [i11]Kelong Cong, Debajyoti Das, Georgio Nicolas, Jeongeun Park:
Panacea: Non-interactive and Stateless Oblivious RAM. IACR Cryptol. ePrint Arch. 2023: 274 (2023) - [i10]Sohyun Jeon, Hyang-Sook Lee, Jeongeun Park:
Practical Randomized Lattice Gadget Decomposition With Application to FHE. IACR Cryptol. ePrint Arch. 2023: 535 (2023) - [i9]Jeongeun Park, Sergi Rovira:
Efficient TFHE Bootstrapping in the Multiparty Setting. IACR Cryptol. ePrint Arch. 2023: 759 (2023) - [i8]Kelong Cong, Robin Geelen, Jiayi Kang, Jeongeun Park:
Efficient and Secure k-NN Classification from Improved Data-Oblivious Programs and Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2023: 852 (2023) - [i7]Pierrick Méaux, Jeongeun Park, Hilder V. L. Pereira:
Towards Practical Transciphering for FHE with Setup Independent of the Plaintext Space. IACR Cryptol. ePrint Arch. 2023: 1531 (2023) - 2022
- [c5]Charlotte Bonte, Ilia Iliashenko, Jeongeun Park, Hilder V. L. Pereira, Nigel P. Smart:
FINAL: Faster FHE Instantiated with NTRU and LWE. ASIACRYPT (2) 2022: 188-215 - [c4]Kelong Cong, Debajyoti Das, Jeongeun Park, Hilder V. L. Pereira:
SortingHat: Efficient Private Decision Tree Evaluation via Homomorphic Encryption and Transciphering. CCS 2022: 563-577 - [i6]Charlotte Bonte, Ilia Iliashenko, Jeongeun Park, Hilder V. L. Pereira, Nigel P. Smart:
FINAL: Faster FHE instantiated with NTRU and LWE. IACR Cryptol. ePrint Arch. 2022: 74 (2022) - [i5]Kelong Cong, Debajyoti Das, Jeongeun Park, Hilder V. L. Pereira:
SortingHat: Efficient Private Decision Tree Evaluation via Homomorphic Encryption and Transciphering. IACR Cryptol. ePrint Arch. 2022: 757 (2022) - 2021
- [j3]Sohyun Jeon, Hyang-Sook Lee, Jeongeun Park:
Efficient Lattice Gadget Decomposition Algorithm With Bounded Uniform Distribution. IEEE Access 9: 17429-17437 (2021) - [j2]Jeongeun Park:
Homomorphic Encryption for Multiple Users With Less Communications. IEEE Access 9: 135915-135926 (2021) - [i4]Sohyun Jeon, Hyang-Sook Lee, Jeongeun Park:
Efficient Lattice Gadget Decomposition Algorithm with Bounded Uniform Distribution. IACR Cryptol. ePrint Arch. 2021: 48 (2021) - [i3]Jeongeun Park:
Homomorphic Encryption for Multiple Users with Less Communications. IACR Cryptol. ePrint Arch. 2021: 1085 (2021) - 2020
- [j1]Eunkyung Kim, Hyang-Sook Lee, Jeongeun Park:
Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS. Int. J. Found. Comput. Sci. 31(2): 157-174 (2020) - [c3]Jeongeun Park, Mehdi Tibouchi:
SHECS-PIR: Somewhat Homomorphic Encryption-Based Compact and Scalable Private Information Retrieval. ESORICS (2) 2020: 86-106
2010 – 2019
- 2019
- [c2]Hyang-Sook Lee, Jeongeun Park:
On the Security of Multikey Homomorphic Encryption. IMACC 2019: 236-251 - [i2]Hyang-Sook Lee, Jeongeun Park:
On the Security of Multikey Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2019: 1082 (2019) - 2018
- [c1]Eunkyung Kim, Hyang-Sook Lee, Jeongeun Park:
Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS. ACISP 2018: 101-113 - [i1]Eunkyung Kim, Hyang-Sook Lee, Jeongeun Park:
Towards Round-Optimal Secure Multiparty Computations: Multikey FHE without a CRS. IACR Cryptol. ePrint Arch. 2018: 1156 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
