Aeyoung Kim

The fuzzy vault is an innovative way to share secret keys, combining traditional cryptography with biometrics and biometric template protection. This method forms the basis for the reliable operation of unmanned aerial vehicles (UAVs) through anonymizing drone operators and safely using their data and onboard information. However, due to the inherent instability of biometrics, traditional fuzzy vault schemes face challenges, such as reduced recognition rates with increased chaff points, impractical runtimes due to high-order polynomial reconstruction, and susceptibility to correlation attacks. This paper proposes an efficient fuzzy vault scheme to address these challenges. We generate two secret keys based on biometrics: the first key is produced from the operator’s unique features like the face and iris, using a confidence interval; the second key, used to construct a polynomial, is based on what the operator remembers. These dual-key fuzzy vaults enable the stable generation of genuine points during encoding, easy extraction during decoding, and effective operator authentication while maintaining anonymity. Our experimental results demonstrate improved security and secret acquisition accuracy using the AR face database. These results are achieved regardless of increased false vaults, enabling real-time polynomial reconstruction and resilience against correlation attacks. Importantly, our enhanced fuzzy vault scheme allows the application of this secure, real-time authentication process, safeguarding the anonymity of drone operators.

The development of quantum computers has led to the possibility of solving problems intractable to deal with in clas-sical computers. That threatens the current standard of public-key cryptography based on factoring or discrete-log problem. As a result, it is necessary to use a secure cryptosystem even in a quantum computing environment. NIST has been conducting a Post-Quantum Cryptography (PQC) standardization process. Recently, there have been attempting to design binary MQ solver with the Grover's algorithm to solve the binary Multivariate Quadratic (MQ) problem. However, most PQC candidates based on the MQ problem do not select a small security parameter and are over GF(16) and above. In this paper, we design the Grover's oracle circuit to solve the MQ problem over GF(31) that can be used to analyze the quantum security of PQC candidates such as Rainbow and MQDSS.

Quantum modular multiplication circuit is one of the basic quantum computation circuits which are basic functions in quantum algorithms. However, since quantum-quantum modular multipliers require a high cost reversible modular inversion routine for modular multiplication, researchers have been unable to propose a feasible quantum-quantum modular multiplier. In this paper, we proposed efficient quantum-classical modular multipliers and the first quantum-quantum modular multipliers that do not require a reduction stage by transforming the partial product used in multiplication utilizing bit-shift operation. Then, we calculated quantum resource complexity and analyzed it compared to other quantum modular multipliers and utilized ETRI (Electronics and Telecommunications Research Institute) Qcrypton to analyze quantum resource complexity in the practical quantum computing situation. The proposed quantum modular multipliers show an improvement of 50% in terms of gates and circuit depth compared to the most recently proposed high-performance quantum modular multipliers.

KSII Transactions on Internet and Information Systems TIIS Paper Details

With the development of quantum computers, the security of public-key cryptosystems currently in use is now under serious threat. The National Institute of Standards and Technology (NIST) has initiated a process to standardize one or more quantum-resistant public-key cryptographic algorithms. Compared to code-based, lattice-based or hash-based cryptography, multivariate cryptography has much better performance in low-cost devices. In this paper, we compare the four NIST 2nd round candidates multivariate quadratic based signature schemes: GeMSS, LUOV, MQDSS and Rainbow. Also, we summarize several known attacks against the security of multivariate cryptography using classical and quantum approaches.

본 논문에서는 퍼지볼트와 스테가노그래피를 결합한 스마트폰 지문 인증 시스템을 제안한다. 생체정보를 이용한 인증은 높은 보안성을 제공하지만 생체정보는 타인에게 노출되면 수정이 불가능하다는 점에서 안전하게 다루어져야 한다. 만약 인증을 위해 변형된 생체정보가 사용된다면, 생체정보가 노출되더라도 원래의 생체정보는 안전하게 유지될 수 있다. 본 논문에서 제안하는 기법은 스마트폰에서 지문정보를 보호하기 위해 지문 인증 시스템에 퍼지볼트 기법을 적용한다. 또한, 퍼지볼트로 변형된 생체정보는 스테가노그래피 기법과 결합하여 은닉되므로 정보 노출에 더욱 안전할 수 있다. 그에 따라 지문 DB를 이용한 실험 결과는 기존에 알려진 이 두 기법을 결합한 방법이 지문 인식 센서를 가지고 있는 스마트폰의 사용자 인증에 높은 편리성과 보안성을 제공함을 보여준다.

We propose bio-password, a novel authentication scheme that improves both the convenience and security of web-site logins through a combination of biometrics and confidence interval sets. Many sites try to prevent weak password choices by enforcing password composition policies, but this can also make it harder for users to remember and generate passwords for different sites. Our proposed scheme provides an efficient solution for generating and managing strong passwords without memorization. We provide experimental results illustrating the efficiency of the proposed scheme and the manner in which it defends against variable attacks.

We propose a novel scheme for predicting the recognition performance by using confidence intervals. Biometrics is the best solution for preventing illegal sharing of authentication solutions (e.g., password, identity card) in a multi-factor authentication system. However, information acquired using sensors contains considerable noise, which can lead to errors. Our proposed scheme provides an efficient solution for treating noise and the resulting errors. When an image acquired using the sensor includes considerable noise and the estimated matching result is “fail,” the proposed scheme offers a short path. Our experimental results show the efficiency of the proposed scheme.