default search action
Saerom Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j11]Joohee Lee, Sangrae Cho, Soohyung Kim, Saerom Park:
Verifiable computation over encrypted data via MPC-in-the-head zero-knowledge proofs. Int. J. Inf. Sec. 24(1): 30 (2025) - 2024
- [j10]Junyoung Byun
, Yujin Choi
Privacy-preserving inference resistant to model extraction attacks. Expert Syst. Appl. 256: 124830 (2024) - [c6]Yujin Choi, Jinseong Park, Hoki Kim, Jaewook Lee, Saerom Park:
Fair Sampling in Diffusion Models through Switching Mechanism. AAAI 2024: 21995-22003 - [c5]Jaeyun Kim, Saerom Park, Joohee Lee, Jung Hee Cheon:
Privacy-Preserving Embedding via Look-up Table Evaluation with Fully Homomorphic Encryption. ICML 2024 - [i1]Stephen Casper, Jieun Yun, Joonhyuk Baek, Yeseong Jung, Minhwan Kim, Kiwan Kwon, Saerom Park, Hayden Moore, David Shriver, Marissa Connor, Keltin Grimes, Angus Nicolson, Arush Tagade, Jessica Rumbelow, Hieu Minh Nguyen, Dylan Hadfield-Menell:
The SaTML '24 CNN Interpretability Competition: New Innovations for Concept-Level Interpretability. CoRR abs/2404.02949 (2024) - 2023
- [j9]Junyoung Byun
Efficient homomorphic encryption framework for privacy-preserving regression. Appl. Intell. 53(9): 10114-10129 (2023) - [j8]Jinseong Park, Yujin Choi, Junyoung Byun, Jaewook Lee, Saerom Park:
Efficient differentially private kernel support vector classifier for multi-class classification. Inf. Sci. 619: 889-907 (2023) - 2022
- [j7]Eunyeong Ahn
Efficient Generation of Program Execution Hash. IEEE Access 10: 61707-61720 (2022) - [c4]Saerom Park, Seongmin Kim
Fairness Audit of Machine Learning Models with Confidential Computing. WWW 2022: 3488-3499 - [c3]Saerom Park, Junyoung Byun
Privacy-Preserving Fair Learning of Support Vector Machine with Homomorphic Encryption. WWW 2022: 3572-3583 - 2021
- [j6]Saerom Park
Stability Analysis of Denoising Autoencoders Based on Dynamical Projection System. IEEE Trans. Knowl. Data Eng. 33(8): 3155-3159 (2021) - 2020
- [j5]Saerom Park, Junyoung Byun
HE-Friendly Algorithm for Privacy-Preserving SVM Training. IEEE Access 8: 57414-57425 (2020) - [c2]Sungyoon Lee, Jaewook Lee, Saerom Park:
Lipschitz-Certifiable Training with a Tight Outer Bound. NeurIPS 2020
2010 – 2019
- 2019
- [j4]Saerom Park, Woojin Lee
Learning of indiscriminate distributions of document embeddings for domain adaptation. Intell. Data Anal. 23(4): 779-797 (2019) - [j3]Saerom Park, Jaewook Lee, Kyoungok Kim:
Semi-supervised distributed representations of documents for sentiment analysis. Neural Networks 119: 139-150 (2019) - [c1]Saerom Park, Jaewook Lee, Jung Hee Cheon, Juhee Lee, Jaeyun Kim, Junyoung Byun:
Security-preserving Support Vector Machine with Fully Homomorphic Encryption. SafeAI@AAAI 2019 - 2018
- [j2]Junghoon Hah, Woojin Lee
Information-Based Boundary Equilibrium Generative Adversarial Networks with Interpretable Representation Learning. Comput. Intell. Neurosci. 2018: 6465949:1-6465949:14 (2018) - [j1]Youngdoo Son
Learning representative exemplars using one-class Gaussian process regression. Pattern Recognit. 74: 185-197 (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 2024-12-11 21:44 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: