Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jincheol Ha

dblp:151/7279 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2025
0000-0003-0496-1450ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5 · 2 first-author · 5 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
5 papers
Cryptographic primitives and cryptanalysis · 100%

Topics — the 12 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
homomorphic encryption
1.932025
Refined TFHE Leveled Homomorphic Evaluation and Its Application · CCS 2025
Rubato: Noisy Ciphers for Approximate Homomorphic Encryption · EUROCRYPT (1) 2022
Transciphering Framework for Approximate Homomorphic Encryption · ASIACRYPT (3) 2021
Cryptographic primitives and cryptanalysis › homomorphic encryption
circuit bootstrapping
0.912025
Refined TFHE Leveled Homomorphic Evaluation and Its Application · CCS 2025
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption
0.912025
Refined TFHE Leveled Homomorphic Evaluation and Its Application · CCS 2025
Cryptographic primitives and cryptanalysis
hash functions
0.912025
sfPolocolo: A ZK-Friendly Hash Function Based on S-Boxes Using Power Residues · EUROCRYPT (4) 2025
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
TFHE
0.912025
Refined TFHE Leveled Homomorphic Evaluation and Its Application · CCS 2025
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
post-quantum signatures
0.712023
AIM: Symmetric Primitive for Shorter Signatures with Stronger Security · CCS 2023
Cryptographic primitives and cryptanalysis › symmetric cryptography
symmetric primitives
0.712023
AIM: Symmetric Primitive for Shorter Signatures with Stronger Security · CCS 2023
Cryptographic primitives and cryptanalysis
block cipher
0.612022
Rubato: Noisy Ciphers for Approximate Homomorphic Encryption · EUROCRYPT (1) 2022
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
CKKS
0.512021
Transciphering Framework for Approximate Homomorphic Encryption · ASIACRYPT (3) 2021
Cryptographic primitives and cryptanalysis
symmetric cryptography
0.512021
Transciphering Framework for Approximate Homomorphic Encryption · ASIACRYPT (3) 2021
Cryptographic primitives and cryptanalysis
transciphering
0.512021
Transciphering Framework for Approximate Homomorphic Encryption · ASIACRYPT (3) 2021
Cryptographic primitives and cryptanalysis
algebraic cryptanalysis
0.212023
AIM: Symmetric Primitive for Shorter Signatures with Stronger Security · CCS 2023

Methods — techniques the papers use, named apart from their topics

programmable bootstrapping · 0.9gate bootstrapping · 0.9stream cipher · 0.5
YearPublicationVenuePosition
2025 Refined TFHE Leveled Homomorphic Evaluation and Its Application
abstract
TFHE is a fully homomorphic encryption scheme over the torus that supports fast bootstrapping. Its primary evaluation mechanism is based on gate bootstrapping and programmable bootstrapping (PBS), which computes functions while simultaneously refreshing noise. PBS-based evaluation is user-friendly and efficient for small circuits; however, the number of bootstrapping operations increases exponentially with the circuit depth. To address the challenge of efficiently evaluating large-scale circuits, Chillotti et al. introduced a leveled homomorphic evaluation (LHE) mode at Asiacrypt 2017. This mode decouples circuit evaluation from bootstrapping, resulting in a speedup of hundreds of times over PBS-based methods. However, the remaining circuit bootstrapping (CBS) becomes a performance bottleneck, even though its frequency is linear with the circuit depth.
Ruida Wang, Jincheol Ha, Xuan Shen, Xianhui Lu, Chunling Chen, Kunpeng Wang 0001, Jooyoung Lee 0001
CCS2
2025 sfPolocolo: A ZK-Friendly Hash Function Based on S-Boxes Using Power Residues
Jincheol Ha, Seongha Hwang, Jooyoung Lee 0001, Mincheol Son
EUROCRYPT (4)1
2023 AIM: Symmetric Primitive for Shorter Signatures with Stronger Security
abstract
Post-quantum signature schemes based on the MPC-in-the-Head (MPCitH) paradigm are recently attracting significant attention as their security solely depends on the one-wayness of the underlying primitive, providing diversity for the hardness assumption in post-quantum cryptography. Recent MPCitH-friendly ciphers have been designed using simple algebraic S-boxes operating on a large field in order to improve the performance of the resulting signature schemes. Due to their simple algebraic structures, their security against algebraic attacks should be comprehensively studied.
Seongkwang Kim, Jincheol Ha, Mincheol Son, ByeongHak Lee, Dukjae Moon, Joohee Lee, Sangyub Lee 0002, Jihoon Kwon, Jooyoung Lee 0001
CCS2
2022 Rubato: Noisy Ciphers for Approximate Homomorphic Encryption
Jincheol Ha, Seongkwang Kim, ByeongHak Lee, Jooyoung Lee 0001, Mincheol Son
EUROCRYPT (1)1
2021 Transciphering Framework for Approximate Homomorphic Encryption
Jincheol Ha, Seongkwang Kim, ByeongHak Lee, Joohee Lee, Jooyoung Lee 0001, Dukjae Moon
ASIACRYPT (3)2