Related Experiment Videos
Forward-Secure Linearly Homomorphic Signature Scheme in the Standard Model and Its Application
Linlin Wang1,2, Zuling Chang1
1School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450046, China.
Abstract:
Linearly homomorphic signatures (LHSs) are widely used in scenarios such as network coding and the Internet of Things, but their security faces the serious threat of key leakage. To address this issue, this paper introduces a forward secure mechanism into LHSs, aiming to construct a linearly homomorphic signature (LHS) scheme that can resist the risk of key leakage. By combining the binary tree minimal cover set mechanism with lattice-based extension algorithms, we construct an LHS scheme that supports time-period key updates. We prove its forward secure unforgeability under the standard model (SM) by reducing it to the Short Integer Solution (SIS) problem. To the best of our knowledge, this scheme is the first provably secure lattice-based forward secure linearly homomorphic signature (FSLHS) scheme in the SM, filling a theoretical gap in existing research. Furthermore, we apply this scheme to a smart grid data acquisition system and verify its practicality through concrete performance analysis.
Related Concept Videos
Singularity Functions for Shear
Application of Linearization and Approximation
Norton's Theorem
Extended Versions of Green’s Theorem
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
Linearization and Approximation