Embedded Files
Our lab studies all aspects of provable security for cryptographic primitives and protocols. We analyze security of existing cryptographic schemes and design new schemes and protocols providing both efficiency and provable security.
Provable Security in Symmetric Cryptography
Design and security proof of (tweakable) block cipher structures and key-length-extension schemes
Design and security proof of hash functions, message authentication codes, and modes of operation
Post-quantum Cryptography
Design and cryptanalysis of white-box secure encryption schemes
Design and cryptanalysis of FHE/ZKP-friendly cryptographic primitives
Design and cryptanalysis of symmetric primitive-based signatures
The AIM one-way function
(AIM: Symmetric Primitive for Shorter Signatures with Stronger Security. S. Kim et al. ACM CCS 2023)
The RtF transciphering framework
(Transciphering Framework for Approximate Homomorphic Encryption. J.Cho, J.Ha, S.Kim, B.Lee, J.Lee, J.Lee, D.Moon and H.Yoon. Asiacrypt 2021)
XHX2 tweakable block cipher using almost universal/uniform hash functions g1, g2, h1, h2
(Tweakable Block Ciphers Secure Beyond the Birthday Bound in the Ideal Cipher Model. B. Lee and J. Lee. Asiacrypt 2018)
MJH hash function based on a block cipher E using a fixed involution σ and a constant θ
(MJH: A Faster Alternative to MDC-2. J. Lee and M. Stam. Designs, Codes and Cryptography, 2015)
석박사 과정에 관심있는 학생은 email로 문의해 주세요.
Page updated
Google Sites
Report abuse