The mutual influence between information and infectious diseases during the spreading process is becoming increasingly prominent. To elucidate the impact of factors such as higher-order interactions, interpersonal distances, and asymptomatic carriers on the coupled propagation of information and infectious diseases, a novel coupled spreading model is constructed based on a two-layer complex network, where one layer is a higher-order network and another layer is a weighted network. The higher-order interactions in information propagation are characterized using a 2-simplex, and a sUARU (simplicial unaware-aware-removed-unaware) model is employed to articulate information propagation. The inter-individual social distances in disease propagation are represented by the weights of a weighted network, and an SEIS (susceptible-exposed-infected-susceptible) model is utilized to describe disease propagation. The dynamic equations of coupled spreading are formulated utilizing the microscopic Markov chain approach. An analytical expression for the epidemic threshold is obtained by deriving it from the steady-state form of the dynamic equations. Comprehensive simulations are conducted to scrutinize the dynamic characteristics of the coupled spreading model. The findings indicate that enhancing the effects of higher-order interactions in information propagation and increasing inter-individual social distances both lead to higher outbreak thresholds and greater spreading of diseases. Additionally, a stronger infectivity among asymptomatic carriers and an extended incubation period are favorable for the outbreak and spread of an epidemic. These findings can provide meaningful guidance for the prevention and control of real-world epidemics.
Post-quantum digital signatures are needed to protect authentication against quantum attacks. Code-based techniques offer a promising foundation for this goal. Linkable ring signatures additionally provide signer anonymity and public linkage, but repeated membership proofs can incur substantial communication costs. We propose a linkable ring signature based on polar codes with reusable anonymous authorization. The scheme supports independently verifiable messages, public linking across rings, and repeated signing. Under the stated primitive assumptions and honest registration, we prove unforgeability, restricted anonymity, linkability, and non-frameability in the classical random oracle model. For parameters selected against a 128-bit classical generic-attack target, the authorization proof is 98.52% shorter than the selected-matrix implementation of the same relation for a 32-member ring, and each cached online packet occupies 807 bytes. Compared with a direct-proof baseline using the same parameters, certificate reuse reduces total communication from the second message onward for all evaluated ring sizes. A prototype executes key generation, authorization, certificate installation, and online signing and verification with actual polar-code keys. For a 1024-member ring, the authorization certificate occupies 189.5 MB. For a single verifier with pre-distributed rings, total communication is lower than that of a reference linkable ring signature scheme for workloads of at least 6561 messages.