A5061996975- Cryptography and Data Security
- Coding theory and cryptography
- Cryptographic Implementations and Security
- Cryptography and Residue Arithmetic
- Chaos-based Image/Signal Encryption
- Privacy-Preserving Technologies in Data
- Cloud Data Security Solutions
- Security and Verification in Computing
Korea Institute for Advanced Study
2021-2025
École Normale Supérieure de Lyon
2021
Université Claude Bernard Lyon 1
2021
Centre National de la Recherche Scientifique
2021
Seoul National University
2016
Fully Homomorphic Encryption (FHE) is a cryptographic primitive that allows performing arbitrary operations on encrypted data. Since the conception of idea in [RAD78], it has been considered holy grail cryptography. After first construction 2009 [Gen09], evolved to become practical with strong security guarantees. Most modern constructions are based well-known lattice problems such as Learning With Errors (LWE). Besides its academic appeal, recent years FHE also attracted significant...
Fully Homomorphic Encryption over the Torus (TFHE) is a homomorphic encryption scheme which supports efficient Boolean operations encrypted bits. TFHE has unique feature in that evaluation of each binary gate followed by bootstrapping procedure to refresh noise ciphertext. In particular, this involves two algorithms called blind rotation and key-switching.
A simultaneous Diophantine approximation (SDA) algorithm takes instances of the partial approximate common divisor (PACD) problem as input and outputs a solution. While several encryption schemes have been published their securities depend on presumed hardness variant PACD problem, fewer studies attempted to extend SDA be applicable these variants. In this study, is extended solve general problem. order proceed, first variants are classified how for each suggested. Technically, authors show...
The authors present a classical polynomial-time attack against the branching program obfuscator of Fernando–Rasmussen–Sahai (for short FRS, Asiacrypt’17) (with one zerotest parameter), which is robust all known cryptanalyses on obfuscators when instantiated with CLT13 multilinear map. first step to recover plaintext modulus To achieve goal, Coron and Notarnicola (Asiacrypt’19) algorithm applied. However, because parameter issues, cannot be used directly. In order detour issue, convert an FRS...