default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCheol-Min Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Sang-Hee Lee
, Cheol-Min Park:
A New Perspective on Shape and Distribution: Branch Length Similarity Entropy Approach. IEEE Access 12: 137259-137267 (2024)- [j19]Seungwoo Sim, Cheol-Min Park, Sang-Hee Lee, Haeun Cho, Youngheum Ji, Heeso Noh, Sang-im Lee:
The effect of avian eggshell membrane structure on microbial penetration: A simulation study. Biosyst. 240: 105234 (2024) - 2023
- [j18]Sang-Hee Lee, Cheol-Min Park:
Exploring the effects of high curvature section distribution and density in termite tunnels on food transport efficiency: A simulation study. Biosyst. 231: 104985 (2023) - 2022
- [j17]Sang-Hee Lee, Cheol-Min Park:
Characteristics of Peak and Cliff in Branch Length Similarity Entropy Profiles for Binary Time-Series and Their Application. IEEE Access 10: 107259-107268 (2022) - 2021
- [j16]Sang-Hee Lee, Cheol-Min Park:
A New Measure to Characterize the Self-Similarity of Binary Time Series and its Application. IEEE Access 9: 73799-73807 (2021) - [j15]Sang-Hee Lee, Cheol-Min Park:
Novel Features for Binary Time Series Based on Branch Length Similarity Entropy. Entropy 23(4): 480 (2021) - 2020
- [j14]Kyung-Ah Shim, Cheol-Min Park, Namhun Koo:
An Efficient MQ-Signature Scheme Based on Sparse Polynomials. IEEE Access 8: 26257-26265 (2020) - [j13]Sang-Hee Lee, Cheol-Min Park, UJin Choi:
A New Measure to Characterize the Degree of Self-Similarity of a Shape and Its Applicability. Entropy 22(9): 1061 (2020) - [j12]Kyung-Ah Shim, Cheol-Min Park, Namhun Koo, Hwajeong Seo:
A High-Speed Public-Key Signature Scheme for 8-b IoT-Constrained Devices. IEEE Internet Things J. 7(4): 3663-3677 (2020)
2010 – 2019
- 2018
- [j11]Kyu-Chong Lee, Jongmee Lee, Baek Hui Kim, Kyeong Ah Kim, Cheol-Min Park:
Desmoid-type fibromatosis mimicking cystic retroperitoneal mass: case report and literature review. BMC Medical Imaging 18(1): 29:1-29:4 (2018) - [j10]Cheol-Min Park:
Cryptanalysis of Matrix-based UOV. Finite Fields Their Appl. 50: 209-221 (2018) - 2017
- [j9]Kyung-Ah Shim, Cheol-Min Park, Namhun Koo:
Cryptanalysis of RGB, a mixed multivariate signature scheme. Finite Fields Their Appl. 45: 406-421 (2017) - [c8]Kyung-Ah Shim, Cheol-Min Park, Namhun Koo:
An Existential Unforgeable Signature Scheme Based on Multivariate Quadratic Equations. ASIACRYPT (1) 2017: 37-64 - [c7]Kyung-Ah Shim, Namhun Koo, Cheol-Min Park:
Security Analysis of Improved Cubic UOV Signature Schemes. ICISC 2017: 310-324 - 2015
- [j8]Kyung-Ah Shim, Cheol-Min Park:
A Secure Data Aggregation Scheme Based on Appropriate Cryptographic Primitives in Heterogeneous Wireless Sensor Networks. IEEE Trans. Parallel Distributed Syst. 26(8): 2128-2139 (2015) - [c6]Kyung-Ah Shim, Cheol-Min Park, Yoo-Jin Baek:
Lite-Rainbow: Lightweight Signature Schemes Based on Multivariate Quadratic Equations and Their Secure Implementations. INDOCRYPT 2015: 45-63 - 2014
- [j7]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) - [j6]Seongan Lim, Eunjeong Lee, Cheol-Min Park:
Equivalent public keys and a key substitution attack on the schemes from vector decomposition. Secur. Commun. Networks 7(8): 1274-1282 (2014) - 2013
- [j5]Kyung-Ah Shim, Young-Ran Lee, Cheol-Min Park:
EIBAS: An efficient identity-based broadcast authentication scheme in wireless sensor networks. Ad Hoc Networks 11(1): 182-189 (2013) - [j4]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) - 2012
- [j3]Seongan Lim, Eunjeong Lee, Cheol-Min Park:
A short redactable signature scheme using pairing. Secur. Commun. Networks 5(5): 523-534 (2012) - 2011
- [j2]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) - [c5]In Tae Kim, Chanil Park, Seongoun Hwang, Cheol-Min Park:
Implementation of Bilinear Pairings over Elliptic Curves with Embedding Degree 24. FGIT-MulGraB (1) 2011: 37-43 - [i2]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)
2000 – 2009
- 2009
- [j1]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) - [c4]Hyang-Sook Lee, Cheol-Min Park:
Generating Pairing-Friendly Curves with the CM Equation of Degree 1. Pairing 2009: 66-77 - 2008
- [i1]Eunjeong Lee, Hyang-Sook Lee, Cheol-Min Park:
Efficient and Generalized Pairing Computation on Abelian Varieties. IACR Cryptol. ePrint Arch. 2008: 40 (2008) - 2005
- [c3]Cheol-Min Park, Myung-Hwan Kim, Moti Yung:
A Remark on Implementing the Weil Pairing. CISC 2005: 313-323 - [c2]Cheol-Min Park, Dae-Won Kim, Jun Hwang:
Energy-Aware Broadcasting Method for Wireless Sensor Network. EUC Workshops 2005: 228-237 - [c1]Kyung-Won Nam, Jun Hwang, Cheol-Min Park, Young-Chan Kim:
Energy-Efficiency Method for Cluster-Based Sensor Networks. ICCSA (1) 2005: 1170-1176
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-10-23 20:34 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:
