标准模型下的二元域线性同态格签名方案OA

In response to the security challenges faced by current binary field linear homomorphic signature schemes in the context of quantum computing,as well as the limitations of the random oracle model assumption in practical applications,an efficient and secure binary field linear homomorphic lattice-based signature scheme under the standard model is constructed which allows arbitrary linear operations on signed messages and enables the generation of verifiable valid signatures for the computed results,making it suitable for practical scenarios such as network coding.Methodologically,the scheme is built upon hard problems in lattice theory,employs Gaussian sampling techniques to achieve weak context-hiding privacy protection,and introduces a chameleon hash function to achieve existential unforgeability against adaptive chosen-message attacks under the standard model.Experiment and theoretical analysis demonstrate that the proposed scheme achieves the highest security level among existing schemes under the standard model,while outperforming existing standard model schemes in terms of public key size,lattice basis matrix dimensions,and hard problem parameters.The findings indicate that,compared to similar schemes under the random oracle model,this scheme maintains competitive signature length and computational efficiency while eliminating the idealized hash assumption,thus achieving a favorable balance among security,practicality,and efficiency.