<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/46475">
    <title>Repository Community: null</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/46475</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="https://scholar.dgist.ac.kr/handle/20.500.11750/61031" />
        <rdf:li rdf:resource="https://scholar.dgist.ac.kr/handle/20.500.11750/60984" />
        <rdf:li rdf:resource="https://scholar.dgist.ac.kr/handle/20.500.11750/60601" />
        <rdf:li rdf:resource="https://scholar.dgist.ac.kr/handle/20.500.11750/60407" />
      </rdf:Seq>
    </items>
    <dc:date>2026-11-21T07:50:16Z</dc:date>
  </channel>
  <item rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/61031">
    <title>Falcon 기반 V2X 메시지 전송 시뮬레이터 v1.0</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/61031</link>
    <description>Title: Falcon 기반 V2X 메시지 전송 시뮬레이터 v1.0
Author(s): 임우상; 김영식</description>
  </item>
  <item rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/60984">
    <title>Optimized layerwise approximation for efficient private inference on fully homomorphic encryption</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/60984</link>
    <description>Title: Optimized layerwise approximation for efficient private inference on fully homomorphic encryption
Author(s): Lee, Junghyun; Lee, Joon-Woo; Lee, Eunsang; Kim, Young-Sik; Lee, Yongwoo; Kim, Yongjune; No, Jong-Seon
Abstract: Recent studies have explored the deployment of privacy-preserving deep neural networks utilizing homomor phic encryption (HE), especially for private inference (PI). Many works have attempted the approximation-aware training (AAT) approach in PI, changing the activation functions of a model to low-degree polynomials that are easier to compute on HE by allowing model retraining. However, due to constraints in the training environ ment, it is often necessary to consider post-training approximation (PTA), using the pre-trained parameters of the existing plaintext model without retraining. Existing PTA studies have uniformly approximated the activation function in all layers to a high degree to mitigate accuracy loss from approximation, leading to significant time consumption. This study proposes an optimized layerwise approximation (OLA), a systematic framework that opti mizes both accuracy loss and time consumption by using different approximation polynomials for each layer in the PTA scenario. For efficient approximation, we reflect the layerwise impact on the classification accuracy by considering the actual input distribution of each activation function while constructing the optimization problem. Additionally, we provide a dynamic programming technique to solve the optimization problem and achieve the optimized layerwise degrees in polynomial time. As a result, we successfully approximated the ReLU and GELU functions, significantly reducing time latency while maintaining classification performance. Especially, the OLA method reduces inference times for the ResNet-20 model and the ResNet-32 model by 3.02 times and 2.82 times, respectively, compared to prior state-of-the-art implementations employing uniform degree polynomials.</description>
    <dc:date>2026-08-31T15:00:00Z</dc:date>
  </item>
  <item rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/60601">
    <title>Q-AMT: Multi-Target Security Assessment for Lattice KEMs</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/60601</link>
    <description>Title: Q-AMT: Multi-Target Security Assessment for Lattice KEMs
Author(s): 김광식; Kim, Young-Sik
Abstract: Security reductions for Fujisaki-Okamoto (FO)-style lattice key-encapsulation mechanisms (KEMs) in the quantum random-oracle model (QROM) incur non-tight loss terms that grow with an adversary's oracle access and the number of simultaneously attacked targets. While these losses are well characterized theoretically, their practical impact at deployment scale-where thousands of public keys may coexist under a single administrative domain-has not been systematically quantified. We present Q-AMT (QROM-motivated Amplified Multi-Target), a scheme-agnostic measurement framework that makes these losses operational for engineering decisions. Q-AMT formalizes a multi-target adversary model, derives practical surrogates for multi-target advantage, and defines a tightness gap metric Gamma that compares measured multi-target advantage to single-target baselines. The framework provides a round-based scheduler that allocates oracle budgets across targets, controls post-selection, and toggles oracle-hygiene configurations (domain separation and binding of KDF inputs to public-key-ciphertext context). We explicitly frame our classical proxy parameter q(G) as a concavity-sharing diagnostic-a tool for traversing the concavity regime of the single-target advantage function-rather than a simulation of quantum superposition queries. We prove that the resulting Gamma metric is invariant to the choice of concavity model and to the absolute security level, so that relative results at reduced lambda(eff) transfer to production-scale \lambda = 128 . We instantiate Q-AMT across representative lattice KEM families-MLWE/MLWR (ML-KEM/Kyber, SABER), NTRU-style (NTRU+), and FO-variant profiles-under constant-time, implicitly rejecting implementations and evaluate 1,056 configurations, including 192 lambda(eff) -invariance configurations, spanning fan-out N-t is an element of( ){1,...,32} , hash budgets q(H) up to 2(20) , five lambda(eff) values, and three post-selection rates. Under strict oracle hygiene, the measured tightness gap concentrates at Gamma = 1.022 +/- 0.310 across all configurations; disabling separation and/or binding raises the mean to Gamma = 1.127 with peaks near 2.0, confirming super-linear multi-target amplification from cross-target coupling, consistent with the formal multi-user QROM analysis of Duman et al. (2021). From the measured surfaces we extract operator-facing guidance: safe per-key query caps for given fan-out and acceptance rates, a worked 10,000-key enterprise deployment example, and an overhead-risk frontier showing that redundant FO/FO {}&lt;^&gt;{\perp } validation incurs 2-4% overhead across five hardware platforms (Cortex-M4/M7, ARMv8-A, x86-64, RISC-V) while substantially reducing the effective success probability of validation bypasses-even under targeted structural faults. Q-AMT does not directly compromise lattice KEMs; rather, it quantifies residual risk from multi-user accumulation and turns it into concrete engineering guidance.</description>
    <dc:date>2026-06-30T15:00:00Z</dc:date>
  </item>
  <item rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/60407">
    <title>Post-Quantum Cryptography Migration on V2X Certificate using KpqC Algorithms</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/60407</link>
    <description>Title: Post-Quantum Cryptography Migration on V2X Certificate using KpqC Algorithms
Author(s): Seo, Yujin; Kim, Young-Sik
Abstract: Connected vehicles utilizing Vehicle-to-Everything (V2X) communication enhance road safety and transportation efficiency, supporting cooperative autonomous driving through real-time interactions. However, increased connectivity raises cyber-attack risks, endangering driver and pedestrian safety. This highlights the urgent need to integrate Post-Quantum Cryptography (PQC) into vehicular communications [6]. In this paper, we implement the Korean PQC digital signature algorithm HAETAE for V2X environments and compare its performance with the NIST PQC signature scheme, ML-DSA which is derived from CRYSTALS-DILITHIUM, and traditional signatures, RSA, and ECC under TLS 1.3 environments. Results indicate that PQC algorithms introduce substantial overhead, whereas traditional algorithms produce smaller certificates. Specifically, HAETAE provides more efficient certificates than ML-DSA [3], minimizing latency impacts in TLS operations. These findings inform the critical balance between enhanced security and certificate size, guiding future post-quantum TLS designs.</description>
    <dc:date>2025-07-07T15:00:00Z</dc:date>
  </item>
</rdf:RDF>

