default search action
Yongwoo Lee 0002
Person information
- affiliation: Samsung Advanced Institute of Technology, Suwon, Gyeonggi-do, Korea
- affiliation: Inha University, Korea
Other persons with the same name
- Yongwoo Lee (aka: Yong-Woo Lee, Yong-woo Lee) — disambiguation page
- Yongwoo Lee 0001
— Yonsei University, Korea
- Yongwoo Lee 0003 — Sungkyunkwan University, Suwon, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Andrey Kim
General Bootstrapping Approach for RLWE-Based Homomorphic Encryption. IEEE Trans. Computers 73(1): 86-96 (2024) - [j9]Anisha Mukherjee, Aikata, Ahmet Can Mert, Yongwoo Lee, Sunmin Kwon, Maxim Deryabin, Sujoy Sinha Roy:
ModHE: Modular Homomorphic Encryption Using Module Lattices Potentials and Limitations. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(1): 527-562 (2024) - 2023
- [j8]Ahmet Can Mert, Aikata, Sunmin Kwon, Youngsam Shin, Donghoon Yoo, Yongwoo Lee, Sujoy Sinha Roy:
Medha: Microcoded Hardware Accelerator for computing on Encrypted Data. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(1): 463-500 (2023) - [c5]Yongwoo Lee
Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption. EUROCRYPT (3) 2023: 227-256 - [i17]Junghyun Lee, Eunsang Lee, Young-Sik Kim, Yongwoo Lee, Joon-Woo Lee, Yongjune Kim, Jong-Seon No:
Optimizing Layerwise Polynomial Approximation for Efficient Private Inference on Fully Homomorphic Encryption: A Dynamic Programming Approach. CoRR abs/2310.10349 (2023) - [i16]Andrey Kim, Yongwoo Lee, Maxim Deryabin, Jieun Eom, Rakyong Choi:
LFHE: Fully Homomorphic Encryption with Bootstrapping Key Size Less than a Megabyte. IACR Cryptol. ePrint Arch. 2023: 767 (2023) - [i15]Anisha Mukherjee, Aikata, Ahmet Can Mert, Yongwoo Lee, Sunmin Kwon, Maxim Deryabin, Sujoy Sinha Roy:
ModHE: Modular Homomorphic Encryption Using Module Lattices: Potentials and Limitations. IACR Cryptol. ePrint Arch. 2023: 895 (2023) - 2022
- [j7]Joon-Woo Lee, HyungChul Kang
Privacy-Preserving Machine Learning With Fully Homomorphic Encryption for Deep Neural Network. IEEE Access 10: 30039-30054 (2022) - [j6]Seong-Joon Park, Yongwoo Lee, Jong-Seon No:
Iterative coding scheme satisfying GC balance and run-length constraints for DNA storage with robustness to error propagation. J. Commun. Networks 24(3): 283-291 (2022) - [c4]Ahmad Al Badawi, Jack Bates, Flávio Bergamaschi
OpenFHE: Open-Source Fully Homomorphic Encryption Library. WAHC@CCS 2022: 53-63 - [c3]Yongwoo Lee, Joon-Woo Lee, Young-Sik Kim
High-Precision Bootstrapping for Approximate Homomorphic Encryption by Error Variance Minimization. EUROCRYPT (1) 2022: 551-580 - [c2]Jinkyu Cho, Yongwoo Lee, ZaHyun Koo, Jong-Seon No, Young-Sik Kim:
Improving Key Size and Bit-Security of Modified pqsigRM. ICTC 2022: 1463-1467 - [i14]Ahmet Can Mert, Aikata, Sunmin Kwon, Youngsam Shin, Donghoon Yoo, Yongwoo Lee, Sujoy Sinha Roy:
Medha: Microcoded Hardware Accelerator for computing on Encrypted Data. CoRR abs/2210.05476 (2022) - [i13]Yongwoo Lee, Daniele Micciancio, Andrey Kim, Rakyong Choi, Maxim Deryabin, Jieun Eom, Donghoon Yoo:
Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2022: 198 (2022) - [i12]Ahmet Can Mert, Aikata, Sunmin Kwon, Youngsam Shin, Donghoon Yoo, Yongwoo Lee, Sujoy Sinha Roy:
Medha: Microcoded Hardware Accelerator for computing on Encrypted Data. IACR Cryptol. ePrint Arch. 2022: 480 (2022) - [i11]Ahmad Al Badawi, Jack Bates, Flávio Bergamaschi, David Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, Zeyu Liu, Daniele Micciancio, Ian Quah
OpenFHE: Open-Source Fully Homomorphic Encryption Library. IACR Cryptol. ePrint Arch. 2022: 915 (2022) - [i10]Jong-Seon No, Jinkyu Cho, Yongwoo Lee, ZaHyun Koo, Young-Sik Kim:
Enhanced pqsigRM: Code-Based Digital Signature Scheme with Short Signature and Fast Verification for Post-Quantum Cryptography. IACR Cryptol. ePrint Arch. 2022: 1493 (2022) - 2021
- [j5]ZaHyun Koo
Improved Reduction Between SIS Problems Over Structured Lattices. IEEE Access 9: 157083-157092 (2021) - [c1]Joon-Woo Lee, Eunsang Lee, Yongwoo Lee, Young-Sik Kim
High-Precision Bootstrapping of RNS-CKKS Homomorphic Encryption Using Optimal Minimax Polynomial Approximation and Inverse Sine Function. EUROCRYPT (1) 2021: 618-647 - [i9]Seong-Joon Park, Yongwoo Lee, Jong-Seon No:
Iterative DNA Coding Scheme With GC Balance and Run-Length Constraints Using a Greedy Algorithm. CoRR abs/2103.03540 (2021) - [i8]Joon-Woo Lee, HyungChul Kang, Yongwoo Lee, Woosuk Choi, Jieun Eom, Maxim Deryabin, Eunsang Lee, Junghyun Lee, Donghoon Yoo, Young-Sik Kim, Jong-Seon No:
Privacy-Preserving Machine Learning with Fully Homomorphic Encryption for Deep Neural Network. CoRR abs/2106.07229 (2021) - [i7]Andrey Kim, Maxim Deryabin, Jieun Eom, Rakyong Choi, Yongwoo Lee, Whan Ghang, Donghoon Yoo:
General Bootstrapping Approach for RLWE-based Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2021: 691 (2021) - [i6]Joon-Woo Lee, HyungChul Kang, Yongwoo Lee, Woosuk Choi, Jieun Eom, Maxim Deryabin, Eunsang Lee, Junghyun Lee, Donghoon Yoo, Young-Sik Kim, Jong-Seon No:
Privacy-Preserving Machine Learning with Fully Homomorphic Encryption for Deep Neural Network. IACR Cryptol. ePrint Arch. 2021: 783 (2021) - 2020
- [j4]Yongwoo Lee
Near-Optimal Polynomial for Modulus Reduction Using L2-Norm for Approximate Homomorphic Encryption. IEEE Access 8: 144321-144330 (2020) - [j3]Yongwoo Lee
Modified pqsigRM: RM Code-Based Signature Scheme. IEEE Access 8: 177506-177518 (2020) - [j2]Yongwoo Lee
Cryptanalysis of the Ivanov-Kabatiansky-Krouk-Rumenko Cryptosystems. IEEE Commun. Lett. 24(12): 2678-2681 (2020) - [i5]Yongwoo Lee, Joon-Woo Lee, Young-Sik Kim, Jong-Seon No:
Near-optimal Polynomial for Modulus Reduction Using L2-norm for Approximate Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2020: 488 (2020) - [i4]Joon-Woo Lee, Eunsang Lee, Yongwoo Lee, Young-Sik Kim, Jong-Seon No:
Optimal Minimax Polynomial Approximation of Modular Reduction for Bootstrapping of Approximate Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2020: 552 (2020) - [i3]Yongwoo Lee, Joon-Woo Lee, Young-Sik Kim, HyungChul Kang, Jong-Seon No:
High-Precision Approximate Homomorphic Encryption by Error Variance Minimization. IACR Cryptol. ePrint Arch. 2020: 1549 (2020) - [i2]HyungChul Kang, Joon-Woo Lee, Yongwoo Lee, Young-Sik Kim, Jong-Seon No:
Bootstrapping on SEAL. IACR Cryptol. ePrint Arch. 2020: 1594 (2020)
2010 – 2019
- 2019
- [i1]Yongwoo Lee, Wijik Lee, Young-Sik Kim, Jong-Seon No:
A Modified pqsigRM: RM Code-Based Signature Scheme. IACR Cryptol. ePrint Arch. 2019: 678 (2019) - 2017
- [j1]Yongwoo Lee, Young-Sik Kim
Ciphertext-Only Attack on Linear Feedback Shift Register-Based Esmaeili-Gulliver Cryptosystem. IEEE Commun. Lett. 21(5): 971-974 (2017)
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 2024-12-02 22:33 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: