default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHyang-Sook Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j25]Hyang-Sook Lee, Seongan Lim, Ikkwon Yie, Aaram Yun:
On Insecure Uses of BGN for Privacy Preserving Data Aggregation Protocols. Fundam. Informaticae 188(2): 91-101 (2022)- 2021
- [j24]Sohyun Jeon
, Hyang-Sook Lee, Jeongeun Park:
Efficient Lattice Gadget Decomposition Algorithm With Bounded Uniform Distribution. IEEE Access 9: 17429-17437 (2021) - [j23]Soo-Kyung Eom, Hyang-Sook Lee, Seongan Lim, Kyunghwan Song:
Analysis on Yu et al.'s dynamic algorithm for canonic DBC. Discret. Appl. Math. 294: 31-40 (2021) - 2020
- [j22]Hyang-Sook Lee, Seongan Lim, Kyunghwan Song, Ikkwon Yie:
New orthogonality criterion for shortest vector of lattices and its applications. Discret. Appl. Math. 283: 323-335 (2020) - [j21]Gook Hwa Cho, Soonhak Kwon, Hyang-Sook Lee:
A refinement of Müller's cube root algorithm. Finite Fields Their Appl. 67: 101708 (2020) - [j20]Gook Hwa Cho, Seongan Lim, Hyang-Sook Lee:
Algorithms for the Generalized NTRU Equations and their Storage Analysis. Fundam. Informaticae 177(2): 115-139 (2020) - [j19]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) - 2019
- [j18]Juhee Lee, Seunghwan Chang, Taewan Kim, Hyang-Sook Lee, Seongan Lim:
Minimal condition for shortest vectors in lattices of low dimension. Electron. Notes Discret. Math. 71: 9-14 (2019) - 2018
- [j17]Youngjoo An, Hyang-Sook Lee, Juhee Lee, Seongan Lim:
Key Substitution Attacks on Lattice Signature Schemes Based on SIS Problem. Secur. Commun. Networks 2018: 8525163:1-8525163:13 (2018) - 2017
- [j16]Hyang-Sook Lee, Juhee Lee, Seongan Lim:
Duplication free public keys based on SIS-type problems. Finite Fields Their Appl. 48: 430-446 (2017) - [j15]Taewan Kim, Hyang-Sook Lee, Soojoon Lee:
Forgeable quantum messages in arbitrated quantum signature schemes. Quantum Inf. Process. 16(11): 268 (2017) - [j14]Seunghwan Chang, Hyang-Sook Lee, Juhee Lee, Seongan Lim:
Security Analysis of a Certificateless Signature from Lattices. Secur. Commun. Networks 2017: 3413567:1-3413567:7 (2017) - 2016
- [j13]Kyungmi Chung, Hyang-Sook Lee, Seongan Lim:
An efficient lattice reduction using reuse technique blockwisely on NTRU. Discret. Appl. Math. 214: 88-98 (2016) - 2015
- [j12]Hoon Hong, Eunjeong Lee, Hyang-Sook Lee:
Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves. Finite Fields Their Appl. 34: 45-74 (2015) - 2014
- [j11]Eunjeong Lee, Hyang-Sook Lee, Cheol-Min Park:
Polynomial generating pairing and its criterion for optimal pairing. Appl. Algebra Eng. Commun. Comput. 25(4): 227-247 (2014) - [j10]Seongan Lim, Hyang-Sook Lee, Mijin Choi:
An Efficient Decoding of Goppa Codes for the McEliece Cryptosystem. Fundam. Informaticae 133(4): 387-397 (2014) - 2013
- [j9]Hoon Hong, Eunjeong Lee, Hyang-Sook Lee, Cheol-Min Park:
Simple and exact formula for minimum loop length in Ate i pairing based on Brezing-Weng curves. Des. Codes Cryptogr. 67(2): 271-292 (2013) - 2011
- [j8]Soo-Kyung Eom, Hyang-Sook Lee, Cheol-Min Park:
Optimal pairing computation over families of pairing-friendly elliptic curves. Appl. Algebra Eng. Commun. Comput. 22(4): 235-248 (2011) - [j7]Hyang-Sook Lee, Seongan Lim:
An efficient incomparable public key encryption scheme. Inf. Sci. 181(14): 3066-3072 (2011) - 2009
- [j6]Eunjeong Lee, Hyang-Sook Lee, Cheol-Min Park:
Efficient and Generalized Pairing Computation on Abelian Varieties. IEEE Trans. Inf. Theory 55(4): 1793-1803 (2009) - 2008
- [j5]Eunjeong Lee, Hyang-Sook Lee, Yoonjin Lee:
Eta pairing computation on general divisors over hyperelliptic curves y. J. Symb. Comput. 43(6-7): 452-474 (2008) - 2005
- [j4]Iwan M. Duursma, Hyang-Sook Lee:
A group key agreement protocol from pairings. Appl. Math. Comput. 167(2): 1451-1456 (2005) - 2004
- [j3]Hyang-Sook Lee:
A self-pairing map and its applications to cryptography. Appl. Math. Comput. 151(3): 671-678 (2004) - [j2]Young-Ran Lee, Hyang-Sook Lee, Ho-Kyu Lee:
Multi-party authenticated key agreement protocols from multi-linear forms. Appl. Math. Comput. 159(2): 317-331 (2004) - 2003
- [j1]Hyun-Soo Hong, Ho-Kyu Lee, Hyang-Sook Lee, Hee-Jung Lee:
The better bound of private key in RSA with unbalanced primes. Appl. Math. Comput. 139(2-3): 351-362 (2003)
Conference and Workshop Papers
- 2023
- [c10]Sohyun Jeon, Hyang-Sook Lee, Jeongeun Park:
Practical Randomized Lattice Gadget Decomposition with Application to FHE. ESORICS (1) 2023: 353-371 - 2019
- [c9]Hyang-Sook Lee, Jeongeun Park:
On the Security of Multikey Homomorphic Encryption. IMACC 2019: 236-251 - 2018
- [c8]Eunkyung Kim, Hyang-Sook Lee, Jeongeun Park:
Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS. ACISP 2018: 101-113 - [c7]Soo-Kyung Eom, Hyang-Sook Lee, Seongan Lim:
On the Non-repudiation of Isogeny Based Signature Scheme. WISTP 2018: 63-77 - 2017
- [c6]Hyang-Sook Lee, Seongan Lim, Ikkwon Yie:
On Pairing Inversion of the Self-bilinear Map on Unknown Order Groups. CSCML 2017: 86-95 - [c5]Soyoung Ahn, Hyang-Sook Lee, Seongan Lim, Ikkwon Yie:
A Lattice Attack on Homomorphic NTRU with Non-invertible Public Keys. ICICS 2017: 248-254 - 2013
- [c4]Seunghwan Chang, Hoon Hong, Eunjeong Lee, Hyang-Sook Lee:
Pairing Inversion via Non-degenerate Auxiliary Pairings. Pairing 2013: 77-96 - 2009
- [c3]Hyang-Sook Lee, Cheol-Min Park:
Generating Pairing-Friendly Curves with the CM Equation of Degree 1. Pairing 2009: 66-77 - 2007
- [c2]Eunjeong Lee, Hyang-Sook Lee, Yoonjin Lee:
Eta Pairing Computation on General Divisors over Hyperelliptic Curves y2 = x7-x+/-1. Pairing 2007: 349-366 - 2003
- [c1]Iwan M. Duursma, Hyang-Sook Lee:
Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d. ASIACRYPT 2003: 111-123
Editorship
- 2014
- [e1]Hyang-Sook Lee, Dong-Guk Han:
Information Security and Cryptology - ICISC 2013 - 16th International Conference, Seoul, Korea, November 27-29, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8565, Springer 2014, ISBN 978-3-319-12159-8 [contents]
Informal and Other Publications
- 2023
- [i14]Younjin Kim, Jihye Kwon, Hyang-Sook Lee:
On Ideal Secret-Sharing Schemes for k-homogeneous access structures. CoRR abs/2309.07479 (2023) - [i13]Sohyun Jeon, Hyang-Sook Lee, Jeongeun Park:
Practical Randomized Lattice Gadget Decomposition With Application to FHE. IACR Cryptol. ePrint Arch. 2023: 535 (2023) - 2022
- [i12]Hyang-Sook Lee, Seongan Lim, Ikkwon Yie, Aaram Yun:
On Privacy Preserving Data Aggregation Protocols using BGN cryptosystem. CoRR abs/2208.11304 (2022) - 2021
- [i11]Sohyun Jeon, Hyang-Sook Lee, Jeongeun Park:
Efficient Lattice Gadget Decomposition Algorithm with Bounded Uniform Distribution. IACR Cryptol. ePrint Arch. 2021: 48 (2021) - 2019
- [i10]Hyang-Sook Lee, Jeongeun Park:
On the Security of Multikey Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2019: 1082 (2019) - 2018
- [i9]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) - 2013
- [i8]Seunghwan Chang, Hoon Hong, Eunjeong Lee, Hyang-Sook Lee:
Reducing Pairing Inversion to Exponentiation Inversion using Non-degenerate Auxiliary Pairing. IACR Cryptol. ePrint Arch. 2013: 313 (2013) - 2011
- [i7]Hoon Hong, Eunjeong Lee, Hyang-Sook Lee, Cheol-Min Park:
Simple and Exact Formula for Minimum Loop Length in Atei Pairing based on Brezing-Weng Curves. IACR Cryptol. ePrint Arch. 2011: 40 (2011) - 2008
- [i6]Eunjeong Lee, Hyang-Sook Lee, Cheol-Min Park:
Efficient and Generalized Pairing Computation on Abelian Varieties. IACR Cryptol. ePrint Arch. 2008: 40 (2008) - 2006
- [i5]Eunjeong Lee, Hyang-Sook Lee, Yoonjin Lee:
Fast computation of Tate pairing on general divisors of genus 3 hyperelliptic curves. IACR Cryptol. ePrint Arch. 2006: 125 (2006) - 2004
- [i4]Young-Ran Lee, Hyang-Sook Lee:
An Authenticated Certificateless Public Key Encryption Scheme. IACR Cryptol. ePrint Arch. 2004: 150 (2004) - 2003
- [i3]Ho-Kyu Lee, Hyang-Sook Lee, Young-Ran Lee:
An Authenticated Group Key Agreement Protocol on Braid groups. IACR Cryptol. ePrint Arch. 2003: 18 (2003) - [i2]Iwan M. Duursma, Hyang-Sook Lee:
Tate-pairing implementations for tripartite key agreement. IACR Cryptol. ePrint Arch. 2003: 53 (2003) - 2002
- [i1]Ho-Kyu Lee, Hyang-Sook Lee, Young-Ran Lee:
Multi-Party Authenticated Key Agreement Protocols from Multilinear Forms. IACR Cryptol. ePrint Arch. 2002: 166 (2002)
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-04-25 05:46 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:
