default search action
Jiseung Kim 0001
Person information
- affiliation: Jeonbuk National University, Jeonju, South Korea
- affiliation (2020 - 2022): Korea Institute for Advanced Study, Seoul, South Korea
- affiliation (PhD): Seoul National University, South Korea
Other persons with the same name
- Jiseung Kim 0002 — University of Michigan, USA
- Jiseung Kim 0003 — Kyungil University, Gyeongsan, Korea
- Jiseung Kim 0004 — Kyung-IL University Department of Industrial Engineering, Daegu, Korea
- Jiseung Kim 0005
— Daegu Gyeongbuk Institute of Science and Technology (DGIST), South Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j10]Jung Hee Cheon, Wonhee Cho
Improved Universal Thresholdizer from Iterative Shamir Secret Sharing. J. Cryptol. 38(1): 15 (2025) - [i13]Jiseung Kim, Changmin Lee, Yongha Son:
Worst-case Analysis of Lattice Enumeration Algorithm over Modules. IACR Cryptol. ePrint Arch. 2025: 480 (2025) - 2024
- [j9]Jiseung Kim, Changmin Lee:
Finding small roots for bivariate polynomials over the ring of integers. Adv. Math. Commun. 18(3): 614-623 (2024) - [i12]Jiseung Kim
Reduce and Prange: Revisiting Prange's Information Set Decoding for LPN and RSD. IACR Cryptol. ePrint Arch. 2024: 276 (2024) - [i11]Jiseung Kim, Hyung Tae Lee, Yongha Son:
Revisiting Shuffle-Based Private Set Unions with Reduced Communication. IACR Cryptol. ePrint Arch. 2024: 1560 (2024) - [i10]Wonhee Cho, Jiseung Kim, Changmin Lee:
(In)Security of Threshold Fully Homomorphic Encryption based on Shamir Secret Sharing. IACR Cryptol. ePrint Arch. 2024: 1858 (2024) - [i9]Seungwan Hong, Jiseung Kim, Changmin Lee, Minhye Seo:
Fully Encrypted Machine Learning Protocol using Functional Encryption. IACR Cryptol. ePrint Arch. 2024: 1859 (2024) - 2023
- [j8]Jiseung Kim, Changmin Lee
A polynomial time algorithm for breaking NTRU encryption with multiple keys. Des. Codes Cryptogr. 91(8): 2779-2789 (2023) - [j7]Heewon Chung, Dongwoo Kim, Jeong Han Kim, Jiseung Kim:
Amortized efficient zk-SNARK from linear-only RLWE encodings. J. Commun. Networks 25(3): 271-284 (2023) - [i8]Jung Hee Cheon, Wonhee Cho, Jiseung Kim:
Improved Universal Thresholdizer from Threshold Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2023: 545 (2023) - 2022
- [j6]Jung Hee Cheon, Wonhee Cho
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions. Des. Codes Cryptogr. 90(8): 1735-1760 (2022) - [j5]Jiseung Kim
Cryptanalysis of FRS obfuscation based on the CLT13 multilinear map. IET Inf. Secur. 16(3): 208-219 (2022) - [i7]Minki Hhan, Jiseung Kim, Changmin Lee, Yongha Son:
How to Meet Ternary LWE Keys on Babai's Nearest Plane. IACR Cryptol. ePrint Arch. 2022: 1473 (2022) - 2021
- [j4]Wonhee Cho
(In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps. Des. Codes Cryptogr. 89(5): 973-1016 (2021) - [j3]Wonhee Cho
Extension of simultaneous Diophantine approximation algorithm for partial approximate common divisor variants. IET Inf. Secur. 15(6): 417-427 (2021) - [c3]Jung Hee Cheon, Wonhee Cho
Adventures in Crypto Dark Matter: Attacks and Fixes for Weak Pseudorandom Functions. Public Key Cryptography (2) 2021: 739-760 - 2020
- [j2]Jung Hee Cheon, Wonhee Cho
Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem. J. Math. Cryptol. 14(1): 397-413 (2020) - [i6]Jung Hee Cheon, Wonhee Cho, Jeong Han Kim, Jiseung Kim:
Adventures in Crypto Dark Matter: Attacks, Fixes and Analysis for Weak Pseudorandom Function Candidates. IACR Cryptol. ePrint Arch. 2020: 783 (2020)
2010 – 2019
- 2019
- [c2]Jung Hee Cheon, Wonhee Cho
Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map. CRYPTO (3) 2019: 253-283 - [i5]Jung Hee Cheon, Wonhee Cho, Minki Hhan, Minsik Kang, Jiseung Kim, Changmin Lee:
Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem. IACR Cryptol. ePrint Arch. 2019: 195 (2019) - [i4]Jiseung Kim, Changmin Lee:
Cryptanalysis of FRS Obfuscation based on the CLT13 Multilinear Map. IACR Cryptol. ePrint Arch. 2019: 1254 (2019) - 2018
- [j1]Jung Hee Cheon, Minki Hhan, Jiseung Kim
Cryptanalysis on the HHSS Obfuscation Arising From Absence of Safeguards. IEEE Access 6: 40096-40104 (2018) - [c1]Jung Hee Cheon, Minki Hhan, Jiseung Kim
Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem. CRYPTO (3) 2018: 184-210 - [i3]Jung Hee Cheon, Minki Hhan, Jiseung Kim, Changmin Lee:
Cryptanalysis on the HHSS Obfuscation Arising from Absence of Safeguards. IACR Cryptol. ePrint Arch. 2018: 397 (2018) - [i2]Jung Hee Cheon, Minki Hhan, Jiseung Kim, Changmin Lee:
Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from NTRU Attack. IACR Cryptol. ePrint Arch. 2018: 408 (2018) - [i1]Jung Hee Cheon, Wonhee Cho, Minki Hhan, Jiseung Kim, Changmin Lee:
Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map. IACR Cryptol. ePrint Arch. 2018: 1081 (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-05-18 20:27 CEST 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: