Seonhong Min

Orcid: 0000-0002-1151-2453

According to our database1, Seonhong Min authored at least 13 papers between 2022 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Enhanced CKKS Bootstrapping with Generalized Polynomial Composites Approximation.
IACR Cryptol. ePrint Arch., 2025

On the Security and Privacy of CKKS-based Homomorphic Evaluation Protocols.
IACR Cryptol. ePrint Arch., 2025

Practical Circuit Privacy/Sanitization for TFHE.
IACR Cryptol. ePrint Arch., 2025

Ciphertext-Simulatable HE from BFV with Randomized Evaluation.
IACR Cryptol. ePrint Arch., 2025

Efficient Full Domain Functional Bootstrapping from Recursive LUT Decomposition.
IACR Cryptol. ePrint Arch., 2025

MatriGear: Accelerating Authenticated Matrix Triple Generation with Scalable Prime Fields via Optimized HE Packing.
Proceedings of the IEEE Symposium on Security and Privacy, 2025

2024
Carousel: Fully Homomorphic Encryption from Slot Blind Rotation Technique.
IACR Cryptol. ePrint Arch., 2024

Functional Bootstrapping for FV-style Cryptosystems.
IACR Cryptol. ePrint Arch., 2024

TopGear 2.0: Accelerated Authenticated Matrix Triple Generation with Scalable Prime Fields via Optimized HE Packing.
IACR Cryptol. ePrint Arch., 2024

More Efficient Lattice-based OLE from Circuit-private Linear HE with Polynomial Overhead.
IACR Cryptol. ePrint Arch., 2024

Ring-LWE based encrypted controller with unlimited number of recursive multiplications and effect of error growth.
CoRR, 2024

2023
Faster TFHE Bootstrapping with Block Binary Keys.
IACR Cryptol. ePrint Arch., 2023

2022
Towards Practical Multi-key TFHE: Parallelizable, Key-Compatible, Quasi-linear Complexity.
IACR Cryptol. ePrint Arch., 2022


  Loading...