Aug 2026· 2026 International Conference on Intelligent Multimedia, Networking, and Security (IMNS)· pp. 1-6· 0 citations· 13 references
Abstract
Module Learning with Errors (MLWE) cryptography normally treats decryption noise as a disturbance: it must be large enough to hide algebraic structure but small enough for reliable decoding. This paper studies a conditional design in which selected residual degrees of freedom also carry coarse physical sensing information. The construction is not presented as a dropin replacement for standardised ML-KEM. Instead, we specify the assumptions under which residual-layer sensing can be analysed, identify what must remain external to FIPS-approved ML-KEM, and give a Fujisaki-Okamoto (FO)/CCA compatibility roadmap. The paper contributes an explicit measurement-to-label pipeline $\boldsymbol{z}=Q(F(y))$, concrete ML-KEM parameter instantiations, residual-budget calculations including compression noise, formal bounds for security-decomposition terms, higher-order leakage bounds beyond balanced mean suppression, an adaptive tuning algorithm, and residual-level Monte Carlo validation. The central message is that structured residual information can be useful for cyber-physical trust only when distributionshape closeness, decoding reliability, sensing privacy, and contextspoofing resistance are all quantified.
SVIiT is described as communication-reduced relative to the evaluated MPC baselines rather than universally lightweight, and its present practical scope is primarily high-bandwidth LAN or provider-edge deployments.
Tingting Chen· ICST Transactions on Scalabl...· 0 citations
This paper revisits the continuous noise sampling protocols and makes several improvements in both security and efficiency and turns to discrete sampling at the granularity of individual biased bits to address the security and efficiency issues together.
PCGM-Net therefore provides low-latency, policy-selective inference-time semantic shielding under a bounded, evaluator-dependent threat model rather than irreversible anonymization.
Wei Zhang, Yifu Zeng, Qinglong Tian et al.· Italian National Conference...· 0 citations
A triangulated interpretable analysis across three independent models yields design insights that position array sizing and sensing subsystem design as a joint optimization, and reveals a regime-dependent, non-monotonic dependence of post-defense SINR on array size under AoA-aware null-steering defenses with finite sen...
E. Pacheco, C. Pedroso· IEEE Open Journal of the Com...· 0 citations
These findings expose time as a first class security primitive in FL systems and recommend integrating timing randomization, lightweight monitoring, and scheduler level defenses into frameworks such as Tensor Flow Federated.
B. Ibrahim, Ahmed Hameed Shakir, Hasan Jameel· Al-Noor Journal of Engineeri...· 0 citations
Experimental evaluations demonstrate that encrypted low-rank matrix multiplications achieve both significant runtime improvements and reduction of ciphertext sizes over direct or tree-based encrypted multiplications while maintaining the prescribed accuracy.
D. Schoinianakis, M. Sabzevari· IACR Cryptology ePrint Archi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.