Cloud-assisted Industrial Internet of Things (IIoT) relies on cloud computing to provide massive data storage services. To ensure the confidentiality, sensitive industrial data need to be encrypted before being outsourced to cloud storage server. Public-key encryption with keyword search (PEKS) enables users to search target encrypted data by keywords. However, most existing PEKS schemes are based on conventional hardness assumptions, which are vulnerable to adversaries equipped with quantum computers in the near future. Moreover, they suffer from key exposure, and thus the security would be broken once the keys are compromised. In this paper, we propose a forward secure PEKS scheme (FS-PEKS) based on lattice assumptions for cloud-assisted IIoT, which is post-quantum secure. We integrate a lattice-based delegation mechanism into FS-PEKS to achieve forward security, such that the security of the system is still guaranteed even the keys are compromised by the adversaries. We define the first formal security model on forward security of PEKS, and prove the security of FS-PEKS under the model. As the keywords of industrial data are with inherently low entropy, we further extend FS-PEKS to resist insider keyword guessing attacks (IKGA). The comprehensive performance evaluation demonstrates that FS-PEKS is practical for cloud-assisted IIoT.
1 January 2019 in Advances in Mathematics of Communications
We revisit the factoring with known bits problem on RSA moduli. In 1996, Coppersmith showed that the RSA modulus $N = pq$ with balanced $p,q$ can be efficiently factored, if the high order $\frac{1}{4} \log_2 N$ bits of one prime factor is given. Later, this important result is also generalized to the factorization of RSA variants moduli such as $N = p^r q$ or $N = p_1 p_2 ··· p_n$. In 2000, Lim et al. proposed a new RSA variant with the modulus of the form $N = p^r q^s$, which is much faster in the decryption process than the standard RSA. Then from 2015 to 2018, in order to investigate the security property of this RSA variant, Lu et al. and Coron et al. have presented three works studying the polynomial-time factorization of $N = p^r q^s$ with partial known bits of $p^u q^v$ (or one of the prime factors $p,q$) for different choices of $u, v$. In this paper, we present a new lattice construction used for Coppersmith's method, and thus improve previous results. Namely, our result requires fewer known bits to recover the prime factors $p,q$. We also generalize our result to the factorization of $N = p_1^{r_1}p_2^{r_2}··· p_n^{r_n}$.
Prime Power RSA is a variant of the RSA scheme due to Takagi with modulus for , where are of the same bit-size. In this paper, we concentrate on one type of Prime Power RSA which assumes . Two new attacks on this type of Prime Power RSA are presented when given two pairs of public and private exponents, namely, and with the same modulus N. Suppose that . In 2015, Zheng and Hu showed that when , N may be factored in probabilistic polynomial time. The first attack of this paper shows that one can obtain the factorization of N in probabilistic polynomial time, provided that . Later, in the second attack, we improve both the first attack and the attack of Zheng and Hu, and show that the condition already suffices to break the Prime Power RSA. By introducing multiple parameters, our lattice constructions take full advantage of known information, and obtain the best known attack. Specifically, we make full use of the information that is a divisor of N, while the attack of Zheng and Hu only assumes that is a divisor of N. As a consequence, this method implies a better lattice construction, and thus improves the previous attack. The experiments which reach a better upper bound than before also verify it. Our approaches are based on Coppersmith’s method for finding small roots of bivariate modular polynomial equations.
1 January 2021 in Advances in Mathematics of Communications
In this paper, we study the condition of finding small solutions $ (x,y,z) = (x_0, y_0, z_0) $ of the equation $ Bx-Ay = z $. The framework is derived from Wiener's small private exponent attack on RSA and May-Ritzenhofen's investigation about the implicit factorization problem, both of which can be generalized to solve the above equation. We show that these two methods, together with Coppersmith's method, are equivalent for solving $ Bx-Ay = z $ in the general case. Then based on Coppersmith's method, we present two improvements for solving $ Bx-Ay = z $ in some special cases. The first improvement pays attention to the case where either $ \gcd(x_0,z_0,A) $ or $ \gcd(y_0,z_0,B) $ is large enough. As the applications of this improvement, we propose some new cryptanalysis of RSA, such as new results about the generalized implicit factorization problem, attacks with known bits of the prime factor, and so on.
25 October 2023 in Journal of Systems Science and Complexity
UAV-to-satellite cross-view geo-localization must retain the correct location in a sufficiently broad global shortlist while limiting the online cost of candidate-level geometric verification. Existing work has largely emphasized stronger cross-view representations or multi-frame/trajectory reasoning; this paper instead studies how to allocate a fixed local-verification budget for a single UAV query. We propose a budget-aware coarse-to-fine framework in which MobileNetV3-Small retrieves a Top-100 gallery pool, spatially balanced SuperPoint features provide lightweight candidate-level evidence for either a non-parametric soft-overlap reranker or a learned 29-dimensional MLP reranker, and SuperPoint–LightGlue with RANSAC verifies only the selected Top-10. The reranking module is designed as a matcher-independent candidate allocation component, allowing the same principle to potentially extend to different local verification pipelines. The reranker is used twice: first to allocate the verification budget and then as a candidate prior fused with local geometric evidence for final ranking. On University-1652 selected-view queries, the MLP increases candidate Selection@1 from 53.92% to 61.39%; under the same Top-10 LightGlue budget, final Top-1 accuracy improves from 77.51% without reranking to 80.08% with soft-overlap and 80.13% with MLP-based fusion. On mid-angle queries, MLP fusion reaches 70.36%, compared with the 71.27% high-budget reference obtained by verifying all 100 candidates. A controlled feature ablation shows that the main gain of the 29-dimensional representation comes from combining the CNN retrieval prior with overlap/MNN statistics, while spatial-distribution cues provide a smaller complementary contribution. Separate component profiling supports the lightweight base cascade: MobileNetV3-Small and the sparse SuperPoint–LightGlue verification path have substantially lower model and memory/latency footprints than the ConvNeXt/LoFTR references. These results show that reranking improves candidate quality and recovers part of the accuracy lost by aggressive candidate truncation without increasing the number of locally verified candidates; the computational-efficiency evidence is attributed to the lightweight base cascade rather than to the MLP itself. A Blender module additionally provides a controllable simulation environment for examining heading and perspective variations beyond the real-data operating range.