정보보호대학원에서는 9월 22일 오후 4시에 아래와 같이 콜로퀴움을 개최하고자 합니다. 많은 참석 부탁드립니다.
일 시: 26.9.22 (화) 16:00~
제 목: Asynchronous Lagrange-Based Threshold FHE with Smaller Modulus Overhead
강 사: 이창민 교수 (고려대학교)
장 소: N1 201호   
※ 세미나 시작시간 5분전에 준비하여 주세요.
 

ㅡㅡㅡ
 

♣Title: Asynchronous Lagrange-Based Threshold FHE with Smaller Modulus Overhead
 

♣Abstract:
We study t-out-of-n threshold fully homomorphic encryption (ThFHE) based on Shamir secret sharing (SSS) in the asynchronous setting. A central bottleneck for SSS-based ThFHE is that Lagrange reconstruction during distributed decryption can amplify noise, forcing a substantially larger ciphertext modulus to maintain correctness. 
In this work, we revisit SSS-based ThFHE and give a rigorous analysis of the correctness and simulation-security constraints that govern parameter choices. We then compare families of Lagrange interpolation points through the lens of these constraints.

Our main contributions are analytic bounds that closely track empirical behavior and significantly reduce the modulus overhead required for distributed decryption. For example, for n = 512, our analysis reduces this modulus overhead (in bits) by 30％ for t = n/2 and by up to 90％ for t close to n, compared to prior parameterizations.

♣Bio:
Changmin Lee is an Associate Professor at Korea University. His research focuses on lattice-based cryptography, homomorphic encryption, and cryptographic protocols. He received his Ph.D. in Mathematical Sciences from Seoul National University and was previously a postdoctoral researcher at ENS de Lyon and a Fellow at the Korea Institute for Advanced Study (KIAS).